HDTenEightyP/NetNews huggingface dataset:
From: tonya@casbah.acns.nwu.edu (Tonya Hill)
Subject:  HELP -- IMAGINING SOFTWARE/HARDWARE FOR HP-UX --
Organization: Northwestern University, Evanston Illinois.
Date: Sun, 15 Nov 1992 18:21:27 GMT

 Hi    Tonya:

        will you please post the following for me on news:




        SUBJECT:  HELP -- IMAGINING SOFTWARE/HARDWARE FOR HP-UX --

       "Can some tell me about one or more packages for imaging for

        the HP - UX Platform as well as UNIX systemV.   And if there

        is special hardward needed to install these packages. I am

        looking for real high performance imaging. Keep in mind that

        the primary purpose for me is to scan documents that
        include images and text and would like to recognize text as

        text and an image as such. A big data base like oracle or

        sybase will be used to hold the data. Any information about

        this subject will be greatly appreciated.  If you can
        not help me, maybe you can direct me to the right sources.


        send  replys to:            khalid@comserc.howard.edu
                        PHONE:   (202)  806-4750


Newsgroups: comp.graphics
From: ampac@netcom.com (Marc Kulla)
Subject: CGM Public Domain
Organization: AmPac International
Date: Sat, 21 Nov 1992 00:12:20 GMT


2 questions:

1.  Are there _any_ public domain CGM readers around?  I know that it would
    not be a beautiful or robust app, but something to get started with.

2.  I know you can get the specs from American National Standards Inst,
    but do any services on the internet provide access to it?

Thanks,

Marc
e-mail: ampac@netcom.com

Newsgroups: comp.graphics
From: robert@slipknot.rain.com (Robert Reed)
Subject: Re: Point inside a triangle
Reply-To: robert@slipknot.rain.com.UUCP (Robert Reed)
Organization: Home Animation Ltd.
Date: Mon, 16 Nov 1992 04:53:24 GMT

In article <7bv1svg@rpi.edu> bohn@rdrc.rpi.edu writes:
|
|Does anyone have any suggestions on how to check if a point is located
|inside a triangle, accurately and fast.

The standard edge crossing test, which works for any other polygon, should work
fine here.  See page 34, Foley and van Dam Computer Graphics.  In brief you
count the number of polygon edges that cross a ray drawn from the point to
infinity.  An odd number of crossings means the point is interior.
________________________________________________________________________________
Robert Reed			Home Animation Ltd.		503-656-8414
robert@slipknot.rain.com	5686 First Court, West Linn, OR 97068

It is practically impossible to teach good programming to students who've
had a prior exposure to BASIC; as potential programmers they are mentally
mutilated beyond hope of regeneration.
--Edsgar Dijkstra
________________________________________________________________________________
Newsgroups: comp.graphics
From: berling@infko.uni-koblenz.de
Subject: acis-modeler
Keywords: acis, geometric modeling
Organization: University of Koblenz, Germany
Date: Mon, 23 Nov 1992 14:36:49 GMT

Hi,

I would like to get some information about
the ACIS geometric modeling kernel
by Three-Space Ltd./Spatial Technology Inc.

Any hints on technical reports published are welcome.
I am especially interested in papers dealing with
the boundary model, the management of non-manifold topology,
and concepts for parametric/variational design applications.

Thank you!

Roland Berling


+----------------------------+-----------------------------------------+
|                            |                                         |
|  Roland Berling            |  Tel.:   +49 261 9119 436               |
|  Universit"at Koblenz      |  Fax.:   +49 261 9119 499               |
|  Institut f"ur Informatik  |  e-mail: berling@infko.uni-koblenz.de   |
|  Rheinau 3-4               |                                         |
|  D-5400 Koblenz            |                                         |
|  Germany                   |                                         |
|                            |                                         |
+----------------------------+-----------------------------------------+




Newsgroups: comp.graphics,comp.graphics.animation
From: ddebry@itchy.dsd.es.com (Dave DeBry)
Subject: CORAL (Corral?  Chorale?) -- Anyone heard of it?
Description: Tall, skinny, kinda goofy looking
Reply-To: Dave DeBry <ddebry@dsd.es.com> 
Organization: Evans & Sutherland Computer Corp., Design Systems Division 
Date: 18 Nov 92 01:07:49 GMT
Irc: Z-Grue (Zorkian Grue) 

	I have an opporunity to use a package called "CORAL" (I
think).  All I know about it is that it is used for computer aided
drawing (design, maybe), and/or animation.  (Sorry to be so vague, but
the person explaining it to me is pretty computer illiterate. :)

	Could someone please tell me about this package?  What systems
does it run on?  What does it do?  What *IS* it?

	Thanks in advance!


--
Dave  ddebry@ debry@   \ "Damn right, I got in a fight.  Someone left
DeBry dsd.    peruvian. | the seat up.  I hate that."
      es.     cs.utah.  |
      com     edu      /                              - David Addison
Newsgroups: comp.graphics
From: lambert@spectrum.cs.unsw.oz.au (Tim Lambert)
Subject: Re: polyhedron/polyhedron intersection
Organization: CS&E, Uni of NSW, Australia
        <1992Nov12.161117.24398@cs.wisc.edu>
        <1992Nov13.023548.19446@sophia.smith.edu>
Date: Fri, 20 Nov 1992 15:19:04 GMT

>>>>> On Fri, 13 Nov 1992 02:35:48 GMT, orourke@sophia.smith.edu (Joseph O'Rourke) said:

>>|> In article <1992Nov12.011952.1154@cis.uab.edu>, sloan@cis.uab.edu (Kenneth Sloan) writes:

>>|> |> GIVEN an arbitrary, simple polyhedron, P.

>>|> |> FIND the largest (greatest volume) convex polyhedron completely
>>|> |> contained in P.

> Call a
> largest inscribed convex polyhedron Q.  Is there a P with a unique Q
> such that a face of Q intersects the surface of P in an edge of P only?
> In other words, might a face of Q pivot on a reflex (=concave) edge
> of P, being neither flush with a face of P nor touching at three
> points forming a triangle?  My guess is yes.

I think your guess is correct.

Let P be:
        D(-1,2)   B(1,2)
            /\      /\
           /  \    /  \
          /    \  /    \
  H(-2,1)/......\/......\G(2,1)
        /.    C(0,1)   . \
       /  .    .  .   .   \
      /    .  .    . .     \
     /______________________\
 E(-3,0)     F(-1,0)      A(3,0)

Each of the 7 triangles I have divided P into has an area of 1.
ABF has an area of 4, but the largest inscribed polygon is AGHE with
an area of 5.

Now put liitle concavities between A and G and between E and H.  The
top edge of the largest inscribed polygon touches P at a single point.
Rotate everything about the y axis.  The top face of the largest
inscribed polyhedron touches P at a single point.

Tim
Newsgroups: comp.graphics
From: jack@shograf.com (Jack Ritter)
Subject: sign of cross product
Organization: SHOgraphics
Date: Tue, 17 Nov 1992 17:11:35 GMT

In article <1992Nov16.041020.28568@u.washington.edu>, chuckb@stein.u.washington.edu (Ch
arles Bass) writes:
> 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

> You would ignore the z components of the points. This reduces each
> stuff deleted....
> cross-product to two multiplies and a subract as opposed to 6
                   ^^^^^^^^^^^^^^
>
Half the time, you dont have to do the 2 multiplies.
See Graphics Gems 2, page 392.

-----
          Jack Ritter. SHO Graphics.
          1890 N Shoreline Blvd.
          Mountain View, CA 94043
          email: jack@shograf.com
          Tele:  (415) 903-3867

  (If only I had been compiled with the '-g' option.)
From: ywang1@husc8.harvard.edu (Yongkang Wang)
Newsgroups: comp.graphics
Subject: Infor Wanted: Software for Letterhead
Date: 17 Nov 92 23:08:16 GMT
Article-I.D.: husc3.1992Nov17.180817.17546
Distribution: usa
Organization: Harvard University Science Center

Hi,

Anyone know if there is any software to help design letterhead. please
Email me if you can help.

Regards
Newsgroups: comp.graphics,comp.lang.c
From: "vivek gupta" <vigupta@loanshark.cs.indiana.edu>
Subject: Re: Please Help Me Keep My Job!
Organization: Indiana University, Bloomington
Date: Fri, 20 Nov 1992 13:05:07 -0500

In article <By0JL9.Boy@sunlab1.bath.ac.uk> ccspad@sunlab1.bath.ac.uk (Paul Dale) writes:
>Could the originator of the thread send me some personnel
>forms from his company, I'd like to work there. I'm not too
>hot on programming but I'd like to try out my script writing :-),
>it was Satire and Vitriol Inc. wasn't it ?
>
>Paul
>Systems admin./applications support/programmer.
>BUCS, Bath University, Claverton Down, Bath, Avon. UK BA2 7AY
>tel: 0225 826215
>e-mail: P.A.Dale@bath.ac.uk
>fax: 0225 826176


ME TOO! ME TOO!

As soon as i graduate that is.

Vivek Gupta
Newsgroups: comp.graphics
From: acmcde@gsusgi2.gsu.edu (Claude D. Edwards)
Subject: FLI file viewer
Summary: I need help with a FLI file viewer
Keywords: animation
Organization: Georgia State University
Date: Fri, 20 Nov 1992 01:09:56 GMT

I am trying to write a custom FLI file viewer for windows, with 
minimalist controls.  I can handle the user interface, but I need 
a function library that will actually display the flick in the window
provided, and respond to a few basic control commands.

I am acmcde@gsusgi2.gsu.edu  (please help me)

 
-- 
    _=                 | Will the last thought out of my brain
     \\                | Please set the video to record and
    //\\hoenix         | Turn off the lights
   // // //            |
  //\// // //|         | Claude D. Edwards  a.k.a. phoenix j. arizona
 //    // //||         | acmcde@gsusgi2.gsu.edu
    \\// //=||         |
        //  ||rizona   |
Newsgroups: comp.graphics
From: deuelpm@craft.camp.clarkson.edu (Hobbit)
Subject: Three dogs playing poker
Organization: Clarkson University
Date: Mon, 16 Nov 1992 14:35:50 GMT


Does anyone know of a good source of pictures?  (Yes)  I need to find a
good source for digitized art work. . .  Why?

Because I really want to get a hold of a computer scan of that picture
of those dogs sitting around a poker table (I don't remember the title
of the art work, but "Three Dogs Playing Poker"  would be apt.  It's
one of those paintings that *men* really like (?) and *women* really
think is stupid and man-like...)

If you know of a likely source of this pic, please E-mail me the ftp
site.  It need not be a .GIF, but .GIF, .JPG, Sun Raster... any "good"
format will do. (24-bit?)

Thanks much,

Pete

--
=====================================
deuelpm@craft.camp.clarkson.edu
=====================================
"*Regret* is a rough sheet to sleep on."  -Herman Brooks
From: cho@ucbeh.san.uc.edu
Newsgroups: comp.graphics
Subject: Mac to IBM Graphics Question
Date: 23 Nov 92 18:04:34 EST
Distribution: world
Organization: Univ. of Cincinnati

Greetings to all,

I have a question that I am hoping someone will know the answer to...I have
some great looking graphics on my Mac, and want to put them on the IBM, because
the software I'm using only understands IBM's PBX files.  Does anyone know of
a Macintosh software that will save graphics into something an IBM can
understand?  BTW, I don't need/want color, because this is for one of those
pen computers which uses no color, so it doesn't even have to be particularly
fancy.  Easy is preferred.  

Someone told me that Clickart on the Mac can be converted into pbx files....I 
don't know if that's true or not.  I have looked around at the MacDraw and 
other programs, but none of them say anything about PBX.  The only place I 
have seen that is on Power Paint on the IBM (which is anything but powerful!)  
The only stipulation is that it has to be a PBX file.

I certainly appreciate any information anyone can send my way regarding the
conversion of graphics from Mac to IBM's PBX file format.  If there isn't a
way, does anyone know of some good business clip-art for the PC?  Thanks again.
-Pamela Cho-
From: watson@maths.uwa.oz.au (David Watson)
Newsgroups: comp.graphics
Subject: Re: Point inside a triangle
Date: 19 Nov 92 00:04:56 GMT
Organization: The University of Western Australia
NNTP-Posting-Host: madvax.maths.uwa.oz.au

orourke@sophia.smith.edu (Joseph O'Rourke) writes:

>In article <1e9k0cINNc0q@uniwa.uwa.edu.au> watson@maths.uwa.oz.au (David Watson) writes:

>>and if b0 == 0 => (x1 == x2 && x1 == x3 && y1 == y2 && y1 == y3)

>I think you meant to say if b0 == 0, then the three triangle vertices
>are collinear: the above implication is too strong.

Yes, of course, when the three points are colinear the area is zero
also.
--
Dave Watson                          Internet: watson@maths.uwa.edu.au
Department of Mathematics            
The University of Western Australia               Tel: (61 9) 380 3359
Nedlands, WA 6009  Australia.                     FAX: (61 9) 380 1028
Newsgroups: comp.graphics,comp.graphics.animation,comp.graphics.avs,alt.graphics,comp.graphics.visualization,comp.org.usrgroup
From: arp@cooper!osd (Andrew Pinkowitz)
Subject: NYC ACM/SIGGRAPH 1992 Meetings
Keywords: graphics animation nyc acm siggraph
Organization: Online Systems Development ( NY, NY)
Date: Wed, 18 Nov 92 15:42:50 GMT

======================================================================
                    NYC ACM/SIGGRAPH: CALENDAR
======================================================================

                            ========
                            NOVEMBER
                            ========

  SUBJECT:  Storytelling in Animation
            =========================

        Sonya Shannon (a.k.a. Haferkorn) School of Visual Arts
        Chris Wedge, Blue Sky Productions

            The secret ingredients of the most memorable computer
        animations are not hardware or software, but reside in the
        age-old art of storytelling.  This presentation will provide
        tips on improving your narrative skills in high-tech media.

     DATE:  Monday, 23 November 1992

     TIME:  6:00 pm (EST)

    PLACE:  The Amphitheater
            School of Visual Arts
            209 East 23rd Street
            NY, NY

ADMISSION:  Members FREE
            Students $3.00
            Non-Members $7.00 (Includes coffee & cake)


======================================================================

                            ========
                            DECEMBER
                            ========

  SUBJECT:  International Computer Animation Festival
            =========================================
                        & HOLIDAY PARTY
                        ===============

        Hosted by:
            Dean Winkler, Post Perfect
            Gray Lorig, SIGGRAPH '92 Electronic Theater Chair
               && The French Embassy

            Selections screened will include materials from IMAGINA
        (France), VIDEOTECH de Milano (Italy), ARS ELECTRONICA
        (Germany), MIMAD (Spain), and IMAGE DU FUTURE (Canada).  The
        party will be hosted by the French Embassy.

     DATE:  Thursday, 10 December 1992

     TIME:  6:00 pm (EST)

    PLACE:  The Haft Auditorium
            Fashion Institute of Technology (F.I.T.)
            227 West 27th Street, "C" Building
            NY, NY

ADMISSION:  Members FREE
            Students $3.00
            Non-Members $7.00 (Includes Refreshments)

Newsgroups: comp.graphics
From: rached@sample.eng.ohio-state.edu (Rached Zantout)
Subject: Surface Representation Using Patches. 
Organization: The Ohio State University Dept of Electrical Engineering
Date: Mon, 16 Nov 1992 14:39:09 GMT


Hi Fellow Netters

I am trying to survey techniques on how to represent a surface using patches. 
What I will be looking for is methods that people have developed that will
produce a patch representation of a digitized surface. Also I would be looking
at the goals behind those methods and the things they could not acheive. My
final goal is to determine whether there exists room for a "better" way or
whether the literature has already the "best" way to do that.
The problem I think arises when a surface is to be represented by more than one
patch. We will have to determine which points contribute to which patch and
what is the size of each patch. Whether we should allow different sized patches
is also a question to be solved.

If anybody has information or pointers to where can I start my literature
review, or better yet if I can find a survey paper that already did the survey
work, I will be very grateful.

rached


Keywords: 

Newsgroups: comp.graphics
From: oper7@ee21.ee.ncu.edu.tw (Lee. shih-hao)
Subject: WANTED: fast 3d polygon clipping algorithm
Organization: Dep. of EECS, National Central University, Chungli, Taiwan, R.O.C.
Date: Thu, 19 Nov 1992 04:05:09 GMT

Newsgroups: comp.graphics
Subject: WANTED: fast clipping algo. for 3d polygon.
Summary: 
Followup-To: 
Distribution: world
Organization: Dep. of EECS, National Central University, Chungli, Taiwan, R.O.C.
Keywords: 

Hi, all experters:
I have seen a famous real-time render system called REND386,
now I need some infos about fast 3d polygon clipping. i.e.,
since a polygon in 3d scene will partly out of viewport, it
is a good mechanism to clip a polygon into only visible part.
any suggest could reply directly to me .. thanks for your attention.
tony
-- 
>>> Anthony Li <Li3, Shih4 Hao2><Li:fruit's Name><Shih:Scholar><Hao:Hero>   <<<
<<< Institute of CSEE, National Central Univ, Chungli, Taoyuan, Taiwan, ROC >>>
>>> Internet:	oper7@mbox.ee.ncu.edu.tw	 oper2@ncuee.ncu.edu.tw	    >>>
Xref: sparky comp.graphics:12266 comp.graphics.visualization:1809 comp.graphics.explorer:341 comp.sys.sgi:16805 comp.graphics.animation:1098 comp.windows.x.intrinsics:563
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: Point inside a triangle
Organization: Smith College, Northampton, MA, US
Date: Mon, 16 Nov 1992 01:39:15 GMT

In article <PINKAS.92Nov15155005@skywalker.intel.com> pinkas@skywalker.intel.com (Israel Pinkas) writes:
>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.
>
>[...]
>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.

When you substitute the point outside (call it x) for one of the
three triangle vertices (call them a,b,c), you are computing the signed
area of the triangles (x,a,b), (x,b,c), and (x,c,a).  Each of
these areas is the crossproduct of (a-x) and (b-x), etc.  So this
method is equivalent to what Jan intimated he was already using
(although he didn't detail his method).
	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.
Xref: sparky comp.graphics:12049 comp.graphics.animation:1061
From: jack@admin.mport.COM (Jack Craig)
Newsgroups: comp.graphics,comp.graphics.animation
Subject: Re: CORAL (Corral? Chorale?) -- Anyone heard of it?
Date: 18 Nov 92 20:10:35 GMT
Followup-To: comp.graphics
Organization: Microport Inc., Scotts Valley, CA 95066 US of A

corel draw is a dos based package. i dont know much about it,
but you can call 408-425-8280, ask for harry stanley, they sell it.

jack...
=============================================================================
 Jack Craig  Microport         SVR4 408-438-UNIX   uunet!mport.com!jack
             Software Horizons SVR3 408-684-1375   uunet!sco.com!blznrzn!jack
=============================================================================
Xref: sparky comp.graphics:12026 comp.graphics.visualization:1781
From: borchert@walt.CS.MsState.Edu (Chris Borchert)
Newsgroups: comp.graphics,comp.graphics.visualization
Subject: What's a package with well done tick (scale) marks?
Date: 18 Nov 92 15:47:27 GMT
Article-I.D.: ra.1992Nov18.154727.4235
Organization: Mississippi State Univ.

Hey, I have asked this before, but I will ask again.  I know that there has 
to be a graphics program out there that has slick tick marks.  By this
I mean that when you zoom in or out the scaling doesn't get all messed up --
the tick marks appear on top of each other or miles apart.

I have looked at xfig, but it doesn't work well.  Any other I can try?
What other big graphics packages using scaling?

Thanks,
Chris Borchert
borchert@CS.MsState.Edu


--
Chris Borchert
borchert@CS.MsState.Edu
From: erich@eye.com (Eric Haines)
Newsgroups: comp.graphics
Subject: Re: Point inside a triangle
Date: Wed, 18 Nov 92 14:54:36 GMT
Organization: 3D/EYE, Inc.  Ithaca, NY

In article <1992Nov17.132302.6345@sophia.smith.edu> orourke@sophia.smith.edu (Joseph O'Rourke) writes:
>In article <Bxtz3s.6xA@slipknot.rain.com> robert@slipknot.rain.com.UUCP (Robert Reed) writes:
>
>>The special cases are trivial to discard, if the ray intersects a vertex, the
>>adjacent vertices must have Y values of opposite sign (assuming a horizontal
>>ray) to represent a crossing.  If the point is collinear with an edge, discard
>>it [the edge, I presume].
>
>It seems from your description that points on the boundary of the triangle
>T are not handled consistently by the ray algorithm.  Below, a is not in T
>but b is in T.
>
>			       /\
>			      b  \
>			     /    \
>			    +--a---+       
>
>At least this seems to be what the code that Michael Goza posted does.
>Am I right?

Absolutely right - points on the edges are (somewhat) arbitrarily determined
to be in or out by the ray crossings test.  The good news is that there is
consistency:  if a point lies on an edge shared by two polygons, the point
will be found to be inside one and only one polygon when you use the ray
crossings test.  This is an excellent property for rendering and picking, as
you generally want to consider any point on a surface as being inside one and
only one polygon.

By the way, to absolutely maintain this consistency property you have to make
sure to project all polygons in the same fashion (i.e. you can't just use the
"cast onto the best plane for this polygon's normal" idea mentioned).  Usually
this consistency does not matter for well-behaved polygons;  only when
(ill-defined) non-planar polygons are being rendered is it important to be
consistent in the way the 3D polygons are projected to 2D.


Incidentally, all you point-in-triangle posters might want to check out the
FTP site princeton.edu [128.112.128.1], file /pub/Graphics/RTNews/RTNv5n3.Z,
the latest issue of the Ray Tracing News, which is dedicated to the point in
polygon question (though there's still more to be written - next issue...).
There is efficient code for the crossings test (it's a bit faster than the
code Mike Goza posted), the barycentric test, and more.

Eric Haines
From: smd@media.mit.edu (Steven Drucker)
Newsgroups: comp.graphics
Subject: Needed: MAC Pict2 to anything converter (I've checked FAQ)
Date: 23 Nov 92 22:02:10 GMT
Organization: Media Lab

I need something that will convert a Pict2 image file to anything else
(ppm, fbm, tiff, rle, etc). I believe the file just contains a pixmap without
any other opcodes but the one converter I did find (pictoppm.c) errors
out with an unknown opcode (0x8200).  Does anybody know of a way to do this
on a unix machine (SGI, sun, HP, dec, NeXT, etc)?
Thanks!
--Steve Drucker
Newsgroups: comp.graphics
From: birdi@enuxhb.eas.asu.edu (Arvinder Birdi)
Subject: Graphics/CAGD job situation question
Organization: Arizona State University, Tempe
Date: Fri, 20 Nov 1992 23:25:58 GMT


Hi, this question is slightly out of line with c.g.* newsgroups.
Basically I want to find out what kind of jobs are available (MS) for
people who specialize in computer graphics and computer aided geometric design.

... thinking of taking the dive,
Arvinder

--
===============================================================================
Arvinder S. Birdi				birdi@enuxha.eas.asu.edu 
	"birdi@enuxhb.eas.asu.edu"		asasb@acvax.inre.asu.edu
Newsgroups: comp.graphics