HDTenEightyP/NetNews huggingface dataset:
From: mwgst1+@pitt.edu (Michael W Groff)
Newsgroups: comp.graphics.explorer
Subject: import 3D scalar data into explorer
Date: 12 Nov 92 21:05:58 GMT
Organization: University of Pittsburgh
Originator: mwgst1@unixd1.cis.pitt.edu

Is there an explorer module out there that will let me import a
3D scalar data set into my explorer map?

If not maybe you can help me write my own.  I'm using DataScribe
to create a module that will read in my data set (actually MRI
images 256x256x124, 1 byte deep).

The problem is in my out Template.  It is of type "explorer" with a 
3D Uniform lattice.  When I try to put the dimension of the data set
into dims1, I can't because the dims1 vector is only one dimensional.

What am I missing?

michael groff
mwg@med.pitt.edu
-- 
michael groff
Medical Student
mwg@med.pitt.edu
Newsgroups: comp.graphics.explorer
From: lferjo@gfx.engga.uwo.ca (Lisa Ferjo)
Subject: bhelp with explorerB[C[C  
Organization: University of Western Ontario, London
Date: Tue, 10 Nov 1992 22:10:44 GMT

I am a fourth year engineering student.  Eventually I will be 
mapping collagen fibre orientation ont a 3d model of a heartvalve. 
The orientation data is in the form of a histogram.  The horizontal
axis is from 0 to 180 degrees.  The veritcal axis is the number of 
collegen fibres. I have histograms for various points on the 
heartvalve.

I have read the users manual and the man descriptions of the
modules.  I also have the module writers guide.  I also have read
some of the info at ftp sites (139.88.54.33)

I have tried using explorer but without sucess.  I have tried doing 
doing simple examples such as creating a 3d data file and trying
to get an image using explorer. I have created a data file 
(xcord,ycordin,zcord,value) that looks like this.
10
10 11 12 1000
20 21 22 2000
30 31 32 3000
.  .  .  .
.  .  .  .
.  .  .  .
100 101 102 10000

I then went to dscribe and created an input template with a vector
glyph with n=10 and an 3d array glyph with n1=10,n2=10,n3=10. I
then created and ouput template. I tried all the differet types of 
3d lattices and I let nDataVar=1.  I used this module in the map 
editor and I connected it to VolumetoGeom and then to render.  I 
did not get an output.

I would appreciate simple examples of how to input images
such as the coordinates of a cube and then how to map 2d arrays
onto specific points on a cube.

Also, how do you pick which modules to use.  I have read the man
pages on them but it does not seem much help

Lisa Ferjo
From: gt3021b@prism.gatech.EDU (Eric Zundel Ayers)
Newsgroups: comp.graphics.explorer
Subject: Re: Module won't compile
Date: 9 Nov 92 16:53:05 GMT
Organization: Georgia Institute of Technology

>I am building a module using the module builder, and whenever I try

>to build the module (or make it)  I get the following output, and obviously,
>an unsuccessful compilation:
>
>--- Format_to_Lattice.mdw.o ---
>	/usr/explorer/lib/cxMdw Format_to_Lattice
>--- dformat_module.o ---
>	rm -f dformat_module.o dformat_module.os  && cc -c -g -prototypes -cckr -float     -I/usr/explorer/include -I/usr/src/apps/explorer/sys/include -I/usr/include -DSYSV -DMALLOC_0_RETURNS_NULL -DFUNCPROTO -DNARROWPROTO    dformat_module.c  && ld -r dformat_module.o -o dformat_module.os  && mv dformat_module.os dformat_module.o
>--- Format_to_Lattice.mdw.o ---
>sh: 475 Bus error - core dumped
>*** Error code 138
>
>

Also, I have discovered something peculiar about the code generated by the
module builder.  I have a file in my directory named 
"Format_to_Lattice.mdw.c" which ends rather abruptly:

 
$tail Format_to_Lattice.mdw.c
  if (1 && !cxP_In_End_Variable) {
    end_var = NULL;
    cxMDWIfCoerce[8] = FALSE;
  }
  else {
  end_var = (cxParameter  *) cxP_In_End_Variable;
  }
  /* Assigning constant User Function variables. */
  /* Assigning whether data has changed to User Function variables. */
  /* Allocation of User Function variables. */
  atom_lattice = (cxLattice    * *) cxDataMalloc( ( s$


Any ideas?
-- 
                                   \\||//
Eric Zundel Ayers		   +----+
Georgia Institute of Technology    |----|         College of Architecture
gt3021b@prism.gatech.edu 	   +----+    Home of the House of Suicide
Newsgroups: comp.graphics.explorer
From: jhp@photon.com (Jim Patterson)
Subject: Re: Can I set file browser widget?
Reply-To: jhp@photon.com
Organization: Photon Research Associates, Inc.
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 9 Nov 1992 16:29:49 GMT

John Hagedorn (hagedorn@betsy.gsfc.nasa.gov) wrote:
: 
: Is there a way of setting the selection of a file browser widget from
: my program?  On module initialization, I want to set the directory to
: the current working directory.  I have tried this code:
: 
: store_frames_init ()
:         {
:         char curr_dir[256];
: 
:         if ( getcwd (curr_dir, 256) == NULL)
:                 {
:                 return -1;
:                 }
: 
:         strcat (curr_dir, "/*");

I think the problem is adding the * to the end of the directory.  The
explorer widget doesn't know how to deal with the wildcard.  I have
successfully set the directory by using "./".

Hope this helps,

Jim
--

-- 
James Patterson	             photon!jhp@ucsd.edu      jhp@photon.com
Photon Research Associates   619-455-9741 (voice)     619-546-3903 (fax)
"... three great virtues of a programmer: laziness,impatience and hubris "
     Larry Wall in _Programming Perl_
Newsgroups: comp.graphics
From: edwarda@yoyo.cc.monash.edu.au (Edward Au)
Subject: References in Siggraph Proceedings'92
Organization: Monash General Access UNIX System
Date: Thu, 5 Nov 1992 15:44:43 GMT

I need the page numbers of the following papers as they appear in
the Siggraph Proceedings '92 (which I don't have access to):

* "Featured Based Image Metamorphosis"
  Thaddeus Beir and Shawn Neely

* "Scheduled Fourier Volume Morphing"
  John F. Hughes

* "A Physically Based Approach to 2D Shape Blending"
  Thomas Sederberg and Eugene Greenwood

* "Shape Transformation for Polyhedral Objects"
  James R. Kent, Wayne E. Carlson and Richard E. Parent

Thanks in advance,

Edward
-----------------------------------------------------------------------------
email: edwarda@yoyo.cc.monash.edu.au | ASK:
Department of Computer Science       | Ask and you will be given;
Monash University                    | Seek and you will find;
Australia                            | Knock and it will be opened to you.
-----------------------------------------------------------------------------
Newsgroups: comp.graphics
From: sywu@csie.nctu.edu.tw (candle)
Subject: ASCII pictures
Organization: National Chiao Tung University
X-Newsreader: TIN [version 1.1 PL6]
Date: Sat, 7 Nov 1992 18:28:06 GMT


     I'm interested in ASCII pictures.  Some of them are really wonderful.
I got the ascgif from a nice guy.  It translates the gif file to ascii.
But it's not as good as I think.  Not really like the original one.  And
I've heard there's a software called "The draw", it can let us draw ascii
pictures easily.  And I know it's a PD.  So if anyone knows the ftp site 
to get it,  please tell me or send one to me.  Thanks in advance!

                                      Xian-Yow Wu

P.S.   BTW, does anyone know ftp sites of these beautiful ascii pictures
From: ywang1@husc8.harvard.edu (Yongkang Wang)
Newsgroups: comp.graphics
Subject: Help Wanted: Book of Sample Letterhead Stationery?
Date: 7 Nov 92 23:55:36 GMT
Article-I.D.: husc3.1992Nov7.185537.17211
Distribution: world
Organization: Harvard University Science Center

Hi,

I need to design letterhead stationery and envelope for a newly-found
non-profit organization.   I wonder if there is any such book that shows 
sample letterhead stationery and envelopes.   Knowledgable people, 
please Email me.  Thank you in advance. 

Regards
From: davei@comp.lancs.ac.uk (Mr D Ingles)
Newsgroups: comp.graphics
Subject: Re: Animation using gif or jpeg files. Conversion to .gl or .fli?
Date: 5 Nov 92 21:40:02 GMT
Organization: Department of Computing at Lancaster University, UK.

In article <1992Nov5.145446.2270@sol.ctr.columbia.edu> anselmo@cumesb.mech.columbia.edu (Andrew P. Anselmo) writes:

>I'm vaguely aware of some stuff like xgrasp and xflick, which show
>.gl and .fli files, which show some good animation.  Is there anyway for
>me to take a group of files, and put them together in this format for 
>animation purposes?  Thanks.

There is a program called 'dta' (I think) that can be found amongst some
of the 'pov' ray tracing software that will take a run of .gif's and
merge them into a .fli animation. 


Davei
From: mahlknec@shrike.und.ac.za (Gregory Mahlknecht)
Newsgroups: comp.graphics
Subject: Xsharp
Date: 6 Nov 92 23:14:25 GMT
Article-I.D.: shrike.1deu8hINN6r3
Organization: University of Natal (Durban), South Africa
NNTP-Posting-Host: shrike.und.ac.za
X-Newsreader: Tin 1.1 PL4

Hi,

Try ftp.mv.com in the /pub/ddj/packages directory.  ftp.mv.com is the official
anonymous FTP site for DDJ (I read about it in DDJ, contents page, in the
sidebar "SOURCE CODE AVAILABILITY".  RTFM :-)

  - Greg
Newsgroups: comp.graphics
From: dstewart@kean.ucs.mun.ca
Subject: Re: New stereogram technique
Organization: Memorial University. St.John's Nfld, Canada
Distribution: usa
Date: Fri, 6 Nov 1992 12:43:43 GMT

In article <dalessio.720998995@feldspar28>, dalessio@rtsg.mot.com (Mario D'Alessio) writes:
> In the mail I just received an advertisement from N.E.
> Thing Enterprises, the makers of "Stare-EO", the random dot
> stereogram creator.  On the front is a stereogram of a
> frog. But the cool thing is that when you view the image,
> you can't detect any "layers" in the image.
> 
> Those of you who viewed the stereograms posted here before
> know that the stereograms are created from layers. A sphere
> is actually created of layered circles which can be easily
> detected. With the new technique, you'll see a smooth sphere.
> 
> The ad states that it uses the "Salitsky dot".  Does anyone
> know anything about this? How about a program that uses
> it?
> 
> Thanks.
> 
> Mario
> 
     Random dot stereograms were invented by Bela Julesz at the Bell Labs 
in the late 60's.  From the point of view of theories of vision they were 
significant in that they demonstrated that retinal disparity is a 
sufficient condition for depth perception.  Analysis of the depth effects 
in RDS's contributed to emerging computational theories of vision (see 
Marr's book, _Vision_, for example).  One of the features of RDS's is the 
"smoothness" of contour you speak of.  A very impressive example is 
Julesz's hyperbolic paraboloid surrounded by a torus which was in his book 
and is also in Frisby's _Seeing_.

     Would you post the address for the N.E. Thing people.  I don't know 
what a "Salitsky dot" is>

Dan Stewart.
Newsgroups: comp.graphics
From: joes@lpi.liant.com (Joe Stewart)
Subject: Re: help correcting X-PHIGS source code
Reply-To: joes@lpi.liant.com
Organization: LIANT Software Corporation
Date: Wed, 11 Nov 1992 14:16:43 GMT

In article <1dlq1pINNamt@iraul1.ira.uka.de>, mul@ira.uka.de (Peter Mul) writes:
|> Keywords: Graphik source code, PEX/Phigs, X-Visual selection, Colormaps
|> 
|> Hey!
|> 
|> I have a problem getting the right visual and colors for my application.
|> I wrote a Graphiktool to display Robotcells on an Evans & Sutherland
|> ESV 30 system, using PEX/PHIGS. Everything OK. I get as default a 24bit
|> visual with the right colors.
|>  
|> Then I tried to get it running on a SUN workstation. At that moment the
|> problem arised.
|> 
|> I used Sunphigs2.0 and Motif.
|> The problem is that my application gets a Pseudocolor visual as my default
|> visual, with unpredictable Colormaps.

You've hit one of the many PHIGS portability issues....  My advice?  Get
Liant's FIGARO+.  FIGARO+ is Liant's implementation of the ISO/ANSI
PHIGS standard which we've ported everywhere (it seems).  Source code is
totally portable, requiring only a recompile and relink.  With respect
to X integration issues, we've been doing PHIGS on top of X since 1988/89
while FIGARO+ has been evolving since 1985.  

Anyway, if you want the usual marketing literature, send a note to
info@liant.com.

If you have technical questions, send them to me, joes@lpi.liant.com.

Joe
-- 
---------------------------------------------------------------------
 Joseph Stewart
 Senior Applications Engineer (FIGARO+, FIGt, FIGraph)
 Liant Software Corporation
 959 Concord Street 
 Framingham MA 01701-4613 (USA)
 508-872-8700 x340
 joes@lpi.liant.com -- {uunet,necntc,drilex}!lpi!joes
---------------------------------------------------------------------
Newsgroups: comp.graphics
From: grossnik@iam.unibe.ch (Bruno Grossniklaus)
Subject: Re: Looking for popularity + median-cut
Keywords: quantisation, median, popularity, octree, uniform	
Reply-To: grossnik@iam.unibe.ch
Organization: Dept. of CS, University of Berne, Switzerland
Date: Fri, 13 Nov 1992 14:54:25 GMT

>In article 1dvts2INNpg6@iraul1.ira.uka.de, weinga@i31s25.ira.uka.de (Tim Weingaertner) writes:
>Hi,
>
>I' m looking for a popularity algorithm and a median-cut algorithm for 
>color quantization. 
>
>Could someone post me one or tell me were to find one.

Hi Tim

Try ftp iamsun

In /Graphics there is the file convert_32_to_8.tar.Z

Median-cut, octree, popularity and uniform algorithms are 
implemented.

I/O handling is only for sun rasterfiles and MTV format.


PS:
Is your e-mail port (weinga@i31s25.ira.uka.de) wrong?
<MAILER-DAEMON@ixgate.gmd.de> says: User unknown

bye bye


///  Bruno Grossniklaus  | Universitaet Bern
o-o  Niesenweg 3         | IAM 
 |   3138 Uetendorf      | Laenggassstr. 51
 -   Schweiz             | 3012 Bern
                      Europe
               grossnik@iam.unibe.ch




Newsgroups: comp.graphics
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: polyhedron/polyhedron intersection
Keywords: maximum volume inscribed convex polyhedron
Organization: Smith College, Northampton, MA, US
Date: Fri, 13 Nov 1992 02:35:48 GMT

In article <1992Nov12.161117.24398@cs.wisc.edu> seitz@cs.wisc.edu (Steve Seitz) writes:
>In article <1992Nov12.091352.5323@leland.Stanford.EDU>, ledwards@leland.Stanford.EDU (Laurence James Edwards) writes:
>|> 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.
>|> 
>|> Interesting question ... well it would seem that you'd have to split the
>|> polyhedra with planes containing each concave edge. 
>
>I don't think this will work in general (if I understand you correctly).
>Try it with this example:
>                                ____________________
>                                |                   |
>                                |                   |
> minute sharp indentation -->   >                   |  
>                                |                   |
>                                |___________________|
> 

Yes, I agree.  But this raises an interesting question.  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.
From: thomas@kalium.physik.tu-berlin.de (Thomas Hensel)
Newsgroups: comp.graphics
Subject: Wanted: hpgl to anything !!!
Date: 9 Nov 1992 16:07:34 GMT
Organization: ZRZ/TU-Berlin
Reply-To: thomas@kalium.physik.tu-berlin.de
NNTP-Posting-Host: kalium.physik.tu-berlin.de
Keywords: hpgl, conversion, bitmaps

Hello !

Are there any hpgl to bitmap converter available ?
Any hints where I can find them ?

Thanx,
Thomas
Newsgroups: comp.graphics
From: werner@aero.org (Michael F. Werner)
Newsgroups: comp.graphics
Subject: Re: Pipeline computation estimates
Date: 9 Nov 1992 23:32:56 GMT
Organization: The Aerospace Corporation, El Segundo, CA
Distribution: usa
NNTP-Posting-Host: aerospace.aero.org

This is a test posting.
-- 
 Michael F. Werner           |   Flight Dynamics Department
                             |   The Aerospace Corporation
 werner@aerospace.aero.org   |   El Segundo, California, USA  (near Los Angeles)

Newsgroups: comp.graphics
From: bonneau@hyper.hyper.com (Paul Bonneau)
Subject: Re: Graphics display program for displaying graph
Reply-To: bonneau@hyper.UUCP (Paul Bonneau,,)
Organization: HyperCube Inc.
Date: Mon, 9 Nov 1992 17:16:49 GMT

In article <BxB6JF.7p7@csn.org> mayer@teal.csn.org (Mike Mayer) writes:
>hubertc@cory.Berkeley.EDU (Hung-Hsien Hubert Chang) writes:
>: Hi! I wonder if there is a graphics program that enumerate all the 
>: graph with vertices number n. Where can I get it? Preferably 
>: X-window version. Thanks.
>
>Hubert,
>
>Could you be more specific about the type of graph you wish to view?
>An XY line graph, contour plot, or mesh surface?
>
I think the original poster is asking for a combinatorial
program to count the number of graphs (where a graph is a set
of vertices and a set of pairs of vertices) that exist for a
given number of vertices.  Not a graph in the "graphics"
sense 8-).

cheers - Paul.
Newsgroups: comp.graphics
From: oberto@genes.icgeb.trieste.it (Jacques Oberto)
Subject: Is POV optically accurate ?
Organization: ICGEB
Date: Thu, 12 Nov 1992 13:33:17 GMT

I am trying to reproduce one of Newton's experiments with POV.
Would a simulated white light beam hitting a glass prism with the 
right angle be scattered into a rainbow spectrum ? 
Are POV and other ray-tracers optically accurate in that respect ?
Has anybody tested the properties of 'raytraced' light other than
reflection and refraction ?

Any comment appreciated !

Jacques


-- 
Jacques Oberto  <oberto@genes.icgeb.trieste.it>
From: venky@fakir.india.hp.com (Venkatesan (MTL Projects))
Date: Fri, 6 Nov 1992 04:53:12 GMT
Subject: Group 3 Fax m/c & G3bis/G364 Standard
Organization: HP India Software Op., Bangalore
Newsgroups: comp.graphics


  Hello,

  Does anyone have information on Group 3 Fax Machines operating with
  the new standard called G3bis Or G364 ?
  I just came across the name of the std. in a NewsPaper
  and need to know more about that, as I am working in related area.

  Thanks for any Info...

  Venky.
From: dfr@usna.navy.mil (PROF D. Rogers (EAS FAC))
Newsgroups: comp.graphics
Subject: Re: polyhedron/polyhedron intersection
Date: 13 Nov 92 03:58:07 GMT
Organization: U. S. Naval Academy

In article <1992Nov12.184340.21945@kpc.com> hollasch@kpc.com (Steve Hollasch) writes:

!    To date the following people have stated that my originally proposed
!trivial accept and general intersection tests are incorrect:
!
!        Joseph O'Rourke
!        Sam Uselton
!        Ken Sloan
!        Steve Hollasch
!        PROF Dave Rogers

Careful now. Let's get it right. I did not say your algorithm was
wrong. There was no need. Other's had already adequately done so!

Dave Rogers

!        Steve Lamont (honorary member for a good limerick anyway)

!    There's still time to post an article stating that my solutions don't
!work.  Don't delay, post today!
From: spl@pitstop.ucsd.edu (Steve Lamont)
Newsgroups: comp.graphics
Subject: Re: Quickest way to calculate the distance between a point and a line
Keywords: analytic geometry
Date: 13 Nov 92 02:27:18 GMT
Organization: University of Calif., San Diego/Microscopy and Imaging Resource
NNTP-Posting-Host: pitstop.ucsd.edu

In article <BxML0r.II@vuse.vanderbilt.edu> brandon@se.vanderbilt.edu(Brandon S. Dewberry) writes:
>I need the quickest algorithm for calculating the distance between a
>point (x,y) and a line f(x).  I will have an initial distance which will be updated at
>each major time slice.
> [...]
>Does anyone have a reference?

Yep.  Check in the Analytic Geometry section on straight lines in your
CRC Standard Mathematical Tables handbook.  Mine is the 26th Edition
and the formula is on p. 258.  In other handbooks, it'll probably be
on a different page.

For a point P0 to a line through P1 in direction (a,b,c), in C
notation, it's

    deltax = x0 - x1;
    deltay = y0 - y1;
    deltaz = z0 - z1;
    term1 = ( ( deltay * c ) - ( deltaz * b ) );
    term1 *= term1;
    term2 = ( ( deltaz * a ) - ( deltax * c ) );
    term2 *= term2;
    term3 = ( ( deltax * b ) - ( deltay * a ) );
    term3 *= term3;

    distance = sqrt( ( term1 + term2 + term3 ) / 
		    ( ( a * a ) + ( b * b ) + ( c * c ) ) );

P0 is (x0,y0,z0) and P1 is (x1,y1,z1).

							spl

	
      
-- 
Steve Lamont, SciViGuy -- (619) 534-7968 -- spl@szechuan.ucsd.edu
UCSD Microscopy and Imaging Resource/UCSD Med School/La Jolla, CA 92093-0608
"Far out, man"
            - President George Bush, heard in a stump speech on NPR
Newsgroups: comp.graphics
From: icarus@lascar.puc.cl (Edo. Jimenez IIC)
Subject: 3D STUDIO RENDER!
Organization: Pontificia Universidad Catolica de Chile
X-Newsreader: Tin 1.1 PL5
Date: Mon, 9 Nov 1992 16:05:42 GMT


Newsgroups: comp.graphics
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: polyhedron/polyhedron intersection
Keywords: 3d graphics, intersection
Organization: Smith College, Northampton, MA, US
Date: Tue, 10 Nov 1992 22:19:43 GMT

In article <1992Nov10.192804.13981@zip.eecs.umich.edu> katkere@engin.umich.edu writes:
>I am looking for code/ideas for finding if two polyhedrons intersect.

@article{CD
, author =	"B. Chazelle and D. P. Dobkin"
, title =	"Intersection of convex objects in two and three dimensions"
, journal =	"J. ACM"
, volume =	34
, year =	1987
, pages =	"1--27"
}
From: det@phlan.sw.stratus.com (David Toland)
Newsgroups: comp.graphics
Subject: Re: N bit planes/pixel or N bits/pixel?
Date: 10 Nov 92 13:33:11 GMT
Organization: Stratus Computer, Software Engineering
NNTP-Posting-Host: phlan.sw.stratus.com

In article <1dn8rjINNdq3@kitty.ksu.ksu.edu> 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 think it has generally been done for addressability reasons.  A memory
mapped video array with one bit per pixel takes up a smaller address space
than if you spread out the pixel bits into the same address space.  If
you're working with a single color (or bit plane) at a time, you can
latch the value into an orthogonal register and forget it.

Personally, I agree with you.  Having programmed for both types of
adapters, I would FAR rather bank select an area of the picture and
write out pixel values directly than mess around with bit addressing
and bit plane masks!

-- 
det@phlan.sw.stratus.com   |  "Laddie, you'll be needin' something to wash
                           |  that doon with."