HDTenEightyP/NetNews huggingface dataset:
From: thalli@piis10.joanneum.ac.at (Georg Thallinger (IIS))
Subject: Re: Manipulating geometries as input
Keywords: AVS geoms, input
Organization: Joanneum Research (IIS)
Date: Wed, 11 Nov 92 18:13:11 GMT

In article <2AFAD91D.26553@news.service.uci.edu>, schiano@vega.acs.uci.edu (Allen V. Schiano) writes:
|> 
[ question on writing modules manipulating geometries removed ]

 The international AVS center holds a module called ucd_particle that does things like the ones you want to do. It uses a bunch of  undocumented AVS-calls (which are not explained in the c-files also |-( ). Maybe this gives you some hints.

Bye, bye

Georg 
-- 
Georg THALLINGER                      | e-mail: thalli@piis10.joanneum.ac.at
Institute for Information Systems     |         thallinger@joanneum.ada.at
JOANNEUM RESEARCH GRAZ /  AUSTRIA     | phone:  (++43/316) 8020-243
Newsgroups: comp.graphics.avs
From: harry@phys-chemie.uni-wuerzburg.dbp.de (Harald Lanig)
Subject: AVS chemistry-viewer
Organization: Institut fuer Physikalische Chemie, Uni Wuerzburg
Date: Fri, 13 Nov 1992 08:44:02 GMT


Fellow Netters,

can anyone out there give me information about the AVS-Chemistry-Viewer?
I am doing semi-empirical calulations on a SUN Sparc2 using OW3.0 
and SUNOS 4.1.1.
I am also interested hearing about the features (and the costs) of this 
program. Any information is greatly welcome.
Please reply on the net or directly to me.

Thanks in advance

-Harald.

---------------------------------------------------------------
Harald Lanig                 Institut fuer Physikalische Chemie
                             Marcusstr. 9-11
phone: +49(0)931-31-510      8700 Wuerzburg
  fax: +49(0)931-57-849      Germany
email: harry@phys-chemie.uni-wuerzburg.dbp.de
---------------------------------------------------------------


Newsgroups: comp.graphics.avs
From: lour@avs.com (Lou Romm)
Subject: AVS on IBM with GT4x
Organization: Advanced Visual Systems Inc.
Date: Wed, 11 Nov 1992 16:00:41 GMT
X-Newsreader: Tin 1.1 PL4
X-Posted-From: phobos.avs.com
NNTP-Posting-Host: sol.ctr.columbia.edu

If you have AVS 4.0 running on an IBM RS6000 with the GT4x graphics
accelerator, please DO NOT install ptf 409414 provided in the latest IBM OS,
AIX 3.2.3 . We recommend that you do not commit the latest ptf's,
so that if/when AVS appears to break, then you can back off the ptfs.

The symptom you will get if ptf 409414 is installed and you run AVS is:
X Error of failed request:  BadGC (invalid GC parameter)
  Major opcode of failed request:  56 (X_ChangeGC)
  Minor opcode of failed request:  0
  Resource id in failed request:  0xd076d5ec
  Serial number of failed request:  5987
  Current serial number in output stream:  6247

We are also aware of another IBM gl library problem (libgl.a)
that affects 2 AVS demos:  Carib and Lobster Scan.  Running these
demos will lock up the Xserver, forcing a system reboot.  Do not run
these demos if you have AIX 3.2.2 . IBM is looking into this as well.

AVS is working closely with IBM to quickly resolve this.

Lou.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Lou Romm		              Personal email:    lour@avs.com 
Manager Customer Support              Personal phone:    617-890-4300 x2153
Advanced Visual Systems, Inc          AVS Support email: support@avs.com      
300 Fifth Avenue, 3rd floor           AVS Support phone: 1800-4AVS-001
Waltham, MA 02154	              FAX:               617-890-8287
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


Newsgroups: comp.graphics.avs
From: m20163@mwunix.mitre.org (Nahum Gershon)
Subject: Custom User Interface to AVS
Summary: How to improve the user interface of AVS networks and displays?
Keywords: AVS, User Interface, 
Organization: The MITRE Corporation
Date: Thu, 12 Nov 1992 16:50:25 GMT

The representation of AVS is very useful for developers.  However, we have
found out that less sophisticated users would prefer a better user interface.  
Has anyone tried (or knows anyone who has tried) to build a front end to AVS 
with user friendlier displays and control?  Thanks.
Newsgroups: comp.graphics
From: r0506048@csman.csie.ntu.edu.tw (Chun-Hung Lin)
Subject: Re: What comprosises a Tiff and Gif image format
Reply-To: r0506048@csman.csie.ntu.edu.tw
Organization: Communication & Multimedia Lab, NTU, Taiwan
Date: Sun, 8 Nov 1992 12:21:12 GMT


In article 1cc185INNfk3@uwm.edu, xepo@csd4.csd.uwm.edu (Scott R Violet) writes:
>
>HI,
>	I would like to write my own program to convert between these
>two and would be interested if some one could direct me to the proper
>place that specifies what comprises a Gif and Tiff image.  I know
>there is a ton of programs that will do this for you, but I would like
>some experience.  Also, if there is a source that has other image
>standards as well (like iff, jpeg...) I would be intested in that as
>well.
>Thanks,
>-- 
>
>		-Scott Violet (xepo@csd4.csd.uwm.edu)

You can find the spec. of many graphics formats in directory /pub/graphics.format
on zamenhof.cs.rice.edu(128.42.1.75). 
 
=================================================================
Chun-Hung Lin                     
r0506048@csman.csie.ntu.edu.tw    
Communication & Multimedia Lab.
Dept. of Comp. Sci. & Info. Eng.
National Taiwan University, Taipei, Taiwan, R.O.C.


Newsgroups: comp.graphics,comp.graphics.visualization,comp.graphics.animation
From: djb@geovision.gvc.com (Darren Burns)
Subject: Re: FTP Site for 3D objects now OPEN!
Organization: Not officially GeoVision Systems Inc., Ottawa, Ontario, Canada
Distribution: na
Date: Fri, 13 Nov 1992 12:45:45 GMT

For some reason, my site never received the original posting with the
subject "FTP Site for 3D objects now OPEN!" -- it did however receive
a follow-up to it.

If it's true that the FTP site is open, could somebody give me the
information that was in the original post (ie. the site address and
directories and such).

Thanks,
Darren Burns
From: jbickers@templar.actrix.gen.nz (John Bickers)
Newsgroups: comp.graphics
Subject: Re: Speed Tests
Date: 7 Nov 92 21:46:07 PST
Organization: TAP

Quoted from <1992Nov6.101623.11989@waikato.ac.nz> by ldo@waikato.ac.nz (Lawrence D'Oliveiro, Waikato University):

> Conclusion: a 33MHz 68040 has no trouble reaching or exceeding a playback
> rate of 30 frames per second at 320*240 resolution. Even a 25MHz 68040
> (Quadra 700/900) should be able to do 30 frames per second.

    What is the average number of pixels actually being updated per
    frame (counting multiple updates for double-buffering, if it needs
    it)? I think that is a very important value.

> Lawrence D'Oliveiro                       fone: +64-7-856-2889
--
*** John Bickers, TAP.                   jbickers@templar.actrix.gen.nz ***
***    "Radioactivity - It's in the air, for you and me" - Kraftwerk    ***
Xref: sparky comp.graphics:11583 comp.multimedia:3272 comp.compression:3755
From: westover@sunpix.East.Sun.COM (Lee Westover - Sun NC Development Center)
Newsgroups: comp.graphics,comp.multimedia,comp.compression
Subject: Looking for analytic image quality metric
Date: 6 Nov 92 22:17:51 GMT
Organization: Sun Microsystems, Research Triangle Park, NC
NNTP-Posting-Host: jt1.east.sun.com


Hello netters,

We are doing some work with digital video compression/decompression and
are looking for a way to measure image quality that is not subjective.
We would like to find a reasonable way of comparing an original image
with the decompressed compressed image.  MSE and MAE are bad metrics
and we do not want to hassle with user studies.

Does anybody know of a good image quality measure? Know of any
institutions working on finding a good analytic image quality measure?
Know of any papers about this subject?

And would be willing to tell me about them -:)

thanx, lee
lee.westover@sun.com
From: jims@techsup.UUCP
Date: 06 Nov 92 10:04 CST
Newsgroups: comp.graphics
Subject: Re: Info on these 3d animator software
Message-ID: <7200002@techsup>
Nf-ID: #R:u.washington.edu:7517:techsup:7200002:000:1280
Nf-From: techsup.UUCP!jims    Nov  6 10:04:00 1992



/* ---------- "Info on these 3d animator software" ---------- */

> I would like some information about these products, what you like, featur,
>bad, etc.

>     1.       3D studio ( now I see one by autodesk at ver 2.0, is this the sae
                           one that everyone tells me is so great? >

>     2.       Topas 4.0 by at&t I believe

>     3.       Digital Arts DGS 3.3

>and I would like to know if there is a student price for these programs.

>and what company makes Playmation?

>:ken
>:eylerken@u.washington.edu

1. I haven't tried this yet (will soon)
2. Topaz is quite impressive but you need a targa video board to use it $$.
3. Have not seen it.

4. Playmation is Cinaplay Interactive.
   2580 NW Upshur, Portland OR 97210   <- from back of the box :)

   Technical Support
   2800 E Evergreen Blvd
   Vancouver WA 98661
   1-(503-223-0276)  <- out of owners manual

   I like playmation, it has many features and can create realistic renders.
   The way you make splines is a little clunky but I have not seen any other
   software that does the things that Playmation does so I cant really complain
   about it.

Note that I have no connection with any of the above mentioned companies, I'm
just a hobbist :)
 
Jim Skilskyj
utacfd!rwsys!techsup!jims
 

Xref: sparky comp.graphics:11528 comp.graphics.visualization:1705 comp.sys.sgi:16016 sci.math:14441
From: lim@cs.umass.edu
Newsgroups: comp.graphics,comp.graphics.visualization,comp.sys.sgi,sci.math
Subject: Algorithm for tessellating/triangulating surfaces needed
Date: 5 Nov 92 20:02:35 GMT
Reply-To: lim@cs.umass.edu ()
Followup-To: comp.graphics
Organization: University of Massachusetts, Amherst


I'm looking for an algorithm (or better yet, a program) that would
tessellate/triangulate an arbitrarily-shaped planar surface, possibly with one
or more arbitrarily-shaped cutouts/holes in it, given only the outline points.
These points for the external outline will be in one order
(clockwise/anti-clockwise) and the points representing cutout outlines will be
in the opposite order. At this point, I'm not really worried about the size of
these "mosaic" pieces as long as they're either triangular or quadrilateral.
I've seen this being done in finite-element analyses software. I'd appreciate
it if anyone who has information on this could give me some ideas. Thanks.


Jonathan Lim
lim@cs.umass.edu




--------------------------------------------------------------------------------
             Jonathan Lim          Computer Vision Research Group
           lim@cs.umass.edu    University of Massachusetts at Amherst
--------------------------------------------------------------------------------
From: ianf@cs.adelaide.edu.au (Ian Florance)
Newsgroups: comp.graphics
Subject: MPEG standards
Date: 11 Nov 1992 04:46:48 GMT
Organization: Comp Sci, Uni of Adelaide, Australia
Distribution: world
Reply-To: ianf@cs.adelaide.edu.au (Ian Florance)
NNTP-Posting-Host: chook.cs.adelaide.edu.au

Does anyone know of any ftp places for the various MPEG standards
or any computer source at all?
___________________________________________           _--_|\
Ian Florance         Phone : +6 18 228 5502          /      \ 
The Univeristy of Adelaide Apple Consortium          \_.--*_/
University of Adelaide,     South Australia                v
From: tgl+@cs.cmu.edu (Tom Lane)
Newsgroups: comp.graphics
Subject: Re: N bit planes/pixel or N bits/pixel?
Date: 10 Nov 92 17:30:48 GMT
Article-I.D.: cs.BxIGnI.EzD.2
Organization: School of Computer Science, Carnegie Mellon

sdoran@kitty.ksu.ksu.edu (Steven Marcotte) writes:
>What is the advantage of N bitplanes/pixel over N bits/pixel?  I would
>think that the N bin/pixel (packed-pixel) representation would offer
>better speed than jumping through memory and performing bit twiddling,
>especially at 8 bits/pixel.

I assume you are contrasting the case where each pixel occupies one address
location with the case where each bitplane appears (packed) in a separate
part of the address space.  (For example, in the first case a given byte
might represent the 8-bit value of pixel x=456,y=123; in the second case a
given byte might represent the low-order bits of eight adjacent pixels.)

I prefer the byte-per-pixel approach myself.  However, there are indeed
cases where separate bitplanes are a win, namely where you want to
manipulate a bitplane independently.  For example, you could handle a cursor
or a video-game "sprite" by setting appropriate bits in just one bitplane,
with the remaining bitplanes containing the unchanged background.  With
appropriate color map entries this will give the desired results.

The other main reason for bitplane hardware is that it takes up less address
space in cases where you don't have exactly 8, 16, or 32 bits/pixel; there
aren't unused bits in every byte.  On real computers with 32-bit or better
address spaces, this isn't much of a concern, but on PCs it is a big issue.
A PC video card driver has to do bank-swapping to get at all of the card's
memory, so avoiding holes in the address space translates directly to fewer
banks, less swapping.  Of course we all know that PCs are brain-damaged in
every possible way, especially so in video hardware...

				regards, tom lane
Newsgroups: comp.graphics
From: hollasch@kpc.com (Steve Hollasch)
Subject: Re: polyhedron/polyhedron intersection
Summary: Trivial accept and reject tests; a defense
Keywords: 3d graphics, intersection
Organization: Kubota Pacific Computer, Inc.
Date: Wed, 11 Nov 1992 19:34:39 GMT

katkere@engin.umich.edu writes:
| I am looking for code/ideas for finding if two polyhedrons intersect.

hollasch@kpc.com (Steve Hollasch) writes:
>     Polyhedron intersection has both trivial accept and trivial reject
> conditions.  Let P and Q be two polyhedra, and let Pc and Qc be some
> arbitrary "center" of the polyhedron.  Then let Prmin & Qrmin be the
> minimum distance from the center to any of the vertices of the polyhedra,
> and Prmax & Qrmax be the maximum distances from the polyhedra centers to any
> vertex on the corresponding polyhedra.
>
>    Trivial Reject:  |Pc - Qc| > (Prmax + Qrmax)
>
>    Trivial Accept:  |Pc - Qc| < (Prmin + Qrmin)
>
>     If neither of these tests succeed, then you must test each vertex of P
> to see if it lies within Q, and then you have to test each vertex of Q to
> determine if it lies within P.

sloan@cis.uab.edu (Kenneth Sloan) writes:
| Even for simple polyhedra, is it not possible for two polyhedra to
| intersect even though your Trivial Reject fails, your Trivial Accept
| fails, and no vertex lies INSIDE the other polyhedron?  I believe that
| you must also test all edges for intersection with all faces of the
| other polyhedron or triangulate (tetrahedralize) and test all tetrahedra
| in one polyhedron against all tetrahedra in the other..  Testing
| vertices works for polygons - but polyhedra are tougher.

    No, the trivial reject is sufficient.  It's basically a test to see if
the bounding spheres can intersect.  If the bounding spheres cannot
intersect, then the objects themselves cannot.

    The trivial accept doesn't work though.  Not for the reason you mention,
but because it doesn't properly handle concave polyhedra (e.g. a cylinder
passing through the hole of a torus).  If it's easy to break the polyhedron
into convex components, then this test should work, provided that you are
testing for volume (not just surface) intersection.  This is because an
object wholly enclosed in another object is an intersection of volumes but
not of surfaces.

    With respect to rigorous (as opposed to trivial) intersection, I really
just sort of kind of tossed out the vertex containment test without giving
it a great deal of thought.  I now agree that edge-face intersection must
also be considered.  In order to test this, I propose we hold a contest ...

    B^)

______________________________________________________________________________
Steve Hollasch                                   Kubota Pacific Computer, Inc.
hollasch@kpc.com                                 Santa Clara, California
Organization: Penn State University
Date: Tue, 10 Nov 1992 12:38:44 EST
From: <GNR100@psuvm.psu.edu>
Newsgroups: comp.graphics
Subject: MPEG (what haapened to the new drivers for dos?)


        Some time back, I saw a post stating that Xing Technologies
is working on a new version of MPEGXING  for DOS that includes more drivers.
I was just wondering if anyone knows how close that is to being released.
Alos, if anybody wants to see the origiona artical, Email me + I will send it.
                                               Gordon Rogers
                                               gnr100@psuvm.psu.edu
     Please respond via Email, as I do not often read this group.
From: werner@aero.org (Michael F. Werner)
Newsgroups: comp.graphics
Subject: Posters From Image Files
Date: 10 Nov 1992 00:36:52 GMT
Organization: The Aerospace Corporation, El Segundo, CA
Distribution: la
NNTP-Posting-Host: aerospace.aero.org
Summary: Where Can I Get It Done In Los Angeles?

    Can anyone recommend a service in the Los Angeles area that could generate
a high quality negative or transparency from an image file?  The final objective
is to make prints from 8 by 10 inches up to poster size.

    I have done this before by generating a large image file (on SGI hardware
with Wavefront Software), dumping it onto a tape, which was then shipped
to Hanaway Associates in Colorado.  They returned a good quality 4 by 5 inch
transparency.  The problem was that it cost a lot ($150), and we had to go
through 2 iterations to get a satisfactory transparency.

    I would rather do it locally and cheaper!  Anyway done this sort of thing
in L.A. for less than $150?

Thanks, mfw
-- 
 Michael F. Werner           |   Flight Dynamics Department
                             |   The Aerospace Corporation
 werner@aerospace.aero.org   |   El Segundo, California, USA  (near Los Angeles)
Newsgroups: comp.graphics
Subject: Re: fading in and out a VGA picture
From: traal@lopez.marquette.MI.US (Brian Phillips)
Date: Thu, 5 Nov 1992 12:05:34 EST
Organization: Great White North/UPLink

A couple of people in various articles have written, to effect:

  --To fade in/out, you need a timed loop which successively reduces/
    increases the intensity of the RGB values by 1/64th the distance
    between the starting color and zero (or the reciprocal of that if
    you are fading in).

  --There is a problem with the timing/appearance if it is linear in
    nature.  And, "if you have a parameter  0 <= t <= 1 for a scalar,
    try replacing it with t' = t ^ k, where 1 <= k <= 2."  1.5 has
    been suggested as a good value for k.

Does someone have a simple example of these feats?  Preferrably in ASM or
C (most likely ASM)?



  --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
Newsgroups: comp.graphics
From: ara@wam.umd.edu (Ford Prefect)
Subject: Truman's Torus Generator
Organization: University of Maryland, College Park
Date: Wed, 11 Nov 1992 01:18:24 GMT

HI
any one know where I can get Truman's Torus Generator ?
-ara

Newsgroups: comp.graphics
From: alee@chimera.UWaterloo.ca (A. Lee)
Subject: Screen Capture Programs
Organization: University of Waterloo
Date: Sun, 8 Nov 1992 01:19:24 GMT

Does anybody have any info on a screen capture program which will capture a  
text screen and dump it to a graphics file (like a tiff or gif).

Please respond to MIMIC@SYSTEMS.WATSTAR.WATERLOO.EDU

Thanks,

Alex Lee
Project MIMIC
Newsgroups: comp.graphics,sci.image.processing
From: IMAGING.CLUB@OFFICE.WANG.COM ("Imaging Club")
Subject: Re: Agfa Arcus Flatbed Scanner
Organization: Mail to News Gateway at Wang Labs
Date: Mon, 9 Nov 1992 18:31:56 GMT

This month's Imaging mag Vol 1, # 9 has a profile of all the major scanners
available from high speed to 24 bit colour.

I recommend you get a copy as it is the most up to date reference guide I have
seen so far.

Regards Dave Allcock
From: cf@fokus.gmd.de (C. Fuhrhop)
Newsgroups: comp.graphics
Subject: Algorithm for cell counting?
Keywords: Computer vision
Date: 5 Nov 92 13:03:36 GMT
Organization: GMD-Fokus (Berlin)

Someone asked me about algorithms / available software to count
the number of yeast cells in a sample. He has a setup that allows
him to put a sample under a microscope and digitize the picture.
He is looking for either commercial software or published algorithms
that allow give him the number of cells in the picture.

I assume that this is an fairly old computer vision problem and has
probably applied to the counting of blood cells before, but since
this isn't my normal line of work, I don't know were to look.

Any pointers in the right direction are highly appreciated.

Thanks!

Christian Fuhrhop
fuhrhop@fokus.berlin.gmd.dbp.de
Newsgroups: comp.graphics
Subject: Re: Problems with 3D studio
From: djlewis@ualr.edu
Date: 12 Nov 92 17:09:40 GMT
Organization: University of Arkansas at Little Rock

In article <1992Nov4.064838.12294@tpts1.seed.net.tw>, idpt249@tpts1.seed.net.tw writes:
> Hello, folks:
> I met a problem when doing animations with 3D studio R2. The fact is that
> my PC reboots automatically without any error message when rendering is in
> progress and almost done.  I tried to use different Pcs,  but problem 
> remains.  Here's my environment:
> 486-66 PC with 32Mb Ram
> ET4000 VGA driven by RCPADI
> Shading: Phong
> Anti-alias: High
> Atmosphere: D-Cue
> The problem might be in the spot lights.  I have 14 spot lights casting      
> shadows and 35000 faces.  If I turned off 4 shadows of these 14 lights, 
> it works.  Can anyone tell me ehy is that?  Is there any limitation to 
> this package.  Thanks in adv.
> Please reply to idpt249@tpts1.seed.net.tw
> Neil Chou
> Sinotech Engineering Consultants, Inc. TAIWAN
> 
I don't have your answer, BUT another great loss is that 3DS won't do 
reflective ( mirror like) surfaces. At least I havn't found the trick. ..
djlewis@ualr.edu

Newsgroups: comp.graphics
From: gelinas@CAM.ORG (Daniel Gelinas)
Subject: Drawing in the background.
Summary: Drawing in the background
Organization: Communications Accessibles Montreal, Quebec Canada
Date: Sun, 8 Nov 1992 22:22:18 GMT

I was wondering if any of guys guys could help me out with something 
that I would like to try.  The goal of my program( in C) is to draw
4 laser beams(one from each corner of the screen) shooting out and
spelling a word.  My only problem is when I try to do this normally
I have to use 1 function to draw a line in green, and then I use the
same function to draw another line in black.  This way the laser beam
s can move around.  That's all fine and dandy but it won't work with
4 laser beams because when I write over them in black it also writes
of everything else on the screen.
 
I've figered out that to fix this, I can use the different graphics pages
and switch between them, having the writting(or product of the beams) on
one page, and the beams on the next.  But I need to get an efficient 
routine that will do this with very little 'flicker' when switching. 

I would GREATLY appreciate any help I can get.

btw: Is there another news group I could post this to if this is not the
right one?

Daniel Gelinas
gelinas@altitude.cam.orgg
From: flow@gayakum.kaist.ac.kr (Paek In-Hyeok)
Newsgroups: comp.graphics
Subject: Random generation of simple polygons
Date: 9 Nov 92 12:34:17 GMT
Organization: TC lab. CS Dept. KAIST


Hi!
I'm looking for papers, source code, or refernces to random
generation of simple polygons.
If anyone could e-mail me, I would greatly appreciate.

				Thanks in advance,
				Paek Inhyeok

e-mail:   flow@gayakum.kaist.ac.kr or flow@jupiter.kaist.ac.kr
Newsgroups: comp.graphics