HDTenEightyP/NetNews huggingface dataset:
From: cqu@ringer.cs.utsa.edu (Chang-ning Qu)
Subject: Help needed about the Normal System.
Organization: University of Texas at San Antonio
Date: Fri, 20 Nov 1992 20:08:47 GMT


   Hi, there is a 3D American map demograph with the
   48 states' population and income data on Indigo
   machine. It has four display options: draw line,
   draw top, draw solid and draw lighted. We have
   the original code and we are trying to modify it
   to be a Texas county(254) map. After figuring out  
   the data structure, we created a binary file, 
   "counties.bin", with normal system as follows for
   side faces:  

       taking any consecutive points (x1,y1,1) and 
       (x2,y2,1) on the top, it could create a side 
       face by adding (x1,y1,0) and (x2,y2,0). So 
       the normal of the face could be determined by :

                        |   i     j     k |
   ----->   ->   ->     |                 |
   Normal = L2 X L1 =   | x1-x2  y1-y2  0 |                                     
                        |                 |
                        |   0     0    -1 |

            = - (y1-y2)i + (x1-x2)j + 0k
                          
            = [-(y1-y2), (x1-x2), 0] 
   
   then the normalized normal is

       -->     -(y1-y2)    x1-x2
        n  = ( --------,  --------, 0 )
                 NORM      NORM

                                      2         2
   where  NORM= square root[(-(y1-y2)) + (x1-x2) + 0]


                          Z
                          ^
                          |
                    ______________
                   |\    1|       \         
             (x1,y1,1)_____________\(x2,y2,1)
                   | |    | <-- |  |
                   | ||   |  L2 |  |  
                   | |v   |     |  |  
                   | |L1  |     |  |
                   | |    |     |  |
                   |_|____|_____|  |
                   \ |   0|_ _ _ \_|_ _ _ Y
                    \|___/________\|
               (x1,y1,0)/      (x2,y2,0) 
                       /
                      /
                     X             
    

   The problem is that we couldn't get correct illumination
when displaying in draw-solid and draw-lighted, they are just
reversed (lighted sides to be dark and dark becoming lighted)!
   
    The normal system of the original code seems using

       -->      x1-x2     -(y1-y2)
        n  = ( --------,  --------, 0 )
                 NORM       NORM

 but it can't make any sense why they calculated in that way!
and we have tried all possibilities of the normal system 
(including their way!), unfortunately, none of them works!
We began to doubt there might be something wrong in the normal
system of the original programs and they were fixed in somewhere
else?

    Could anyone help us to figure out what wrong it is? Or 
any suggestion? Thank you in advance.

Charlie Qu
FACTT Center
Univ of Texas at San Antonio   
E-mail: charlie@nacho.cr.utsa.edu
Newsgroups: comp.graphics
From: u910826@bruny.cc.utas.edu.au (Louis        siuoL)
Subject: TTF format
Summary: TTF format
Keywords: TTF format
Organization: University of Tasmania, Australia.
Date: Wed, 18 Nov 1992 09:01:28 GMT

Can some one please supply/of redirect me to the TrueType Font format ?

--
Louis Solomon - a student at The University of Tasmania
      e-mail: u910826@bruny.cc.utas.edu.au

"If wishes were fishes, we'd all cast nets" - Dune
Newsgroups: comp.graphics
From: marty@dxcern.cern.ch (Hugues Marty)
Subject: Wanted: good graph drawing algorithm
Keywords: Graph, node placement
Organization: CERN European Laboratory for Particle Physics
Date: Sun, 22 Nov 1992 16:26:23 GMT


I need to automatically display graphs (not trees - I known how
to display trees) and am searching for a good node placement
algorithm so that the graph is displayed nicely.  What I have seen
so far was not so good.  Anyone knows a good algorithm ?  Pointing
to some code sources would be greatly appreciated !

(btw: I prefer mailed answers since I don't have often access
to the news)

Thanks!
Hugues.
-- 
e+ ----> :-) <---- e-                         e-mail :
Les Chercheurs de Bosons Unifies              marty@dxcern.cern.ch
Newsgroups: comp.graphics
From: u438813@imux120.ncu.edu.tw (Lin Wei-Ting)
Subject: Resize a pixmap
Reply-To: u438813@imux120.ncu.edu.tw
Organization: Sun Microsystems, Inc.
Date: Wed, 18 Nov 1992 05:52:44 GMT

I want to find an algorithm to resize a pixmap.
Any suggestion will be appreciated.

Newsgroups: comp.graphics
From: sloan@cis.uab.edu (Kenneth Sloan)
Subject: Re: Point inside a triangle
Organization: CIS, University of Alabama at Birmingham
Date: Wed, 18 Nov 1992 00:34:15 GMT

In article <BxvnnI.90x@slipknot.rain.com> robert@slipknot.rain.com.UUCP (Robert Reed) writes:
>
>A trivial modification to the algorithm as I suggested it would correct for
>this.  If the boundaries of any polygon are to be considered interior, then if
>a bounding edge is collinear with the test point, it is sufficient to test
>whether the point is within the interval of the edge.  If it is not, the edge
>is trivially rejected as before.  If it is, the algorithm can be prematurely
>terminated with a TRUE result.

But...but...the point is:

Your "trivial modification" is virtually *all* of Professor O'Rourke's
algorithm!  By the time you make this trivial modification to your
algorithm, you might just as well throw away your algorithm.

This is a common problem when dealing with algorithm "sketches" - one
man's algorithm is another man's "special cases".  Often, you need bits
and pieces of both to handle everything.  Where you start is a matter of
taste, style, and judgement.

And, of course, de gustibus non disputandum est.

-- 
Kenneth Sloan                   Computer and Information Sciences
sloan@cis.uab.edu               University of Alabama at Birmingham
(205) 934-2213                  115A Campbell Hall, UAB Station 
(205) 934-5473 FAX              Birmingham, AL 35294-1170
Newsgroups: comp.graphics
From: jmains@engr.latech.edu (John P. Mains)
Subject: Re: MPEGXING QUESTION..HELP!
Reply-To: jmains@engr.latech.edu
Organization: Louisiana Tech University
Distribution: usa
Date: Thu, 19 Nov 1992 17:02:35 GMT

I had similar dificulties.  I tried reinstalling the trident graphics driver
for windows I found somewhere on the net.  I set the resolution at 640*480*256
and tried to run MPEG again.  It worked this time but it corrupted my background.
I never did get that problem fixed.  Otherwise, contact the people themselves.
Their address is in the documentation.  Maybe they can help.

JP
From: bvh@cse.unl.edu (Obi-Wan)
Newsgroups: comp.graphics
Subject: Re: Map Databases in vector format
Date: 20 Nov 1992 21:14:08 GMT
Organization: MicroImages, Inc.
Distribution: world
NNTP-Posting-Host: cse.unl.edu

In article <1992Nov17.144123.3513@lpi.liant.com>, joes@lpi.liant.com (Joe Stewart) writes:
> My previous post didn't generate any responses, so:
> 
> I'm looking for map databases that are in line/vector/polygon format.
> Both ftp and non-ftp sources would be great.  I'm aware of the data
> at spectrum.xerox.com.

I know the US census bureau makes its TIGER data available for the entire
country.  This covers most waterways, transportation routes, major buildings,
etc.  I'm not sure about price or who to contact.  Some guys I work with
would know.  I can get the specifics if anyone really wants them.

				-- Obi-Wan

-- 
 |\_/|  AACK! ||  Genius may have its   ||  "Obi-Wan" (Ben Hollingsworth)
\'o.0'/       ||  limitations, but      ||  MicroImages, Inc.  Lincoln, Nebraska
=(___)=       ||  stupidity is not thus ||  University of Nebraska - Lincoln
   U   PTHAT! ||  handicapped.          ||  email:  bvh@cse.unl.edu
Newsgroups: comp.graphics
From: piety@hplabsz.hpl.hp.com (Bob Piety)
Subject: TARGA-16 + SABLE FOR SALE  $750
Date: Tue, 17 Nov 1992 21:37:33 GMT
Organization: Hewlett-Packard Laboratories Palo Alto,CA
X-Newsreader: TIN [version 1.1.4 PL6]


TARGA-16 frame grabber board, with Sable paint program & Targa Tools.

$750/obo

Bob                 
piety@hpl.hp.com     
(415)857-4759  Voice 
(415)857-2862  FAX   
Palo Alto, California





Newsgroups: comp.graphics,comp.lang.c
From: ted@oz.plymouth.edu (Ted Wisniewski)
Subject: Re: Please Help Me Keep My Job!
Organization: Plymouth State College - Plymouth, NH.
Date: Thu, 19 Nov 92 22:41:35 GMT

In article <1992Nov19.173301.3870@kpc.com> hollasch@kpc.com (Steve Hollasch) writes:
>
>    My manager has asked me to finish several projects by the end of this
>year, and they're really hard!  I told her I could do them, but now I don't
>know; they're pretty tricky.  I'm sure other people have done stuff like
>this, so why should I reinvent the wheel?  Why not use the resources of the
>net?

	Get a clue,  If you told you boss you could do it, I say you should
do it.  If you cannot fulfill your responsibilities, you do not deserve to
have your Job!!  There are many qualified people out there who would be
more than happy to take it.  This is sort of like asking someone else to
do you homework for you.  Isn't that like 'plagiarism'?  Sounds to me
like you waited to the last minute.  I hope your boss reads this group!


	Just an honest opinion.

		--> Ted

|   Ted Wisniewski    			INET:  ted@oz.plymouth.edu       |
|   Academic Computing                               or                  |
|   Plymouth State College                     tedw@psc.plymouth.edu     |
|   Plymouth NH, 03264                                                   |
Newsgroups: comp.graphics
From: R5321GAB@vm.univie.ac.at
Subject: Converting from SOFTIMAGE to anything?
Organization: University of Vienna
Date: Fri, 20 Nov 1992 21:31:16 GMT

Hello all,
    I am looking for a way to convert SoftImage .hrc to some other format
(ie .obj, .DXF, ASCII). I don't have the licenses for the SOFT2WAVE or
anything. Is the some utility on either UNIX or Mac to do this? Also, is
anyone out there using Wavefront? I will be uploading some new models to
the chinalake FTP address sometime soon, so keep eyes open!

Patrick Maun
Hochschule fuer Angewandte Kunst
/Vienna, Austria
R5321GAB@AWIUNI11.BITNET

Newsgroups: comp.graphics
From: cbrooks@afit.af.mil (Christopher L Brooks)
Subject: RayShade for 386
Organization: Air Force Institute of Technology
Date: Thu, 19 Nov 1992 13:26:52 GMT

Hello netters -

Has anyone out there used Ray Shade (ray tracing program) for 
386 machines?  I ftp'd a version from wuarchive and am having some
problems getting it to run.  I suspect that I may not have enough
memory (4M).  Any suggestions would be appreciated.

Thanks,

Chris
Newsgroups: comp.graphics
From: sloan@cis.uab.edu (Kenneth Sloan)
Subject: Re: Point inside a triangle
Organization: CIS, University of Alabama at Birmingham
Date: Mon, 16 Nov 1992 04:43:58 GMT

In article <1992Nov16.013915.18762@sophia.smith.edu> orourke@sophia.smith.edu (Joseph O'Rourke) writes:
>...
>	I don't think the problem can be solved without multiplying
>coordinates of points.  It seems the simplest algorithm to understand
>simply requires x to be left of the directed lines through
>ab, bc, and ca, which is exactly what you are doing with your area
>calculations.

All true.  But (if Joe and I ever agree completely, then one of us will
have become redundant) ... the most useful, general purpose, etc. ...
thing to do is to use these calculations to compute the barycentric
coordinates of the point with respect to the triangle.  In the long run,
it's no more expensive than any other method which actually works, and
it provides lots more useful information.


-- 
Kenneth Sloan                   Computer and Information Sciences
sloan@cis.uab.edu               University of Alabama at Birmingham
(205) 934-2213                  115A Campbell Hall, UAB Station 
(205) 934-5473 FAX              Birmingham, AL 35294-1170
From: chuckb@stein.u.washington.edu (Charles Bass)
Newsgroups: comp.graphics
Subject: Re: Point inside a triangle
Date: 16 Nov 92 04:10:20 GMT
Article-I.D.: u.1992Nov16.041020.28568
Organization: University of Washington

The way I determine if a point is within a triangle is using the
cross-product test.  However, it is not as expesive as one
might think, especially if you have normal information (if you
don't you must take another cross product).

The ideas is to project the problem from 3D into 2D.  If you
have the normal you can choose the axis to ignore by ignoring
the component with the largest magnitude. So if your vector is:
     normal = [1,2,-3]
You would ignore the z components of the points. This reduces each
cross-product to two multiplies and a subract as opposed to 6
multiplies and two subracts.

The simplification to 2D makes life simpler.  I found when I
implemented this "stuff" that I had to be real careful with
numerical precision issues! 

Hope this helps some one.

Later-
	chuckb
Newsgroups: comp.graphics
From: siri@acd.ucar.edu (Siri Flocke)
Subject: UNIX editor for CGM files wanted
Organization: Ntl Center for Atmospheric Research - Atmospheric Chemistry Div
Date: Tue, 17 Nov 1992 18:22:39 GMT

Hi all,

I hope, this is not a FAQ (if so, please tell me, where I can find the
answer ;-)...anyway, here it goes:

I have a whole bunch of similar looking CGM (Computer Graphics Meta)
files.  To identify them I would like to add some sort of headerline or
just an identification character somewhere to the plots.  Could any
kind soul tell me whether there is a PD editor for CGM files somewhere
(on an ftp server) available?  Any other ideas on how to solve my
problem are also highly appreciated.  

Thanks very much in advance

-- Siri

---- Siri J. Flocke              siri@acd.ucar.edu           \ /  
---- NCAR/ACD                    (303)-497-1875               0  
---- P.O. Box 3000                                           _O_
---- Boulder, CO. 80307-3000     "Only the good die young" 
These are my own opinions. My employer has nothing to do with them.
Newsgroups: comp.graphics
From: ip217@brems.ii.uib.no (Torgeir Veimo)
Subject: Computer graphics and supersomputers
Organization: University of Bergen, Norway
Date: Wed, 18 Nov 92 15:37:45 GMT


Now that there's no more research let to be done in computer graphics, :*) i've been
thinking of majoring in computer graphics with parallell computers since this is a yet
to be examined area in my eyes, especially when it comes to complete illumination
models including specular reflecting and refracting surfaces. Anyone doing research in
this field?

What research is going on in this direction? Where do i find papers about this on
intenet? What school are teaching in advanced computer graphics, in europe and the us?

Does this belong in comp.graphics.research?.... :*)
-- 
Torgeir Veimo

Studying at the University of Bergen

"...I'm gona wave my freak flag high!" (Jimi Hendrix)

Xref: sparky comp.graphics:12150 comp.lang.c:16888
From: rsc@altair.csustan.edu (Steve Cunningham)
Newsgroups: comp.graphics,comp.lang.c
Subject: Re: Please Help Me Keep My Job!
Summary: It's a joke, folks...
Date: 20 Nov 92 16:34:10 GMT
Organization: CSU Stanislaus

marrou@cs.ucf.edu (Lance R. Marrou) writes:
> hollasch@kpc.com (Steve Hollasch) writes:
> 
> >    My manager has asked me to finish several projects by the end of this
> >year, and they're really hard!  I told her I could do them, but now I don't
> >know; they're pretty tricky.  I'm sure other people have done stuff like
> >this, so why should I reinvent the wheel?  Why not use the resources of the
> >net?
> (some text deleted)
> 
> Perhaps we should let you lose your job and let someone who either knows what
> they are doing or doesn't open his/her mouth as wide take over! :)

Lance, perhaps Steve shouldn't have had his tongue so far in his mouth when
he wrote this... but it sounds to me like Steve's commenting on the usual
Omigod-it's-late-in-the-semester-and-I-haven't-gotten-my-projects-done-but-
if-I-write-to-comp.graphics-I'll-bet-I-can-get-somebody-to-tell-me-how-to-do-
them-quickly (*whew!*) posts.  The Kubota Pacific people I know certainly
don't need to ask things like this on the nets 8^} ...
Newsgroups: comp.graphics
From: niko@iastate.edu (Nikolaus E Schuessler)
Subject: * viewing a .xpm file?
Organization: Iowa State University, Ames, IA
Date: Mon, 16 Nov 1992 22:48:08 GMT


I figured out how to convert a gif to a .xpm (X-pixmap file?) and wanted
to use it as an icon under tvtwm... I can't find anything that will 
view it. any suggestions?
-- 
Niko Schuessler               
Project Vincent Systems Manager              email: niko@iastate.edu
Iowa State University Computation Center     voice: (515) 294-1672
Ames IA 50010                                snail: 272 Durham
From: pinkas@skywalker.intel.com (Israel Pinkas)
Newsgroups: comp.graphics
Subject: Re: Point inside a triangle
Date: 15 Nov 92 23:50:05 GMT
Organization: Software Technologies, INTeL Corporation, Santa Clara, CA

bohn@ptolemy2.rdrc.rpi.edu (Jan Helge Bhn) writes:

   Does anyone have any suggestions on how to check if a point is located
   inside a triangle, accurately and fast.

Maybe not fast, but accurate:

The area of a polygon is:

	n-1
	---
	\
	 >  x y   - x y
	/    i i+1   i i-1
	---
	i=1

when x = x  and y  = y
      n   1      n    1

For triangles, this reduces to:

	A = x y  + x y  + x y  - x y  - x y  - x y
	     1 2    2 3    3 1    1 3    2 1    3 2


The sign of A will determine whether the triangle is clock-wise or counter
clock-wise.

In the case of a point outside the triangle, determine the sign of the
area.  Then substitute the new point for each of the vertices of the
triangle.  If the sign changes, the point is outside the triangle.

Intuitively, I feel that you should only need to perform the test twice.
If someone can prove it, I'd like to see it.

-Israel Pinkas
--
Israel Pinkas		pinkas@stps18.intel.com		408-765-4210

	"Everybody's askaird of death, until it hits you ...
	 then you don't care"		-Archie Bunker
Newsgroups: comp.graphics
From: ml-bkm@jordan.utah.edu (Barada K Mishra)
Subject: Need help with PHIGS
Followup-To: alt.graphics
Organization: University of Utah
Date: Thu, 19 Nov 92 21:11:02 GMT

I have developed a small graphics package that renders 3d objects on a
gray scale HP730 monitor. This particular application needs a "hidden
s/ce hidden line" routine which is not supported on a GRX type
monitor. I have written this in HP-PHIGS. There is very little time in
hand before I make a presentation. I would like to know if there are
routines available for this job on any of the ftp sites or I could
borrow it from someone. Lastly. I am also willing to write a routine
if some body can let me know how to do it!
Any help will be appreciated.

B. K. Mishra
Department of Metallurgy
University of Utah

Xref: sparky comp.graphics:12147 comp.lang.c:16881
From: tlilley@csugrad.cs.vt.edu (Tripp Lilley)
Newsgroups: comp.graphics,comp.lang.c
Subject: Re: Please Help Me Keep My Job!
Date: 20 Nov 92 17:12:51 GMT
Organization: St. Dismas' Infirmary

okay.  i'm assuming that was a joke.  in which case, i admit i posted my foot
in my mouth.  please smile when joking, i'm sarcasm impaired.  thank you :>

- t.

-- 
 USES disclaim;                                                      |^^\/^^| 2
 Tripp Lilley   -- tlilley@csugrad.cs.vt.edu                         | |\/| |
 The MultiMedia Lab of the Colleges of Architecture and Engineering  |_|  |_|
 Virginia Polytechnic Institute and State University         (silly ASCII logo)
Newsgroups: comp.graphics
From: chrisw@fciad2.bsd.uchicago.edu (chris williams)
Subject: Scitex CT2T format or conversion software
Organization: FCIA Univ. of Chicago
Date: Wed, 18 Nov 1992 23:47:28 GMT

We are looking for format information on CT2T or a conversion program
that would read CT2T format and output just about anything else.
From: japancs@cs.arizona.edu (Japan CS Project)
Newsgroups: comp.research.japan
Subject: Scientific Information Bulletin, Vol 16, No. 3 (1991)
Date: 17 Nov 92 19:18:36 GMT


------------------------------------------------------------------------
Scientific Information Bulletin, Vol 16, No. 3 (1991)

            published by

Office of Naval Research Asian Office  (in English)
------------------------------------------------------------------------

[Collection and dissemination of this information supported in part by
 ONR Grant N0001492J1737.]


Computer Science

TRON (The Real Time Operating System Nucleus)                   	11
     David K. Kahaner

          TRON is a large and long term project to develop a computer
          operating system along with a global man-machine interface that
          can work with many other computer operating systems.  Its main
          focus is to provide an environment for a very large number of
          small distributed computers to cooperate in real time.

Japan's Alpha Project                                           	21
     David K. Kahaner

          The Alpha Project is a coordinated effort by Japanese industry
          to develop a modern three-dimensional computer program for
          computational fluid dynamics.

Computing in High Energy Physics '91                            	27
     David K. Kahaner

          The international Computing in High Energy Physics meeting is
          summarized.

Japan's Fifth Generation Computer Project                       	31
     David K. Kahaner

          Japan's Fifth Generation Computer Project is summarized.

The Cyclic Pipelined Computer and ERATO                          	37
     David K. Kahaner and Paul Spee

          A brief description of ERATO and one of its projects on quantum
          magneto flux logic, with particular emphasis on the cyclic
          pipelined computer, is given.

Parallel Processing Research in Japan                            	43
     Rishiyur Nikhil and David K. Kahaner

          Parallel processing research (mostly associated with the dataflow
          model) and database research in Japan, based on visits to various
          laboratories and attendance at the IEEE Data Engineering
          Conference in Kobe, are summarized.

Joirlt Symposium on Parallel Processing '91                     	49
     David K. Kahaner

          An overview is given of the Joint Symposium on Parallel
          Processing '91.

Computing and Related Scientific Activities in Singapore        	53
     David K. Kahaner

          Science and technology in Singapore, especially related to
          computing, is reviewed.

Japanese Advances in Fuzzy Theory and Applications              	65
     George J. Klir

          This article describes fuzzy theory, provides an historical
          overview, and then discusses the current research in the area
          in Japan.

Omron's Fuzzy Technology Business Promotion Center              	75
     Thomas Hagemann

          This article provides an overview of Omron Corporation and
          its fuzzy-related activities.


Newsgroups: comp.dsp
From: knudsens@newton.ccs.tuns.ca (Steven K Knudsen)
Subject: Re: WANTED: Research Assistants; Burchill Comm. Research Group
Date: Mon, 23 Nov 1992 20:29:26 GMT
Distribution: na
Organization: Technical University of Nova Scotia, Halifax, N.S.
Keywords: grad students wanted, dsp research, financial support

please ignore the previous .signature ...

Steven Knudsen

-- 
K. Steven Knudsen                     | The lasers are in the labs, the old
TUNS                                  | man is dressed in white clothes.
Department of Electrical Engineering  | Everybody says that he's mad - 
knudsens@tuns.ca                      | Nobody knows the things that he knows.
From: spaday@daisy.ee.und.ac.za (Strini Padayachee)
Newsgroups: comp.dsp
Subject: DSP and Control
Date: 18 Nov 92 19:30:43 GMT
Article-I.D.: daisy.1ednj3INNnup
Organization: Univ. Natal, Durban, S. Africa
NNTP-Posting-Host: daisy.ee.und.ac.za

Hi

I'm an EE grad with a control system background and the work I'm going to be doing is DSP. I'd like to know what the differences and similarities are between 
these two fields. What distinguishes a Control engineer from a SP engineer??
Thanx

Strini
Newsgroups: comp.dsp