HDTenEightyP/NetNews huggingface dataset:
From: akin@sgi.com (Allen Akin)
Newsgroups: comp.graphics.opengl
Subject: Re: GLX? PEX vs. OpenGL
Date: 7 Oct 1992 16:50:08 GMT
Organization: Silicon Graphics, Inc.
NNTP-Posting-Host: tuolumne.asd.sgi.com

In article <1992Oct7.144607.22879@cs.uah.edu> ldawes@news.cs.uah.edu (Lisa Dawes) writes:
| 
| What is GLX? Is this a GL X Window protocol similiar to PEX?

The term "GLX" is used a bit loosely, for two different things:

    1.	The wire protocol that OpenGL uses to communicate between
	client and server in the X11 environment.

	GLX used in this sense is analogous to PEX.  Both are
	extension protocols for X11, implemented with the usual
	X extension mechanisms.

    2.	The API functions used to integrate OpenGL with X11.

	These include initializing the GLX extension in the X server,
	querying the X Visual types available to the GLX extension,
	selecting an X Visual, creating GLX-compatible pixmaps,
	managing OpenGL rendering contexts, synchronizing OpenGL and
	X drawing operations, double-buffering, and providing access
	to X fonts.

| Will this allow users of OpenGL to control remote X terminals
| which support GLX?  ...

Yes, that's the intent.  Applications based on OpenGL will run in a
network-transparent fashion in the X environment.

Currently Windows/NT does not have the notion of a general-purpose
network-transparent graphics protocol.  OpenGL applications written for
Windows/NT won't run remotely until Microsoft makes that capability
available to Windows applications in general.

|                 ... I am aware of a vender who has developed a
| high performance PEX terminal, is there such a thing for OpenGL?

OpenGL terminals are under development at several companies, though I'm
not sure which have officially announced products.  Perhaps
representatives from those companies will comment.

Allen
From: jordan@IMSI.COM (Jordan Hayes)
Newsgroups: comp.graphics.opengl
Subject: Re: OpenGl vs PEX
Date: 9 Oct 92 20:38:24 GMT
Organization: Investment Management Services Inc., NYC

Kipp Hickman <kipp@warp.asd.sgi.com> writes:

	OpenGL has been agressively offered to *any* company willing to
	play buy its rules.
	     ~~~
:-)

By the way, what if I don't want someone else's binary-only server?
What if I want to drop OpenGL into my own X11R5 server?  (Hint: SGI is
not shipping X11R5 yet, when was R5 released?)  Why won't there be a
freely available (albeit slow?) source product?  Otherwise, you have to
buy in to the concept before you can get any experience with it.

That way I could justify it to my boss.  Here's the way it would go:
I'd grab X11R6, drop in the contributed OpenGl, build a whizzy
real-time stock-market data model, build some widgie to fly through it,
and then complain how slow it was.  Then we'd buy some SGI hardware,
and add more features to it.  Then we'd complain how slow it was.  Then
we'd get a 4 processor SkyWriter with Reality Engine.

But you won't let me get my foot in the door!

/jordan
Newsgroups: comp.graphics.opengl
From: whitney@pioneer.arc.nasa.gov (David Whitney GDP)
Subject: Re: (FAQ?) Where to get opengl spec/conformance test
Organization: NASA Ames Research Center, Moffett Field, CA
Date: Fri, 16 Oct 1992 22:50:43 GMT

In article <1992Oct16.220917.5648@odin.corp.sgi.com>, bglazier@buffalo.asd.sgi.com (Bill Glazier) writes:
|>  We charge an incremental $75K for the SI, which is over
|> 100K lines of code.  That's 75 cents per line of code - a pretty good deal.  
				^^^^^^^^^^^^^^^^^^^^^^^^
Is this what we've been reduced to???

"It's OK because it's only pennies per day!"

Please leave that kind of advertising to the phone company.

|> 2) SGI is spending a lot of money to help people implement OpenGL
|> and to administer a conformance process, and wants to recoup some portion
|> of this investment.

Thanks for saying just about the only truly honest statement I've seen on this newsgroup so far.

-Dave

__________________________________________________________________________
David Whitney              | Cooper:  Wanna know why I'm whittling?
whitney@ames.arc.nasa.gov  | Truman:  OK, I'll bite.  Why are you whittling?
                           | Cooper:  Because that's what you do in a
Sterling Software          |          town where a yellow light still means
NASA Ames, Mtn View, CA    |          slow down,  not speed up.
From: jb@sgihbtn.sierra.com
Newsgroups: comp.graphics.opengl
Subject: Re: Info wanted about Open_GL on DEC.
Date: 8 Oct 92 23:28:06 GMT
Distribution: comp
Organization: Sierra Geophysics, Inc.

In article <HARI.92Oct7095951@robios5.me.wisc.edu>, hari@robios.me.wisc.edu (Kambainathan Hari) writes:
|> 
|> Hi,
|> 
|> I have done programming on an IRIS using GL. Now I have to do a
|> graphics oriented project on a DEC 5000. Some of the questions I'd
|> like to know are:
|> 
|> 
|> * Is Open_GL available on the DEC ?

Not that I know of, but ...(see below)

|> 
|> * If so, what are the minimal Hardware capabilities required to run
|>   Open_GL on a DEC 5000. 

Unlikely. You (like I, on my 2-head accelerated DECSTATION 5000)
 are on the WRONG BOX. This turkey's headed for the junkyard.

|> 
|> * Whom should I contact and how much is it likely to cost ?

DEC claims that THEY will support GL native. How much you wanna
bet its only on the ALPHA...

|> 
|> Thanks in advanance ....
|> 
|> - Hari
|> 
|> K.R.Harinarayan
|> Robotics Lab., Dept. of Mech. Engg.
|> Univ. of Wisconsin, Madison
|> 
|> Fone  : (608) 262-7463, (608) 262 - 9056
|> e-mail: hari@robios.me.wisc.edu
|> 

Just my opinions...
-- 
 JB West,  Manager of Graphics Dev't          |          Halliburton
 Sierra Geophysics, Inc.                      |     ######    ######  ######
 A Halliburton Energy Services Group Company  |    ###        ####   #   ##
            jb@sierra.com                     |   #######   ####### #######
From: akin@sgi.com (Allen Akin)
Newsgroups: comp.graphics.opengl
Subject: Re: OpenGl vs PEX
Date: 13 Oct 1992 21:40:15 GMT
Organization: Silicon Graphics, Inc.
NNTP-Posting-Host: tuolumne.asd.sgi.com

In article <Bw2qv1.3uF@apollo.hp.com> mcsavaney_d@apollo.hp.com (#David McSavaney) writes:
| ... my information shows the OpenGL pricing as follows:
|  .A Level I license costs $25,000...
|  .A Level II license costs $100,000...
|  .A Level III license costs $300,000...

I believe your pricing information is essentially correct.  Kipp was
referring to the deltas between licensing levels, not the cumulative
price at each level.  E.g., a Level II license costs $75K above and
beyond Level I.  Sorry about the confusion.

| ...I am missing information about warranty length and support/maintanence
| costs...

So am I.  I'll ask Bill Glazier to comment.

| ...Also I am confused about opening multiple remote displays - does that
| count as a single application and therefore falls under the $5 fee? Or
| does each display that is opened need to return $5 to SGI?...
| 
| I think I understand that you think that software authors will find
| it less expensive to puchase OpenGL under the developer program
| and port to the platforms they need rather than aquire and port PEX?
| Is this so? If it is then, from personal experience, I think software
| authors are much more inclined to use a development environment
| that is supplied and fully supported by the platform hardware vendor,
| rather than take a "mix and match" approach.

There is definitely some confusion here.  We don't believe software
(meaning "applications program") authors will port either OpenGL or
PEX/PHIGS/PEXlib to their target platforms.  Vendors of workstations
and network terminals will be supplying the 3D graphics system(s) of
their choice, and software authors will normally make use of what the
platform vendors provide.  The royalty applies to the vendors of
platforms on which OpenGL servers run, not to the applications
developers.  I'm having difficulty understanding the drift of your
questions; did you have a different model in mind?

| >When OpenGL is widely available in NT is as yet an unknown date.  1994 is
| >probably the latest it would be available in NT, not the earliest.
| If anyone can determine the delivery date I would be very grateful.

Microsoft sets the groundrules for NT, so they'll be responsible for
determining the schedule for OpenGL on NT.  Currently OpenGL is
targeting NT 2, and that can be changed only if Microsoft wishes to do
so.  Please direct all lobbying efforts to Redmond. :-)

Allen
Newsgroups: comp.graphics
From: jpl@grafikus.fct.unl.pt (Joao Prospero Luis [ps])
Subject: Re: IMAGEIN, hi_color and 24-bit test.
Organization: Universidade Nova de Lisboa, PORTUGAL
X-Newsreader: TIN [version 1.1 PL6]
Date: Wed, 14 Oct 1992 19:16:44 GMT

djlewis@ualr.edu wrote:
: IMAGEIN demonstration disk version 3.0 was uploaded to wuarchive.wustl.edu
: into the pub/MSDOS_UPLOADS directory as the file IMAGEIN.ZIP. if there are two
: imagein.zip files, take the larger (aprox: 1.36 meg), I may have made an 
: accidental partial copy. Pkunzip it into a sub-directory and read the 
: README.1st for directions. This is a WINDOWS program only.
: 	Any troubles with it, let me know. And enjoy. I found the only to
: save your work in this program is a screen capture or 'prtscr' to clipboard.
: 
: IT is GREAT for testing that new hi-colour or 24-bit colour card.
: Don Lewis
: djlewis@ualr.edu

	There is a self-extracting called imademo.exe that I think is that.
	There is also imademo.txt.

		JPL

--
Joao Prospero Luis                 |
Universidade Nova de Lisboa        | Internet: jpl@fct.unl.pt
Faculdade de Ciencias e Tecnologia |
Departamento de Informatica        | Fax:   (+351) (1) 295-5641
2825 Monte Caparica, PORTUGAL      | Phone: (+351) (1) 295-4464
Newsgroups: comp.graphics
From: vpham@cs.ulowell.edu (Vinh Pham)
Subject: x3d
Organization: University of Massachusetts at Lowell Computer Science
Date: Mon, 12 Oct 1992 17:32:43 GMT

i am very impressed by x3d; just wondering if anyone written a similar
program for DOS?
huy
Newsgroups: comp.graphics
From: fenner@engcon.marshall.ltv.com (JWFENNER)
Newsgroups: comp.graphics,comp.graphics.animation,comp.realtime,comp.sys.ibm.pc,comp.sys.ibm.pc.hardware,comp.sys.ibm.pc.misc
Subject: Hardware for 2D Graphics Animation on IBM PC
Date: 12 Oct 92 22:07:53 GMT
Reply-To: fenner@engcon.UUCP (JWFENNER)
Organization: LTV MEG, Dallas, TX

I'm looking for graphics acceleration hardware for the IBM PC. 
Specifically, I would like more information on graphics coprocessors, DSPs, 
and the like.  Any help would be greatly appreciated.  Thanks...

Please e-mail responses.  I'll compile a summary and post it if I get
enough.  Thanks again..

==================================================================
= Jon Fenner (engcon!fenner@uunet.uu.net)                        =
= LORAL Vought Systems - Neural Network / AI Research Group      =
==================================================================
From: lks@beach.cis.ufl.edu (Larry Swift)
Newsgroups: comp.graphics
Subject: Re: MAC vs. IBM
Date: 14 Oct 92 13:49:14 GMT
Organization: Univ. of Florida CIS Dept.

I thought I should add my $0.02 to this.  My Fiance is a Graphic Design Artist
who is VERY attached to the Mac environment (Adobe Illustrator and Quark
Express are her tools of the trade).  I own a PC (running DOS, Windows, and 
OS/2) and an old Mac.  I also spend quite a bit of time on various Unix/X 
boxes.  My thought was that since she was confortable with the windowing 
environment it would be easy to show her how to use various comparable 
programs that ran either on OS/2, Windows, or X. WRONG!

In article <1992Sep30.184539.6772@arbi.Informatik.Uni-Oldenburg.DE> Peter.Gorny@arbi.informatik.uni-oldenburg.de (Peter Gorny) writes:
>iancu@iil.intel.com (Igal Iancu) writes:
>
>The pitfalls of DOS machines are the system: she will need at least twice
>as much time for training and systems maintenance - 
>Introduction to DOS:  1 week     Introduction to MacOS:  1 day         5 : 1
>Introduction to an application on DOS vs. on MacOS to my experience:   2 : 1
>System maintenance (new program releases, backups etc.):             1,5 : 1  
>
Sounds a little generous to me. Let's face it, dragging an icon to the 
trash can will always be easier to remember than the syntax  of a DEL or
ERASE command (we won't even get into rm...) And OS/2 won't help since an
icon dragged to the shredder isn't necessarily a file...and it doesn't 
necessarily delete anything but that icon.

Now I have seen Quark Express for Windows, and I can see where it might 
easy enough for someone who is familiar with the Mac package to use it.
The problem here is that while the package is perfectly usable on a 
Mac LC, it really requires 486 with a fast drive to run under windows.

>Working with Windows 3 does not help very much, because you have to
>know a lot about DOS in spite of Win: very often in maintenance and
>installation situations you are on the DOS level.... So the initial
>DOS training is necessary in any case.
>
I asked my Fiance what she thought about it and her answer was better 
than anything I might say about it:
	"To work on one of those (IBM) machines you have to know too
	much about how they work.  I don't want to know how they work,
	I just want them to create what I want them to create..."
-Larry
P.S. Apparently, the Mac creates what she wants it to create quite nicely.

>Peter
>
>-- 
>.     ________________________________________________________
>      Snail-Mail:    P.O.Box 2503 - D-2900 Oldenburg - Germany 
>      Voice:            +49-441-798-2901 or -4521 (Fax: -2155)
>      E-Mail:     Peter.Gorny@arbi.Informatik.Uni-Oldenburg.DE 
>      ________________________________________________________
From: zhu@sgi.com (Benjamin Zhu)
Newsgroups: comp.graphics
Subject: Re: Determining if a polygon is convex
Keywords: polygon, convex, area
Date: 14 Oct 92 03:49:42 GMT
Organization: Silicon Graphics, Inc.
NNTP-Posting-Host: graphack.asd.sgi.com

In article <1992Oct13.232936.8047@kpc.com> fred@kpc.com (Fred Fisher) writes:
>Hello,
>
>Does anyone know a nice quick way to determine if a polygon is convex?
>
>I've come up with the following, however it seems like there should be 
>a better way...
>

	Here are two relatively straightforward solutions off my head.

	(1) Throw away vertex ordering, and compute the convex hull of
	these vertices. If the computed convex hull is identical to the
	original polygon, the old polygon is convex. Otherwise, not!
	Since there is quite a bit hand waving here, you need to polish
	the details. This should be done in O(n*ln(n)), which I believe
	is optimal. The optimality might be a little bit difficult to 
	establish. At least I cannot see it in a few minutes. Other 2D
	convex-hull algorithms can be modified to do similar things, and
	might speed up things a bit. I am just too lazy for that. 

	(2) Walk along the edges. See if every other vertex lies at the
	same side of current edge. If so, convex. Otherwise, not! Fred's
	first pass might be used to cull away many convex polygons. But 
	I prefer a simple solution to complicated case discussions unless
	it's performance critical (not to me in this case:-)) or bringing
	down theoretical bounds (would be worthwhile from O(n^2) down to
	O(n*ln(n)) or O(n)).

	Ben

--
Benjamin Zhu             ;;; Priest of ucode and self-appointed bug terminator
Silicon Graphics, Inc.   ;;; ``Just call my name, I will be there.''
zhu@graphack.asd.sgi.com ;;; ``Projective geometry is all geometry.'' - Cayley
(415) 390-1187           ;;; ``Learn forever, young forever.'' - Anonymous
Newsgroups: comp.graphics,comp.graphics.avs,comp.org.issnnet,comp.os.msdos.programmer,comp.parallel
From:  net@SEDCS.MII2.LT (UAB Neurotechnologija)
Subject: Proposal from Lithuania
Reply-To: net@SEDCS.MII2.LT
Organization: Institute of Mathematics and Informatics, Lithuania
Date: Wed,  7 Oct 92 12:58:21 +0200 

[As you are all aware, the net is not supposed to allow commercial advertising.
 Because of the location of this company, I am publishing their article. If you
 are against such special treatment, let me know.   Steve
]

              We are Closed Joint Stock Company "NEUROTECHNOLOGIJA"
        (Lithuania). 
             Our company consists of group of programmers specializing in
         programming of new products based on advanced methods and
         approaches (neural networks, image processing etc.).
              We have already created some prospective, up to date and
         programs :
              - recognition of fingerprints JUSTUS 2.0,( introduced into
         Lithuanian police ).
              - recognition of handwriting texts NTDEMO (DEMO version).
              - Cardiology Wall Motions analysis CARD.
              Now we are looking for the possibility of cooperation with
         companies and/or groups and/or persons in other countries. 
              We would be very thankful if You expressed Your opinion about
         our proposals.
              If You are intersted in our programs we will be able to send
         You demo versions of our products.
                                         
                              Please contact :
              address : "UAB NEUROTECHNOLOGIJA",
                        Fabijoniskiu 47-29,
                        Vilnius, LITHUANIA.
              E-mail :  net@sedcs.mii2.lt

                           With great respect     A.Malickas, 
                                                  Director
From: djp@indigo.Eng.Sun.COM (Dan Petersen)
Newsgroups: comp.graphics
Subject: GRASS
Date: 13 Oct 1992 18:25:58 GMT
Organization: Sun Microsystems Inc., Mountain View, CA
Distribution: world
NNTP-Posting-Host: indigo


Posted for a friend:


I'm looking for the address of the FTP site for a program called GRASS.
If anyone knows where I can get this program please let me know.

**PLEASE** send replies to this email account dennis%centera@csn.org
Organization: Penn State University
Date: Tue, 13 Oct 1992 19:37:51 EDT
From: <MSM8@psuvm.psu.edu>
Newsgroups: comp.graphics
Subject: Re: WANTED: Image Formats/Algorithms

please send anything you get to me please, thanx a mega
From: jcbhrb@nic.cerf.net (Jacob Hirbawi)
Newsgroups: comp.graphics
Subject: RE: Fastest way to fill a 2D triangle (Summary)
Date: 12 Oct 92 01:52:42 GMT
Organization: CERFnet

In comp.dsp <3063@news.cerf.net> I wrote:

> What I would like to have is the absolutely fastest way to fill a 2D 
> triangle with a solid color. I have two simplistic ways of doing this which
> are not only slow but will not work if some of the pixels within the triangle
> are already set to the color of the boundary. I am sure there are better ways
> of doing this and would really appreciate any pointers. Note that I am not 
> really interseted in general algorithms for arbitrary or convex polygons and
> am not trying to fill in a complicated bitmap pattern -- speed is the one
> and only concern for now.
> 
> I'll describe what I am using now for the curious -- and for those intersted
> in knowing how NOT to do it :-)
> [wrong ways to do the job deleted]

Thanks to the kind help of 

  Eric Davies <ejdavies@watcgl.uwaterloo.ca> and
  MARK MORLEY <MORLEY@camins.Camosun.BC.CA>

I now have exactly what I was looking for: a truely efficient way to `fill'
triangles that will work regardless of what the pixels within the triangle
are set to. Besides getting rid of the artifacts of the algorithms I was using
before it looks like a have a speedup of at least 3x. 

--------------------------------------------------------------------------------
From: Eric Davies <ejdavies@watcgl.uwaterloo.ca>
Subject: Re: Fastest way to fill a 2D triangle

The `efficient' efficient way to do this (assuming you don't have 
specialized hardware) is to use a polygon scanline rendering algorithm.
I happen to have one (tailored for triangles) which I coded for a morphing 
package I wrote for amusements sake. I'll mail the file if you are 
interested. Its based on some pretty simplistic geometry, not a framebuffer, 
and hence is machine independent.

Eric Davies
ejdavies@watcgl.uwaterloo.ca
--------------------------------------------------------------------------------
From: MARK MORLEY <MORLEY@camins.Camosun.BC.CA>
Subject: Fastest way to fill a 2D triangle

Hi!  I have a *very* fast method that I wrote for my personal graphics lib.
It's only constraint is that it only works for counter-clockwise triangles,
although it is easy (and fast) to check and convert a CW to a CCW triangle.
The method does not involve any kind of flood fill at all.  My code is in
plain old C (Borland C++ 3.0) and is specific to the IBM PC VGA mode 13h
(320x200x256) but you could make it work for anything.   There ain't much
in the way of comments in the code, but it should be easy to follow.
If you're interested just ask and I'll mail it to ya.

>Thanks.

Yer welcome.

>Jacob Hirbawi
>JcbHrb@CERF.net

MARK
--------------------------------------------------------------------------------

Jacob Hirbawi
JcbHrb@CERF.net
From: bouma@cs.purdue.EDU (William J. Bouma)
Newsgroups: comp.graphics
Subject: Re: wierd polygons (was Re: Determining if a polygon is convex)
Date: 15 Oct 92 20:30:30 GMT
Organization: Department of Computer Science, Purdue University


In article <1bihtgINNs0k@fido.asd.sgi.com>, zhu@sgi.com (Benjamin Zhu) writes:
|> 
|> 	Wait a minute, do not people get it? I thought Reuel's argument
|> 	could not be clearer. When you talk about convex polygons, you are
|> 	not only concerned with vertex geometries, you are more interested
|> 	in vertex connectivities on the hull. In this case, the bow-tie
|> 	polygon has a convex hull 0213. Plain simple like that. How could
|> 	you say it's identical to the original polygon?

You are right.  I did not get it at first.  I suspect that it was
because I didn't read carefully and just assumed he meant to check
if all the points of the polygon were ON the convex hull.  I see
now that what he actually did say was to check if the given polygon
WAS the convex hull.  Sorry.

|> 	By the way, bow-tie quads are frequently seen-quads in practice.
|> 	Quite a few people in academia do not know that.

I still don't believe in these imaginary, non-existent, hypothetical
self-intersecting polygons, though.  And I am not going to until I see
one with my own eyes.  ;^)  Actually I have seen them, but only as a sign
that the code creating them was broken.
-- 
Bill <bouma@cs.purdue.edu> 
Newsgroups: comp.graphics
From: otto@nevada.edu (FREDERICK J HAAB)
Subject: Re: StarTrek starship databases
Organization: University of Nevada System Computing Services
Date: Thu, 15 Oct 1992 23:04:56 GMT

In article <zg1z2xc@rpi.edu> kyriazis@nova0.rdrc.rpi.edu (George Kyriazis) writes:
>In article <Jon.Biddell.249.718808681@unsw.edu.au> Jon.Biddell@unsw.edu.au (Jon Biddell) writes:
>>Just read this thread - I could make some space available on usage.csd.unsw.
>>edu.au, we are currently setting up an ftp site here....
>>
>
>I can put some databases in the wuarchive.wustl.edu.
>
>Please send me mail.
>
>  --george
>-- 
>----------------------------------------------------------------------------
>George Kyriazis       | Visual Technologies Program, Rensselaer Design
>kyriazis@rdrc.rpi.edu |  Research Center, CII 7015, RPI, Troy, NY 12180
>----------------------------------------------------------------------------

Just to let you guys know that this kind of help is great, if
anyone manages to set up a place for this sort of thing, please
let us know how we can submit and download these guys.

-Fred


Xref: sparky comp.graphics:10690 comp.sys.sgi:15195 comp.human-factors:2447
From: mott@sgi.com (David Mott)
Newsgroups: comp.graphics,comp.sys.sgi,comp.human-factors
Subject: Re: Papers on UI and/or Graphics Programming Libraries?
Date: 16 Oct 1992 17:45:52 GMT
Organization: Silicon Graphics
NNTP-Posting-Host: clamato.asd.sgi.com

In article <1992Oct14.212635.5063@seas.gwu.edu> darken@seas.gwu.edu (Rudy Darken) writes:
>I'm working on a survy paper on UI and graphics programming toolkits
>and libraries. Specifically, I'm looking at X Windows, GL, PEX, 
>Motif, XView, Performer (SGI), and Inventor (SGI).


A paper describing IRIS Inventor can be found in last years SIGGRAPH
proceedings:

	Paul S. Strauss, Rikk Carey
	"An Object-Oriented 3D Graphics Toolkit"
	Computer Graphics, 26(2) (July 1992)
	pp. 341-349



Newsgroups: comp.graphics