HDTenEightyP/NetNews huggingface dataset:
From: rsk@gynko.circ.upenn.edu (Rich Kulawiec)
Newsgroups: comp.graphics.visualization
Subject: Re: SDSC Image Tools V2.1 Release
Keywords: image file format, graphics, pixel utilities, image processing
Date: 15 Dec 92 04:39:08 GMT
Organization: Mike Singletary Appreciation Society

In article <1gj4daINN6rd@network.ucsd.edu> nadeau@sdsc.edu writes:
>The SDSC Image Tools are released in binary form [...]
>
> Tool source code is included.  Library source is not provided except
> for sample source [...]

If you'd like your tools to be widely used, debugged, ported, and
enhanced, then it would probably be a good idea to provide the full source
code...like Khoros...or pbm...or xv...or morph...or popi...and the
rest of the imaging/graphics software of similar functionality which
has been released to the Usenet community.  Binary distributions are
not nearly as useful.

History (i.e. the history of various software tools in relation to
Usenet/Internet over the past decade that network releases have been
utilized) has shown that tools released with complete source code tend
to do much better in the long run than their source-lacking counterparts.

---Rsk
From: ccav27@ccsun.strath.ac.uk ("Y.Chen")
Newsgroups: comp.graphics.visualization
Subject: Software Engineer in 3D Computer Graphics
Date: 10 Dec 92 12:07:52 GMT
Organization: University of Strathclyde


I am posting this for my friend who currently has
no access to this network yet. Please respond to the
name and address in the ad.

I know this is not the EXACTLY RIGHT group to post this
ad, just my friend may wish to hear some Silicon
Graphics GL experts to respond. The project involes
writing Motif interface in C++, and doing interactive
3D graphics stuff in Motif window using GL calls. So
do accept my apology.

				Charles
*********************************************************

		Software Engineer


Midland Valley is a small Glasgow based software company 
specialising in geological modelling for the oil industry. 
We are seeking an additional engineer to join a team working 
on development of a new 3D project which is funded by the EC
and AMOCO over three years. The ideal candidate will have 
experience of C++ and Motif programming  and be recently 
qualified   with a strong interest in 3D Graphics programming
on Silicon Graphics workstations and Sun Sparcstations.

Please Contact Dr. Alan Gibbs on 041-332-2681, or send a
full CV with details of any relevant work or project 
experience to 

	Dr. Alan Gibbs 
	Midland Valley Exploration Ltd.
	14 Park Circus 
	Glasgow G3 6AX
	Scotland


**********************************************************
From: frost@sdsc.edu (Richard Frost)
Newsgroups: comp.graphics.visualization
Subject: Re: SDSC Image Tools V2.1 Release
Date: 17 Dec 92 00:20:27 GMT
Article-I.D.: network.1goh4bINNe1b
Reply-To: frost@sdsc.edu
Distribution: world
Organization: San Diego Supercomputer Center @UCSD.
NNTP-Posting-Host: stimpy.sdsc.edu


A source release is planned in one of the later releases.  In the
meantime, the binary release insures that bugs are our bugs, and not
someone else's posted at a different site.  This was a hard lesson
learned by a few of the other Supercomputer centers.

For more info, please contact the author directly:

	nadeau@sdsc.edu
From: jim@baroque.Stanford.EDU (James Helman)
Subject: Re: References to visualizing 2nd Order Tensors. . .
Organization: Stanford University
Date: 30 Nov 92 00:12:30

While he was at Visual Edge, Rob Dickinson did some work tracing
curves through the direction fields of the major and minor
eigenvectors of 2nd order tensor fields.  His application was also
stress and strain, and the method appeared quite effective.  I'm not
sure, but it might be described in his paper:

@ARTICLE{Dick91a,
	AUTHOR = "Robert R. Dickinson",
	Title = "Interactive Analysis of the Topology of 4d Vector Fields",
	JOURNAL = "IBM Journal of Research and Development",
	MONTH = Jan,
	VOLUME = 35,
	NUMBER = 1,
	PAGES = "59-66",
	YEAR = 1991}

Jim Helman				SGI:  (415) 390-1151
jimh@surreal.asd.sgi.com		FAX:  (415) 591-8165
jim@KAOS.stanford.edu

"The power of the computer is locked behind a door with no knob."
						-B. Laurel



Article 980 of comp.graphics.avs:
Newsgroups: comp.graphics.visualization,comp.graphics.avs
From: favre@seas.gwu.edu (Jean Favre)
Subject: Re: References to visualizing 2nd Order Tensors. . .
Organization: George Washington University
Date: Mon, 30 Nov 1992 14:46:00 GMT

>In article <1992Nov30.031005.27606@news.eng.convex.com>, gardner@convex.com writes:
>> Can anyone give me any pointers to references in the literature on the 
>> visualization of 2nd order tensors?  We have implemented an AVS 

You may also try the following paper:

@INPROCEEDINGS{Delm92,
   AUTHOR = "Thierry Delmarcelle and Lambertus Hesselink",
   TITLE = "Visualization of Second Order Tensor Fields and Matrix Data",
   BOOKTITLE = "Visualization'92",
   ORGANIZATION = "IEEE Computer Society",
   YEAR = 1992,
   MONTH = Oct,
   PAGES = "316--323"
   }

Hope this helps.


-- 
Jean M. Favre. EE&CS Dept. The George Washington University
		(202) 994 5917
		favre@seas.gwu.edu
From: spebcg@thor.cf.ac.uk (Mr B G Cetiner 92)
Newsgroups: comp.graphics.visualization
Subject: Re: DIGITAL DOG/wanted
Date: 11 Dec 92 18:30:55 GMT
Organization: University of Wales College at Cardiff
X-Mailer: Cardiff Computing Maths PP Mail Open News Gateway


      Here is an ASCII dog.....
                             __
                            /  \
                           /|oo \
                          (_|  /_)
                             `@__\   _
                              /_K_\  \\
                             /     \  ))
                            /.|  /  \//
                          _//|| _\   /
                         (_/(_|(____/
 

B.G.Cetiner
Newsgroups: comp.graphics.visualization,sci.math,comp.windows.ms
From: peter@xvt.com (Peter Hallett)
Subject: Re: 3D plotting / visualization
Organization: XVT Software Inc.
Date: Fri, 18 Dec 1992 22:13:26 GMT
X-Disclaimer: The views expressed in this message are those of an
	individual at XVT Software Inc., and do not necessarily
	reflect those of the company.

n comp.graphics.visualization, dlhanson@nap.amoco.com (David L. Hanson ) writes
:
> something NOW.  There is also a product called PV-Wave (from Precision
> Visuals, Boulder CO) that would be excellent, but it only plots to VAX and
> Unix display devices, and this project is limited to PCs

Are your PCs able to run Windows NT?  I saw PV-WAVE running in the 
Microsoft booth at Comdex last month on a 486 running WinNT.  Also
running on DEC Alpha and Mips machines running WinNT.

peter@xvt.com

Newsgroups: comp.graphics
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: Calculating polygon areas
Organization: Smith College, Northampton, MA, US
Date: Thu, 17 Dec 1992 20:17:39 GMT

In article <1992Dec17.154323.17206@medusa.prime.com> mrj@CIS.Prime.COM writes:
>In article 5737@medusa.prime.com, mrj@CIS.Prime.COM (Mohammad Reza Jahanbin) writes:
>> 	Area = 0.5 \sum_{i=0}^{n} (P_i X P_{i+1})         

>> The proof is simple. If anyone is interested I'll post it to the net.
>
>Since I have had a number of people asking me for this proof I am posting it:
>[...C a center point...]
>Assume the polygon is triangulated into n+1 triangles P0P1C, P1P2C,
>..., PiP(i+1)C, ..., PnP0C. Now the area of the polygon is equal to
>the sum of the areas of triangles. This holds wheather or not the
>polygon is convace or convex, due to the choice of C.
            ^^^^^^^

Herein lies the crux of the matter.  It is certainly true that this
sum of triangle areas is the area of the polygon, even for nonconvex
polygons.  But this is the key claim in need of proof.  I know how
to prove it, but I am always interested in learning of simpler proofs.
Organization: Penn State University
Date: Tue, 15 Dec 1992 16:38:54 EST
From: Glenn Bobb <GIB1@psuvm.psu.edu>
Newsgroups: comp.graphics
Subject:    Non-dithered colors in Paintbrush?

Has anyone out there had any luck creating non-dithered colors
in Windows 3.1 Paintbrush.  I can create a wide variety of colors
but they all have that course appearence.  The reason for this
course appearence is the alternating sprite colors.  I was able to
pull in the 256color.bmp file and on close inspection of the pixels
noted colors which I was unable to recreate.  Is this a limitation of
Paintbrush (it wouldn't suprise me) and is there some packages out
there that allow TRUE 256 color creations.  I would appreciate any
guidance that may be given.

-Glenn
|=============================|=======================================|
|Glenn Bobb GIB1@PSUVM.PSU.EDU| What is good in life Conan?           |
|                             |   "To crush your enemies, to see them |
|    \ /  Lets Go FLYERS  88  |     driven before you and to hear the |
|  __/ \__  Go Nittany Lions  |      lamentations of their women."    |
|=============================|=======================================|
Newsgroups: comp.graphics
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: How to find minimal bounding circle of a polygon?
Organization: Smith College, Northampton, MA, US
Date: Mon, 14 Dec 1992 02:16:51 GMT

In article <24405@hacgate.SCG.HAC.COM> shek@aic.hrl.hac.com (Eddie C. Shek) writes:
>[...] the minimal bounding circle is defined as
>the smallest circle that covers the polygon.
>
>Are there any algorithms that find the minimal bounding circle
>of a 2-D polygon (or equivalently, a set of 2-D points)?

Yes.  There is a beautiful connection between this problem and the
furthest-point Voronoi diagram:  the center of a minimum spanning
circle lies on this diagram, at a vertex if the circle touches
the polygon at three points.  So constructing the f-p Vor diag.
almost gets you there.  And that diagram is easily obtained from
a three-dimensional convex hull.
	But this is not the only way to do it.  An unusual approach
can be found in this paper:

@incollection{Melville
, author =	"R. C. Melville"
, title =	"An implementation study of two algorithms for the minimum spanning circle problem"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"267--294"
}
Newsgroups: comp.graphics
From: traal@lopez.marquette.MI.US (Brian Phillips)
Subject: Algorithm for Parabola.
Organization: Great White North/UPLink
Date: Wed, 16 Dec 1992 01:30:12 GMT

I'm looking for an equation to plot a parabola.  I'd like to specify the
x-intercepts, and the height.  I know the algebraic formula, but somehow
it's not converting to C very well.  Or rather, I'm not converting it to
C very well.  Anyone got a working one?

  --Traal the BRAVE 
-- 
  EMAIL (the Good, the Bad, or the Flame) to:  traal@lopez.marquette.MI.US
   "Take a walk through the looking-glass and see the other side!" -- BPP
            "Realism is often misconstrued as pessimism." -- BPP
          "My mailer hates everybody, be sneaky." -- Mary Margret
From: colemanr@garnet.berkeley.edu ()
Newsgroups: comp.graphics
Subject: TARGA files
Date: 16 Dec 1992 07:49:39 GMT
Organization: University of California, Berkeley
Distribution: world
NNTP-Posting-Host: garnet.berkeley.edu

I am trying to send "Targa" files to a Montage slide maker.  The docs say
that it accepts Targa files but it chokes on the ones I make using 
image converters like Graphic Workshop (a PC program).  It says 
"Unsupported TARGA file type" and dies.  My question: are there
different flavours of TARGA files?    
  Any help would be appreciated.
-- Ron Coleman
From: tshin@husc8.harvard.edu (Tae Shin)
Newsgroups: comp.graphics
Subject: Help with PIPPIN format
Date: 15 Dec 92 08:22:55 GMT
Article-I.D.: husc8.TSHIN.92Dec15002255
Distribution: world
Organization: Harvard Arts and Sciences Computer Services, Cambridge, MA

This question is sort of a longshot, but I thought this might be the most
appropriate group for its posting (correct me if I'm wrong).

Using a program called RIBBON for generating Richardson diagrams for proteins,
I've finally converted the image to a format for FRODO and subsequently to a 
PIPPIN format (these sound esoteric, but hopefully someone knows what I'm
talking about).  Unfortunately, the PIPPIN format seems more appropriate for a 
pen plotter rather than a laser printer (which I have).  Does anyone know how
to print a PIPPIN file on a laser printer or convert to something that can be
printed (e.g. PostScript)?  The program is running on a VAX, but I also have an
SGI Indigo and Macintoshes available if needed for file conversion.  Any help
would be greatly appreciated.

Thanks.

T.B. Shin
Dept. of Chemistry
Harvard University
tshin@husc8.harvard.edu
Newsgroups: comp.graphics
From: bahi@inf.ethz.ch (Hicham Bahi)
Subject: large sun raster files
Organization: Dept. Informatik, Swiss Federal Institute of Technology (ETH), Zurich, CH
Date: Fri, 18 Dec 1992 15:26:16 GMT

I have the following problem:

I am working with huge sunraster files (27152x37937 pixels)
which are run_length encoded. Since I don't have enough memory
to load the whole picture, I have to cut it into smaller pieces.

Because of the run-length encoding, I have to read all the bytes
of the file to find the starting position of the sub-image. For
huge files, this means hours of computing.

Does anybody know a better way to cut run-length encoded rasterfiles?

Thanks.
From: Chris_F_Chiesa@cup.portal.com
Newsgroups: comp.graphics
Subject: Re: G-I-F pronunciation
Date: Mon, 14 Dec 92 17:40:41 PST
Organization: The Portal System (TM)
Distribution: na
  <1992Dec13.195544.11512@admiral.uucp>

>According to Compuserve (who originated the format) it's pronounced "jif", lik
e
>the peanut butter.

Ah, my respect for CI$ drops down another notch.  How stupid of them to 
derive a soft-G pronunciation from an abbreviation of a hard-G word ("graph-
icsomething")...

Chris Chiesa
  Chris_F_Chiesa@cup.portal.com
From: leech@cs.unc.edu (Jon Leech)
Newsgroups: comp.graphics.research
Subject: Scalability (was Re: comp.graphics.research)
Date: 18 Dec 92 22:17:52 GMT
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu


In article <11566@sun13.scri.fsu.edu>, rms@well.sf.ca.us (richard marlon stein) writes:
|> Try muxing the outputs from 1000 framebuffers into a single analog stream.
|> I would rather pass on this approach.  The PixelFlow box captures the output
|> from a composition network rated at 4 Gbytes/s into a single frambeubffer.
|>
|> I don't believe this approach is truly scalable either, since its still
|> an example of the N to 1 mux problem.  So it is, in my opinion, contention
|> limited (the laws of physics won't cooperate and provide infinite digital
|> bus or network bandwidth).

    PixelFlow should be extremely scalable. The composition network
has fixed bandwidth no matter how many renderers are used, and latency
due to the length of the composition network increases very slowly as
additional rendering boards are added.

    If you're referring to some other aspect, please explain in more
detail.

|> I advocate a tessellated display approach myself, where each tessellation
|> element owns a processor, framebuffer, and display.	The trick is to coordinate
|> the system temporally.  The scalable concurrent visualization system trades
|> contention for asynchronous execution.

    If you mean that each processor is responsible for a fixed screen
area, this approach wastes most of the processors when looking at
something far away. It also trades off moving pixels for moving
primitives, and moving primitives is definitely not scalable.
Pixel-Planes 5 uses a considerably more complex variant of this
decomposition and partly addresses these concerns.
--
    Jon Leech (leech@cs.unc.edu)    __@/
    "Totally bounded: A set that can be patrolled by a finite number
     of arbitrarily near-sighted policemen."    A. Wilonsky, 1978

--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu
From: bkb@spatial.com (Brett K. Bloomquist)
Newsgroups: comp.graphics.research
Subject: The unknown "Michael Rund"
Date: 11 Dec 92 21:16:57 GMT
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu

Here is some information that may help out with the postings
in regards to Michael Rund.  He is a headhunter that I have
seen information from before.  The latest information I have
is:

		Michael Rund
		Research Employment
		P.O. Box 553
		Riverton, Utah  84065
		(801) 254-9330

I have no idea how good he is.

--
Brett K. Bloomquist          /\
ACIS Geometry Tools         /\ \   E-mail: bkb@spatial.com 
Spatial Technology, Inc.   /\ \ \   Phone: (303) 449-0649  
2425 55th St., Bldg. A    /\ \/\ \   Fax: (303) 449-0926
Boulder, CO 80301-5704   /__\/__\_\

--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu
From: dwight@geohub.gcn.uoknor.edu (Dwight D. Moore)
Newsgroups: comp.graphics.research
Subject: Re: looking for current research in GUI-aspects of color
Date: 18 Dec 92 22:17:31 GMT
Reply-To: dwight@geohub.gcn.uoknor.edu
Organization: Geosciences Computing Network, Univ. of Oklahoma
Originator: usenet@kittyhawk.ecn.uoknor.edu
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu

|>Path:
|
constellation!convex!convex!news.oc.com!mercury.unt.edu!cs.utexas.edu!uunet!gatech!mailer.cc.fsu.edu
u!sun13!ib.rl.ac.uk
|>On 16 Dec 92 19:47:49 GMT <evelyn@EDU.TAMU.KESTREL> said:
|>>
|>>I am about to embark on my graduate research experiment.  The experiment
|>>is a comparison of color spaces (RGB, HLS, etc.) and color specification
|>>techniques (sliders, 2-D displays, etc.), a continuation of the research
|>>conducted by Schwarz at the University of Waterloo ~1985.  There has not
|>>been much written in this area since then, so I would like to put a call
|>>out for any others who are actively researching in this area to please
|>>contact me, so that I can make sure my project is not duplicating existing
|>>work.  Thanks very much.

Philip K. Robertson (CSIRO Division of Information Technology's Center
for Spatial Information Systems in Canberra, Australia)
was part of the SIGGRAPH '92 workshop on "Color Theory and Models 
for Computer Graphics and Visualization." He had some interesting work 
on color space mapping and is working on an application/model for 
mapping color spaces with respect to different output devices, and 
well as the interface for doing such tasks (visualizting color gamuts). 
I don't know if is what you are looking for, but it was interesting.
--------------------------------------------------------------------------
Dwight D. Moore
Geosciences Computing Network
University of Oklahoma

dwight@geohub.gcn.uoknor.edu (129.15.40.10)
These opinions do not necessarily represent the opinions of OU or the GCN.
----------------------------------------------------------------------------


--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu
From: chrisg@cbmvax.cbm.commodore.com (Chris Green)
Newsgroups: comp.graphics.research
Subject: comp.graphics.research
Date: 17 Dec 92 02:17:16 GMT
Reply-To: chrisg@cbmvax.cbm.commodore.com (Chris Green)
Organization: Commodore, West Chester, PA
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu


	Has anyone ever attempted to take advantage of the 
"infinite-frame-rate" of raster scan devices, particularly video?
What I mean by this to render your animation with the knowledge
that each pixel is (for instance) 35ns later than the preceeding
pixel, and that each scan-line is ~63uS later than the preceeding
one. Given appropriate temporal filtering, and a general enough
4-d ray-tracer, shouldn't this provide a potential for improved
quality? Is anyone familiar with any research or applications
of this? I'm familiar with Don Mitchell's paper on interlace
and chroma filtering for video.


--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu
From: evelyn@kestrel.tamu.edu (Evelyn Wells)
Newsgroups: comp.graphics.research
Subject: looking for current research in GUI-aspects of color
Date: 16 Dec 92 19:47:49 GMT
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu


I am about to embark on my graduate research experiment.  The experiment
is a comparison of color spaces (RGB, HLS, etc.) and color specification
techniques (sliders, 2-D displays, etc.), a continuation of the research
conducted by Schwarz at the University of Waterloo ~1985.  There has not
been much written in this area since then, so I would like to put a call 
out for any others who are actively researching in this area to please
contact me, so that I can make sure my project is not duplicating existing
work.  Thanks very much.

Evelyn Wells
Visualization Laboratory
Texas A&M University

evelyn@archone.tamu.edu


--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu
From: CDO@ib.rl.ac.uk (C D Osland)
Newsgroups: comp.graphics.research
Subject: Re: comp.graphics.research
Date: 18 Dec 92 22:17:47 GMT
X-Submissions-To: graphics@scri1.scri.fsu.edu
X-Administrivia-To: graphics-request@scri1.scri.fsu.edu


On 17 Dec 92 02:17:16 GMT <chrisg@COM.COMMODORE.CBM.CBMVAX> said:
>
>	Has anyone ever attempted to take advantage of the
>"infinite-frame-rate" of raster scan devices, particularly video?
>What I mean by this to render your animation with the knowledge
>that each pixel is (for instance) 35ns later than the preceeding
>pixel, and that each scan-line is ~63uS later than the preceeding
>one. Given appropriate temporal filtering, and a general enough
>4-d ray-tracer, shouldn't this provide a potential for improved
>quality? Is anyone familiar with any research or applications
>of this? I'm familiar with Don Mitchell's paper on interlace
>and chroma filtering for video.

I don't get your point.  Spatial anti-aliasing deals with the
2D image, which can be viewed as a projection of the 3D scene.
Temporal anti-aliasing is otherwise known as motion-blurring.
I don't see how extra quality can be achieved by further
work that regards the dimensions as equivalent.  That may be my
problem!?

Chris Osland
Atlas Video Facility
Rutherford Appleton Laboratory, UK

--
Moderated by SCRI Vis <>           Submissions to: graphics@scri1.scri.fsu.edu
Guy, John R. Murray   <> Administrivia to: graphics-request@scri1.scri.fsu.edu