HDTenEightyP/NetNews huggingface dataset:
From: douglas@cs.scarolina.edu (David Douglas)
Newsgroups: comp.graphics
Subject: Re: Gnuplot mailing list, gnuplot problem.....
Date: 10 Apr 92 02:35:19 GMT
Organization: USC  Department of Computer Science

govindg@ucunix.san.uc.edu (Girish Govind) writes:

>Hello!
>I have a strange problem with gnuplot 3.0. I have one plot with several
>traces (which are gaussian shaped functions arranged along the axis).
>With anything higher than 17 traces on one plot gnuplot seems to quit
>and it complains about wrong syntax of the plot command (basically it
>seems to only parse a certain number of characters after which it bombs).
>I know that 17 is a pretty large number but I need to be able to put upto
>50 traces on the same plot (no legend or anything just a normal line for all
>of them).

>Can anyone suggest how I could do this? Is there any buffer I need to enlarge
>so that it would parse more characters for each command?

>I have not been able to subscribe to the gnuplot mailing list as both
>the ucbvax.berkeley.edu as well as the sun.com machines are sending back my
>subscription request (that info-gnuplot-request is an unknown user). Can
>someone tell me what to do?

>Thank you very much.

>-- Girish Govind
>   (govindg@ucunix.san.uc.edu)

If the problem is one of insufficient space in storing the input command, you
might look in the  plot.h  file, at line 65 (at least that's where this is
in the  plot.h  file here for Gnuplot 3.0):

#define MAX_LINE_LEN 1024       /* maximum number of chars allowed on line */
#define MAX_TOKENS 200
#define MAX_ID_LEN 50           /* max length of an identifier */


#define MAX_AT_LEN 150          /* max number of entries in action table */


Try upping the value of one or more of the above constants, then re-compiling.

Hope this helps!


|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
|  David Douglas                              |
|  Graduate Computer Science program          |
|  University of South Carolina               |
|  Columbia, S.C.  29208                      |
|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
|  E-mail:  douglas@usceast.cs.scarolina.edu  |
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
From: gilles@cannes.Eng.Sun.COM (Patrick-Gilles Maillot)
Newsgroups: comp.graphics
Subject: InterPhong shading method
Date: 13 Apr 92 18:20:06 GMT
Organization: Sun Microsystems, Mt. View, Ca.
NNTP-Posting-Host: cannes

Hi,

In their book "Synthetic Actors" (Springer Verlag), N. & D. Thalmann mention
a fast shading technique called InterPhong, giving near-Phong shading quality.
I would like to know if any paper has or will be released, explaining what the
method consists of.

Please reply by email: patrick.maillot@sun.com

Thanks,

-Patrick
From: ph_su@csd.brispoly.ac.uk (J.B. the Frog!)
Newsgroups: comp.graphics
Subject: Setting a grey-scale palette
Date: 14 Apr 92 10:21:52 GMT
Organization: Bristol Polytechnic, England

Hi dearly netters,

I have read an article about setting a grey-scale palette
using Turbo Pascal's procedure setRGBPalette. 
Unfortunately, I'm using Turbo C and I don't have
this function in the graphic library. Is there
a way, whether to get this function, or to set a
16 grey-scale palette using the usual C functions.

Thanx a lot for any answers,

JB
-- 
JB (Jean-Baptiste)
<================>
-----------------------------------------------------------
" A *kiss* is that little rosy dot over the "i" of Loving "
From: renzo@argo.sublink.org (Renzo Tomaselli)
Newsgroups: comp.graphics
Subject: TIFF IFDs interpretation.
Keywords: TIFF document-retrieval
Date: 9 Apr 92 07:24:43 GMT
Organization: TecnoTP snc  Pergine (TN - Italy)


Hi folks,
    I'm asking for some help about how to interpret a generic TIFF file when
several IFDs appear and they are supposed to represent a complex document
structure.
According to specs 5.0/6.0, it seems that a generic TIFF file could represent
(in a top-down description):


- multiple unrelated documents;

- each document can be constituted of several pages linked by a pageNumber
  tag;

- each page can be constituted of several patches with they own placement
  defined by x,y position tags;

- each patch can have multiple overlapped instances as defined by the
  newSubFileType tag (normal/transparency mask/reduced resolution);

- each patch instance can have a complex internal structure (strips/tiles,
  orientation, multibit architecture).

It appears that newSubFileTag and pageNumber tags are the only interdirectory
tags; however their values can easily lead to inconsistencies within the
overall structure.
The question is: could anyone suggest a strategy for interpreting a generic
input IFD list ? (e.g. a TIFF file -> tree-structure mapping).
Or, on the contrary, how a complex structure (multidocument/multipage with
possibly multiple faces of the same page) should correctly represented by
a IFD list and related tag contents ?
The new draft 6.0 specs don't help much; they are almost related to internals
of the bottom layer within the above structure.

Thanks,

                                                    Renzo Tomaselli

       ---------------------------------------------------------------
         TecnoTP s.n.c. Special Information System Design
         Via Paludi, 52  I38057 Pergine Valsugana  Trento TN  ITALY
         Tel./Fax. +39 461 533629    e-mail: renzo@argo.sublink.org
       ---------------------------------------------------------------
Newsgroups: comp.graphics
From: aoad354@chpc.utexas.edu (Jim Xu)
Subject: Color graphic program of display wind vector wanted
Organization: The University of Texas System - CHPC
Date: Wed, 8 Apr 92 22:52:59 GMT

We are currently working on a project of surface wind. I want to 
know if there are some software to colorfully display the wind vector (both
magnitude and direction) vs ftp. Any system is ok.

Thanks in advanc.

Jim
Center for Space Research
The University of Texas at Austin
From: jfoy@glia.biostr.washington.edu (Jeff Foy)
Newsgroups: comp.graphics
Subject: PBMPLUS for 8088 wanted but...
Date: 10 Apr 92 19:39:37 GMT
Article-I.D.: glia.jfoy.702934777
Organization: University of Washington

The but is that if you have it (source) in MSC 6 (or compatible) format,
I'd like a copy to port back to the 8088. (Don't tell me it can't be
done... I have gcc almost working there now...)

Jeff

-- 
Jeffery Foy
c/o Jiffy Software            jfoy@glia.biostr.washington.edu
14509-8th N.E.
Seattle, WA 98155-6945
Newsgroups: comp.graphics
From: harti@mikro.ee.tu-berlin.de (Stefan Hartmann)
Subject: Re: TSENG 4000 and 3DStudio don't mix
Organization: ZRZ/TU-Berlin
Distribution: tub
Date: Mon, 13 Apr 1992 18:27:42 GMT

In <4765@umriscc.isc.umr.edu> dshipley@cs.umr.edu (Dan Shipley) writes:

>Hi, all!

>I have a TSENG-4000 based board called the Helios HiRez 1280.  It supports  
>1280x1024 in 16 colors NON-INTERLACED.  I am having problems getting  
>3D-Studio to work with it.  When I start up 3D-Studio, everything works, but  
>my computer acts like it switched down to 1MHz or something... you can watch  
>the characters being drawn up on the screen!  I only have this problem with  
>3D-Studio.  None of my other software exhibits this problem.  Also, there  
>seems to be a LOT of hard disk activity while this is going on (like memory  
>paging).  I have a 33MHz 486 with 8 megs of RAM and a 240 Mb hard-drive  
>(Quantum with a 256K on board cache) and a Colorado 250 Mb tape backup.

>Thanks in advance for any help...

>Dan
>--
>*****************************************************************************
>   dshipley at cs.umr.edu
>or r092592  at apollo.civil.umr.edu     (The University of Missouri - Rolla)
>or dan      at ee.umr.edu                    UMR ... The BLACK HOLE !!!
>***************************************************************************** 
>!

Hi,
just disable all the HIMEM.sys and EMM386.sys drivers in your config.sys !

3D-Studio is a protected mode program and is runs at best when there is no
other memory manager !

By the way, how do they produce a ET4000 based NON-Interlaced board at
1280x1024 ?
I only saw interlaced board at this resolution. Is there a new RAMDAC
out that can handle higher pixel-frequencies ?
What horizontal and vertically scanning frequencies does the card produce in
1280x1024 non-interlace ??

Best regards, Stefan Hartmann,c/o Workshop for
Decentral Energy Research
email to: leo@zelator.in-berlin.de


Newsgroups: comp.graphics
From: smithl@marsh.cs.curtin.edu.au (Leigh Smith)
Subject: refs reqd: Clipping lines to concave polygons
Summary: After algorithms or references for clipping lines to concave polygons
Keywords: Clip Polygon Concave
Organization: Curtin University of Technology
Date: Wed, 8 Apr 1992 15:32:13 GMT


Does anyone have a clipping algorithm to clip
line segments against a concave polygonal boundary? I know of
the Cyrus-Beck algorithm, but this only handles convex polygons.
I have designed an algorithm which uses the odd number of
intersections test, but was wondering what literature existed?

Please reply to leigh@psychok.DIALix.oz.au,

Thanks in advance

Leigh
--
+----------------------------------------------------------------+
| Leigh Smith               Reply to: leigh@psychok.DIALix.oz.au | 
| c/o GS Corporation Pty Ltd       smithl@marsh.cs.curtin.edu.au |
| Ground Floor, 1110 Hay Street              Fax: +61-9-481-5637 |
| West Perth,                            Tel (W): +61-9-481-3022 |
| Western Australia 6005                 Tel (H): +61-9-450-2014 |
+----------------------------------------------------------------+
Newsgroups: comp.graphics
From: spencer@med.umich.edu (Spencer W. Thomas)
Subject: Re: colour dithering
Organization: University of Michigan HSITN
Date: Mon, 13 Apr 1992 16:53:15 GMT

There are some good articles on this process in the two Graphics Gems
books.  In particular, Graphics Gems II contains "Color Dithering",
which describes the dithering process in general for color, and
"Mapping RGB Triples onto 16 Distinct Values".

The Graphics Gems books are published by Academic Press, and should be
on any graphics programmer's shelf.  (Besides, I get a dime for each
copy of Graphics Gems II sold.  But I'm not biased, no indeed. :-)

--
=Spencer W. Thomas 		HSITN, U of Michigan, Ann Arbor, MI 48109
spencer.thomas@med.umich.edu	313-747-2778
From: olson@anchor.esd.sgi.com (Dave Olson)
Newsgroups: comp.graphics
Subject: Re: SGI IRIX 4.0
Date: 12 Apr 92 06:25:02 GMT
Organization: Silicon Graphics, Inc.  Mountain View, CA

In <1992Apr9.010754.9374@aero.org> werner@aero.org (Michael F. Werner) writes:


|     What's the story with SGI's version 4.0 of IRIX?  I haven't installed it on
| my system yet.  I heard today that there are major bugs with it and that another
| version (4.1?) is being readied for release which will fix the bugs.  Has anyone
| else found major bugs with 4.0?  Should I not even bother installing 4.0 and 
| just wait for 4.1 to come out?

4.0 was initial shipment for Indigo and Skywriter.  Don't install
4.0 EOE (bundled stuff).  Install 4.0.1 or later.

There were no *major* (in the sense of crippling the system for
large numbers of people) in 4.0, but like any major new release,
it wasn't completely bug free...

--
Let no one tell me that silence gives consent,  |   Dave Olson
because whoever is silent dissents.             |   Silicon Graphics, Inc.
    Maria Isabel Barreno                        |   olson@sgi.com
From: malcolm@vax.oxford.ac.uk
Newsgroups: comp.graphics
Subject: Re: Looking for CGM format info
Date: 10 Apr 92 08:15:00 GMT
Organization: Oxford University VAXcluster

In article <1992Apr7.172518.824@desire.wright.edu>, peppy@desire.wright.edu writes:
> 	I am looking for a detailed description of CGM file
> 	format.  Could anyone out there point me in the right
> 	direction?  Any info would be appreciated.

Two books (among many):

Arnold, D.B. and Bono, P.R.
CGM and CGI
Springer-Verlag, 1988

Henderson, L.R. and Mumford, A.M.
The Computer Graphics Metafile
Butterworths, 1990

Arnold and Bono has about 50 pages that make a better starting read on CGM than
the standard. Henderson and Mumford is about 400 pages.

-------------------------------------------------------------------------------
Malcolm Austen,                                          Tel: 0(+44) 865 273216
Oxford University Computing Services,                    Fax: 0(+44) 865 273275
13 Banbury Road,                        Email - JANET: malcolm@uk.ac.oxford.vax
Oxford, OX2 6NN                    EARN/BITNET: malcolm%uk.ac.oxford.vax@ukacrl
England                   Internet: malcolm%vax.oxford.ac.uk@nsfnet-relay.ac.uk
-------------------------------------------------------------------------------
From: lusardi@acsu.buffalo.edu (Christopher Lusardi)
Newsgroups: comp.graphics
Subject: Re: Integer Cosine Transform for JPEG
Keywords: DCT ICT image compression
Date: 15 Apr 92 17:53:31 GMT
Organization: State University of New York at Buffalo/Comp Sci

In article <1992Apr15.020448.19525@cc.gatech.edu> jack@multimedia.gatech.edu (Tom Rodriguez) writes:
>
>	I've implemented the Integer Cosine Transform for use with the
>PD JPEG implementation but i'm having trouble producing an equivalent
>inverse transform.  I'm operating on the assumption that i can derive
>the inverse transform by inverting the matrix and applying a suitable
>scaling factor to the final result.  Am I off in space?  Would anyone
>know of a paper on this topic?  I've looked around but can't find any
>that discuss the Inverse ICT.  I'd appreciate any help.
>
>	For those interested, the paper I'm using for the ICT is by
>F.S. Wu and W.K. Cham, "A comparison of error behaviour in the
>implementation of the DCT and the ICT", from IEEE TENCON '90.  It
>resulted in about a 2 times speed up of the JPEG compression and a
>very slight but consistent improvement in compression, on the order of
>2%.  The approximate MSE as compared with the DCT code distributed
>with the PD JPEG code was 1.
>
>	tom
>
>--
>Tom Rodriguez  (jack@cc.gatech.edu)
>Multimedia Computing Group - GVU Lab
>Georgia Institute of Technology
>Atlanta, Georgia 30332-0280

Your references isn't in my campus library. IEEE TENCON '90 is "Trends in
Electronics Conference". It's available from the University of Iowa, and
the University of California at Santa Barbara. 

Anyone can get this article through interdisciplinary loan.
-- 
Christopher M. Lusardi     University At Buffalo     lusardi@acsu.buffalo.edu
From: eric@pencom.com
Newsgroups: comp.graphics
Subject: Re: white noise
Date: 16 Apr 92 13:46:46 GMT
Organization: Pencom Software

In article <1992Apr15.170617.10269@julian.uwo.ca> Burgess) writes:
> In article <32746@darkstar.ucsc.edu> gil@cse.ucsc.edu (Gil Fuchs   (408)  
> 429-9224) writes:
> > howdi net,
> > 
> > what is the formula (mu, sigma, and other fellars) for white noise?
> > why is it called white?  are there other colors (brown, pink, et al.)?

I have heard of brown noise.  It is the sort of noise you want
when generating, say, fractal mountains.
From: canderso@cvbnet.prime.com (Chris Anderson 4-1660 x??)
Newsgroups: comp.graphics
Subject: Distributing points on a sphere
Summary: Given n points, how to get equal spherical distribution
Date: 8 Apr 92 14:00:25 GMT
Reply-To: canderso@cvbnet.prime.com.UUCP (Chris Anderson 4-1660 x??)


I have a need to distribute a set of n points (where n is generally >> 10)
evenly over the surface of a unit sphere.  My present method generates 
lattitude circles and divides the points among them in a simple-minded
way, such that I nearly always end up with uneven spacing and/or an
"incomplete" sphere.

My desire is to have a set of coordinates for points on the sphere
surface with equidistant spacing and full "coverage", regardless of
the value of n.  Is this a problem that someone else has already
solved in an elegant way?

Thanks for any help.

Regards,

---Chris Anderson.
From: sloan@cis.uab.edu (Kenneth Sloan)
Newsgroups: comp.graphics
Subject: Re: Distributing Points on a Sphere
Date: 15 Apr 92 02:43:55 GMT
Organization: CIS, University of Alabama at Birmingham

In article <11302@borg.cs.unc.edu> leech@cs.unc.edu (Jon Leech) writes:
>In article <1992Apr10.191350.9921@cis.uab.edu>, sloan@cis.uab.edu (Kenneth Sloan) writes:
>...
>> Actually, for this type of problem, F=MV is a better world to live
>> in.  F=MA gives all sorts of undesirable (for this problem) effects.
>
>    A few more details, please. How do you compute V in this
>physically-nonmotivated equation, for example?

Well, let's see, we started with a "F", and the suggestion that
simulating a world in which F=MA would converge to a stable arrangement
of particles.  I suggested (in an uncharacteristically few words, that
we use F=MV instead.  Details:

    F = MV

so, to calculate V, we use:

    V = F/M

since the original poster specified identical points, then the M's are
identical, and simply a uniform scale factor.  So, we might as well use:

    V = F

perhaps remembering to change "units" as we go.

The use of "correct physics" is not necessarily the best way to get
such systems to converge.  The original poster specified F=MA - using a
physical metaphor for a non-physical problem.  I simply pointed out that
F=MV happens to work better.  The original poster immediately agreed
with me, in this forum.

The point is...point charges constrained on the sphere is only a
metaphor for the original problem.  You *can* solve the problem by
simulating a physical analog to the problem...or you can use a more
efficient computation that doesn't happen to match the physical
metaphor.  

I apologize if my metaphorical phrasing was too obscure...although I'm
comforted by the fact that the original poster understood it.

Undoubtedly, there is a physical analog for the computation I prefer -
and undoubtedly some closet physicist will trot it out.  For me, F=MV
says it all.

If it was good enough for Aristotle.....well, maybe not.



-- 
Kenneth Sloan                   Computer and Information Sciences
sloan@cis.uab.edu               University of Alabama at Birmingham
(205) 934-2213                  115A Campbell Hall, UAB Station 
(205) 934-5473 FAX              Birmingham, AL 35294-1170
Newsgroups: comp.graphics
From: beitel@snake.tc.cornell.edu (David Beitel)
Subject: vertices of 3-D polyhedra
Reply-To: beitel@theory.tn.cornell.edu
Organization: Cornell University
Date: Sun, 12 Apr 1992 22:39:35 GMT


Hi,

I am not sure if I am using the correct notation, but ....

As far as I understand it, there are 6 simple polyhedra that
can be formed in 3-D. They satisfy Euler's formula :

	V - E + F = 2

V = number of vertices
E = number of edges
F = number of faces

The ones that are representable in 3-Space are : 
(I don't know their proper names.)

F = 4	: Tetrahedron	(V = 4, E = 6)
F = 5	: ? (pyramid)	(V = 5, E = 8)
F = 6	: Cube		(V = 8, E = 12)
F = 8	: octahedron	(V = 6, E = 12)
F = 12	: ?
F = 20	: ?

What I am looking for are the coordinates of the vertices for these
polyhedra in 3-space. If you don't know them, but can point me to
a reference book, that would be great.

For example : cube =
(0,0,0) (1,0,0) (0,1,0) (0,0,1) (1,1,0) (1,0,1) (0,1,1) (1,1,1)


Thanks in advance,
David
--
Newsgroups: comp.graphics
From: werner@aero.org (Michael F. Werner)
Subject: Cloudless Earth Image
Organization: The Aerospace Corporation, El Segundo, CA
Distribution: usa
Date: Mon, 6 Apr 1992 15:35:41 GMT


     Is the cloudless earth image in the public domain yet?   Anyone know
how I can get it (free)?  Ideally I would like it in .rgb (Silicon Graphics)
format at around 1000 by 500 pixels resolution.  GIF or TIF formats would be
o.k. too (but not jpg).  Thanks.
-- 

 Michael F. Werner           |   Performance Analysis Department
                             |   The Aerospace Corporation
 werner@aerospace.aero.org   |   El Segundo, California, USA  (near Los Angeles)
Newsgroups: comp.graphics
From: jim@ferkel.ucsb.edu (Jim Lick)
Subject: Re: JPEG viewer for win3.0 and 3.1
Organization: University of California, Santa Barbara
Date: Mon, 13 Apr 1992 23:19:16 GMT

In <9846@bgsuvax.bgsu.edu> sarnold@bgsu.edu (G. Steve Arnold) writes:
>	Besides, have you ever timed a Jpeg to Gif conversion? small ones
>for me can take as long as 3 minutes each. It would be easier just 
>to have a jpeg viewer.

Why do you think this would be any different with a viewer?  A viewer
is just a conversion with a display at the other end, instead of a
file.  Although my system decodes jpegs fairly quickly, decoding gifs
is still quicker, so I'll often batch-convert them to gif while I'm 
off doing something else and then view them without waiting for each 
to decode.  Of course the bulk of this time is spent doing quantization, 
which I could avoid if I had a 24 bit display system.

                            Jim Lick		       
Work: University of California	| Play: 6657 El Colegio #24
      Santa Barbara		|       Isla Vista, CA 93117-4280
      Dept. of Mechanical Engr. |	(805) 968-0189 voice/msg
      2311 Engr II Building     | "when you gonna make up your mind?
      (805) 893-4113            |  when you gonna love you as much
      jim@ferkel.ucsb.edu	|  as i do?" -Tori Amos
From: roihar@cc1.crl.aecl.ca
Newsgroups: comp.graphics
Subject: anamorphic art algorithms
Date: 14 Apr 92 15:42:24 GMT
Organization: AECL RESEARCH

Hello:
I'm looking for some algorithms to create this popular kind of
'distorted' art. These are the kind of images that only look
normal when reflected from a curved mirror. Anybody know where
I can get the algorithms or 'C' source code for them?
Newsgroups: comp.graphics,sci.math,comp.sys.ibm.pc.programmer,comp.lang.c
From: checker@acf3.nyu.edu (Christopher Hecker)
Subject: Re: Fixed point arithmetic
Organization: New York University
Date: Thu, 16 Apr 1992 08:24:31 GMT


Although I can't remember the name of the book, and I've never seen it
myself, I have heard that there is a book by Bruce Artwicks that talks
about fixedpoint arithmetic and 3D graphics.

As far as code goes, you could look for Michael Abrash's X-Sharp .zip.
It is done with fixedpoint.  The past 4 or so DDJs have focused on it.

Chris
From: gt3635a@prism.gatech.EDU (Greg 'Spike' Bishop)
Newsgroups: comp.graphics
Subject: VERY LARGE BITMAP SCROLLING.
Date: 9 Apr 92 18:41:33 GMT
Distribution: usa
Organization: National Association for the Free Exchange of Information


Hi. How the heck can I take a screen image and move it (using the mouse)
and not have excessive flicker?  The image is rather large.  Also how can I
scroll a larger then screen background without using a index with the address
of the end of the lines?  I am currently using the PCX file format.

Thanks

gt3635a@prism.gatech.edu
-- 
 Tech: "Designing Tommorow The Night Before With Yesterday's Technology"
Newsgroups: comp.graphics
From: pringleg@shazam.ecs.csus.edu (Greg Pringle)
Subject: Re: Searching for PBMplus Package for Intel 286 machines
Keywords: graphics
Organization: California State University, Sacramento
Date: Fri, 10 Apr 1992 20:01:53 GMT

 I am also looking for PBMplus for the pc, have a 386 though. Anyone know
of an FTP site?? Please send me email: pringleg@shazam.ecs.csus.edu Thanx!!