waashk/20ng huggingface dataset:
Marc T. Kaufman (kaufman@Xenon.Stanford.EDU) wrote:  > -> Does anyone have any  other suggestions where the 42 came from?  >    At this moment the King, who had been for some time busily writing in > his note-book, called out "Silence!" and read out from his book > "Rule Forty-two. All persons more than a mile high to leave the court." >    Everybody looked at Alice. >    "I'm not a mile high," said Alice. >    "You are," said the King. >    "Nearly two miles high," added the queen. >    "Well, I sha'n't go, at any rate," said Alice; "besides, that's not > a regular rule: you invented it just now." >    "It's the oldest rule in the book," said the King. >    "Then it ought to be Number One," said Alice.  Does anybody have a collection of occurances of 42? (before and after The Guide). If not, I would like to receive any odd bits you might know. postings to alt.fan.douglas.adams.
add@sciences.sdsu.edu (James D. Murray) writes:  >I need to get the specs, or at least a very verbose interpretation of the >specs, for QuickTime.  Technical articles from magazines and references to >books would be nice too.  >I also need the specs in a format usable on a Unix or MS-DOS system.  I can't >do much with the QuickTime stuff they have on ftp.apple.com in its present >format.  Apple just released the Quicktime volume of the new Inside Macintosh series. Any bookstore with reasonable technical stock should have it.
Hello, I have some problem in converting tga file(generated by POVray) to rle file. When I convert, I do not get any warning message. But if I use xloadimage/getx11, something is wrong.  Error messages are, % targatorle -o o.rle data.tga % xloadimage o.rle o.rle is a 0x0 24 bit RLE image with no map (will dither to 8 bits), with gamma of 1.00   Dithering image...done   Building XImage...done xloadimage: X Error: BadValue (integer parameter out of range for operation) on 0x0 xloadimage: X Error: BadWindow (invalid Window parameter) on 0xb00003 ......  I know that I need to install ppmtorle and tgatoppm, but I do not spend time to install them. Even I do not want to generate .rgb from POVray and then convert them to rle, if possible.(.rgb to rle works, but it will mess up my directory with so many files, and it needs 2 more steps to finally convert to rle file. say cat | rawtorle | rleflip ) Does any body out there have same experience/problems ?  Thanks in advance,
There is a new version of the RTrace ray-tracing package (8.2.0) at asterix.inescn.pt [192.35.246.17] in directory pub/RTrace. Check the README file.  RTrace now can use the SUIT toolkit to have a nice user interface. Compile it with -DSUIT or modify the Makefile. SUIT is available at suit@uvacs.cs.virginia.edu I have binaries of RTrace with SUIT for SUN Sparc, SGI Indigo and DOS/GO32. Please contact me if interested.  ****************************************  The MAC RTrace 1.0 port is in directory pub/RTrace/Macintosh Thanks to Reid Judd (reid.judd@east.sun.com) and Greg Ferrar (gregt@function.mps.ohio-state.edu).  ****************************************  Small changes were done since version 8.1.0, mainly:  1. Now it is possible to discard backface polygons and triangles    for fast preview...  2. The support program scn2sff has been reworked to use temp files.  ****************************************  Here goes a short description of current converters from CAD/molecular/chemistry packages to the SCN format.  The package programs are related as below (those marked with * have been modified)  	       irit2scn      IRIT ----------------|                           |               NFF (nffclean, nffp2pp) 	        sol2scn   |                |     ACAD11 ---------------|                | nff2sff                           |                | 	        mol2scn	  v    scn2sff*    v	rtrace*    ALCHEMY  -----------> SCN -----------> SFF ----------> PIC or PPM 			  ^      cpp                           | 	        pdb2scn   |                                 picmix      PDB -----------------|                                 picblend 			  |                                 ppmmix* 	       chem2scn   |                                 ppmblend*    CHEMICAL --------------|                           |                 3ds2scn*  |   3D STUDIO --------------|                           |                 iv2scn*   |  IRIS Inventor -----------|  ****************************************  The DOS port of RTrace is in pub/RTrace/PC-386 (rtrac820.arj, utils820.arj and image820.arj). See the README file there. Requires DJGPP GO32 DOS extender (version 1.09 included), which can be found in directory pub/PC/djgpp (and in many sites around netland). There are also demo scenes, manuals and all the source code...  ****************************************  Please feel free to get it and use it. Hope you like it.
Does anyone out there have any JPEG decompression code in pretty much any language that I can read and understand?  I have trouble understanding the JPEG Group's code that I got from an FTP site.  If any one can send me some good code, I will appreciate it a lot!  Thanks!
I need a complete list of all the polygons that there are, in order.  I'll summarize to the net.   --------------------------------------------------------    "If only I had been compiled with the '-g' option."
Hello again netters, 	I finally received the information about Imagine for the PC.  They are presently shipping Version 2.0 of the software and will release Version 3.0 in the first quarter of 1993 (or so they say).  The upgrade from 2.0 to 3.0 is $100.00.  To purchase Imagine 2.0, it costs $495.00 or if you are upgrading from another eligible (call them for info) modeler, it is only $200.00 plus shipping & handling.   It requires a PC with 4 Megs a Math Coprocessor, and Dos 5.0 or up and a Microsoft Mouse and SVGA card. 	Thanks for all your replies about the product.  I have received many contrasting replies, but once I scrounge the money together, I think I will take the plunge.  Thanks again. 	Here is the info for Impulse if you want to find out more or get the sheet they sent. 	Impulse Inc. 	8416 Xerxes Avenue North 	Minneapolis, MN 55444 	1-800-328-0184  Thanks again for all your replies. Scott --  Scott Snowiss sasst11+@.pitt.edu
I need a VESA driver for the Diamond Speedstar 24X that works. I've tried several and none work for the hicolor modes.
>There is a thing called xgif  xgif is the grandfather of XV.  --
Apollo (now HP) have a graphics board that does 80-bit graphics.  When I  heard that, I jumped.  The answer isn't that it can do 100 trillion-trillion- trillion colors.  It actually does 10 planes of 8-bits (or 5 planes of 16 bits, etc.)  for very fast graphics.
In article <jonas-y.734802983@gouraud> jonas-y@isy.liu.se (Jonas Yngvesson)   writes: > Intersection Between a Line and a Polygon (UNDECIDABLE??), > 	by Dave Baraff, Tom Duff >  > 	From: deb@charisma.graphics.cornell.edu > In recent years, many geometric problems have been successfully modeled in a > new language called PostScript.  (See "PostScript Language", by Adobe Systems > Incorporated, ISBN # 0-201-10179-3, co. 1985). >  > So, given a line L and a polygon P, we can write a PostScript program that > draws the line L and the polygon P, and then "outputs" the answer.  By > "output", we mean the program executes a command called "showpage", which > actually prints a page of paper containing the line and the polygon.  A quick > examination of the paper provides an answer to the reduced problem Q, and   thus > the original problem.  Curiously, in modern PostScript, the point in a polygon problem can be solved even more easily.  To wit:  %! %%Title: Point in Polygon %%Creator: Allen B (ab@cc.purdue.edu) %%For: the amusement of comp.graphics regulars %%LanguageLevel: 2 %%DocumentNeededResource: humor sense thereof %%EndComments  % This program will test whether a point is inside a given polygon. % Currently it uses the even-odd rule, but that can be changed by % replacing ineofill with infill.  These are Level 2 operators, % so if you've only got Level 1 you're out of luck. % % The result will be printed on the output stream. % % Caution: only accurate to device pixels! % Put a huge scale in first if you aren't sure.  % Point to test % PUT X AND Y COORDINATES HERE  50 75  % Vertices of polygon in counter-clockwise order % PUT ARRAY OF PAIRS OF COORDINATES HERE [ [   0   0 ] [ 100   0 ] [ 100 100 ] [  67 100 ] [  67  50 ] [  33  50 ] [  33 100 ] [   0 100 ] ]
In <1993Apr16.114158.2246@whiting.mcs.com> sean@whiting.mcs.com (Sean Gum) writes:  >A stupid question, but what will CView run on and where can I get it? I >am still in need of a GIF viewer for Linux. (Without X-Windows.) >Thanks! >
In article <MEYER.93May28133222@ibsen.geomatic.no> meyer@geomatic.no (Harald Martens Meyer) writes: >The only book I've found on the CGM format, is "CGM and CGI" by D.B.Arnold >& P.R.Bono from Springer-Verlag, ISBN 3-540-18950-5. It's not the best >book I've read though....  Well, there *is* the standards document.  From the FAQ:  12) How to order standards documents.  The American National Standards Institute sells ANSI standards, and also ISO (international) standards.  Their sales office is at 1-212-642-4900, mailing address is 1430 Broadway, NY NY 10018.  It helps if you have the complete name and number.  Some useful numbers to know:  CGM (Computer Graphics Metafile) is ISO 8632-4 (1987).  GKS (Graphical Kernel System) is ANSI X3.124-1985. ...  >If you want a viewer, try downloading ralcgm from unix.hensa.ac.uk, >/misc/unix/ralcgm/ralcgm.tar.Z  You might also want to look at gplot from the folks at the Pittsburgh Supercomputer Center.  Fish around at calpe.psc.edu.  It is pretty nifty.  							spl
In the UIBM PC world, how much of a "standard" has VESA become for SVGA graphics?  I know there are lots of graphics-board companies out  there, as well as several graphics chips manufacturers- are they adhering to the VESA standard, and what effect is/will the VESA Local Bus have on all of this? Anyone?
Getting an image from a computer monitor to a videotape is harder than it looks.  The standard VGA and EGA outputs are  very different than the NTSC format used by televisions.  While there is equipment that will do the conversion, it is hard to get your hands on and costs quite a bit.  	If you have access to an Amiga computer, that has an NTSC output, you can transfer certain types of graphic files by modem and tape them from the NTSC output.  Unfortunately, this would be frame-by-frame and would lead to unbelievably scratchy animation unless you had a good Amiga animation program.
I have a few reprints left of chapters from my book "Visions of the              Future".  These include reprints of 3 chapters probably of interest to           readers of this forum, including:                                                                                                                                 1. Current Techniques and Development of Computer Art, by Franz Szabo                                                                                             2. Forging a Career as a Sculptor from a Career as Computer Programmer,          by Stewart Dickson                                                                                                                                                3. Fractals and Genetics in the Future by H. Joel Jeffrey                                                                                                         I'd be happy to send out free reprints to researchers for scholarly              purposes, until the reprints run out.                                                                                                                             Just send me your name and address.
In article <C65wBp.6K4@taurus.cs.nps.navy.mil> adaptive@cs.nps.navy.mil (zyda res acct) writes: >>Hi, there! >>I am interested in facial animation and want to implement some program about this area. >>But I don't have any 3-D information for the face. >>I am looking for some 3D images of face. > >Try getting the Cyberware_demo via ftp which contains 3D images of the >face. >  What is the copyright status of this data?  Are there restrictions regarding the uses they can be put to?  Kaveh
In article <19930420.090030.915@almaden.ibm.com> capelli@vnet.IBM.COM (Ron Capelli) writes: >In <ia522B1w165w@oeinck.waterland.wlink.nl> Ferdinand Oeinck writes: >>I'm looking for any information on detecting and/or calculating a double >>point and/or cusp in a bezier curve. > >See: >   Maureen Stone and Tony DeRose, >   "A Geometric Characterization of Parametric Cubic Curves", >   ACM TOG, vol 8, no 3, July 1989, pp. 147-163.  I've used that reference, and found that I needed to go to their original tech report:  	Maureen Stone and Tony DeRose, 	"Characterizing Cubic Bezier Curves" 	Xerox  EDL-88-8, December 1988  This report can be obtained for free from: Xerox Corporation Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, California 94303 +1-415-494-4440  The TOG paper was good, but this tech report had more interesting details ;-)
There is another useful method based on Least Sqyares Estimation of the sphere equation parameters.  The points (x,y,z) on a spherical surface with radius R and center (a,b,c) can be written as      (x-a)^2 + (y-b)^2 + (z-c)^2 = R^2  This equation can be rewritten into the following form:       2ax + 2by + 2cz + R^2 - a^2 - b^2 -c^2 = x^2 + y^2 + z^2  Approximate the left hand part by   F(x,y,z) = p1.x + p2.x + p3.z + p4.1  For all datapoints, i.c. 4, determine the 4 parameters p1..p4 which minimise the average error |F(x,y,z) - x^2 - y^2 - z^2|^2.  In 'Numerical Recipes in C' can be found algorithms to solve these parameters.  The best fitting sphere will have  - center (a,b,c) = (p1/2, p2/2, p3/2) - radius R = sqrt(p4 + a.a + b.b + c.c).  So, at last, will this solve you sphere estination problem, at least for the most situations I think ?.
Our group recently bought a Mitsubishi P78U video printer and I could use some help with it.  We bought this thing because it (1) has a parallel data input in addition to the usual video signal inputs and (2) claimed to print 256 gray level images.  However, the manual that came with it only describes how to format the parallel data to print 1 and 4 bit/pixel images.  After some initial problems with the parallel interface I now have this thing running from a parallel port of an Hewlett-Packard workstation and I can print 1 and 4 bit/pixel images just fine.  I called the Mitsubishi people and asked about the 256 level claim and they said that was only available when used with the video signal inputs.  This was not mentioned in the sales literature.  However they did say the P78U can do 6 bit/pixel (64 level) images in parallel mode, but they didn't have any information about how to program it to do so, and they would call Japan, etc.  Frankly, I find it hard to believe that if this thing can do 8 bit/pixel images from the video source, it can't store 8 bits/pixel in the memory.  It's not like memory is that expensive any more.  If anybody has any information on getting 6 bit/pixel (or even 8 bit/pixel) images out of this thing, I would greatly appreciate your sending it to me.  Thanks.
1) Lucas film 2) Pixar 3) 3D/Eye Inc. 4) Light & Magic
In article <1slb46$lbu@mserv1.dl.ac.uk> g.coulter@daresbury.ac.uk writes: >Hi Everyone :- > >I was woundering if someone could answer a simple >query for me on RayTracing and anti-aliasing .... > [stuff deleted] > I have a similiar question relating to anti-alaising that my friend has asked to have posted to the more knowledgable in this group. I'm sorry if this is an FAQ.     "What anti-alaising methods do Persistance Of Vision & Polyray use?"  Thank you in advance. You can either email me or reply (or flame me if it is an FAQ :-) )
Hi,  I'm looking for a program which is able to display 24 bits images. We are using a Sun Sparc equipped with Parallax graphics board running X11.
uk02183@nx10.mik.uky.edu (bryan k williams) writes:  >re: majority of users not readding from floppy. >Well, how about those of us who have 1400-picture CD-ROMS and would like to use >CVIEW because it is fast and it works well, but can't because the moron lacked >the foresight to create the temp file in the program's path, not the current >didrectory?     Actually the most flexible way to create temp files is to check for a TEMP or TMP environment variable and create the files on the drive and directory pointedto by the variable.  This is pretty much a standard for DOS, Windows and OS/2 applications.   --  What I have to say is my own opinion and has no bearing on any other person or organization including my employer.
Where did the hacker ethic go?  We hackers of the 70's and 80' are now comfortably employed and supporting families.  The next generation takes the radical lead now.  Don't look for radicalism among us old ones; we're gone...
In article <C5x9xs.KHE@hkuxb.hku.hk>, h8902939@hkuxa.hku.hk (Abel) writes: |> Hi netters,  |> 	I am currently doing some investigations on "Developable Surface". |> Can anyone familiar with this topic give me some information or sources |> which can allow me to find some infomation of developable surface? |> 	Thanks for your help!  |> Abel |> h8902939@hkuxa.hku.hk  A developable surface is s.t. you can lay it (or roll it) flat on the plane (it may require you to give it a "cut" though...)  E.g., a cylinder, a cone, a plane (of course!) or any surface or patch having vanishing Gaussian (intrinsic) curvature (i.e., with singular Hessian, the matrix of 2nd derivatives for an adequate coordinate patch) are "developable". In more technical words, a developable surface is "locally isometric to a plane" at all points.   Think also of the sphere (or the earth) which in a non-developable: whatever way(s) you cut it, you will not be able to lay flat any pieces of it... (its intrinsic curvature is nowhere vanishing).  For more details on this look at any book on differential geometry which treats surfaces (2D manifolds); e.g., M. do Carmo's book:  @Book{Carmo76Differential,   author =      {do Carmo, Manfredo P.},   title =       {Differential Geometry of Curves and Surfaces},   year =        1976,   publisher =   {Prentice-Hall},   note =        {503 pages.}}  Enjoy!
Hi, Everyone. I am  currently planning to write a program that traverses the image of handwritten characters in ascii format and produces circle and line representation of handwritten characters. Did anybody out there has any experiences on this problem? If you have would you post or e-mail to please kevin  Does anyone has program that traverse the digital image and produces circle and line --  ------------------------------------------------------------------------------------- KEVIN SHIN   kshin@bcstec.ca.boeing.com
joachim lous (joachim@kih.no) wrote: : ulrich@galki.toppoint.de wrote:  : > Does anyone have any  other suggestions where the 42 came from?  Yep, here's a theory that I once heard bandied around.  Rather than thinking of the number think of the sound. For Tea Two. A sort of anagram on Tea For Two, Two for Tea, For Tea Two.  :-)  Peter
Hi,    I'm looking for an algorithm that would generate a good cross-section of RGB colours given a limited colour map size.   The problem: I'm writing an application for the PC that may have at most 256 colors. I want to use one colormap (palette) for the application but I'd like it to contain an even spread of colours of the visible spectrum. I could use  a 6x6x6 RGB cube but the problem is that a lot of those colours are almost identical to the human eye.
In article <ltu4buINNe7j@caspian.usc.edu>, zyeh@caspian.usc.edu (zhenghao yeh) writes:  >|> See Foley, van Dam, Feiner, and Hughes, _Computer Graphics: Principles >|> and Practice, Second Edition_. >|>  >|> [If people would *read* this book, 75 percent of the questions in this >|> froup would disappear overnight...] >|>  >	Not really. I think it is less than 10%.  Or alternatively, 75% of the questions cover 10% of the topics in this group - making them frequently asked.  So the other 25% cover 90% of the topics, making them rarely asked and thus in sore need of answering ...  -- Chris Lilley ---------------------------------------------------------------------------- Technical Author, ITTI Computer Graphics and Visualisation Training Project Computer Graphics Unit, Manchester Computing Centre, Oxford Road,  Manchester, UK.  M13 9PL                        Internet: C.C.Lilley@mcc.ac.uk  Voice: +44 (0)61 275 6045  Fax: +44 (0)61 275 6040 Janet: C.C.Lilley@uk.ac.mcc
spworley@netcom.com (Steve Worley) writes:  >bolson@carson.u.washington.edu (Edward Bolson) writes:  >>Boy, this will be embarassing if it is trivial or an FAQ:  >>Given 4 points (non coplanar), how does one find the sphere, that is, >>center and radius, exactly fitting those points?  I know how to do it >>for a circle (from 3 points), but do not immediately see a  >>straightforward way to do it in 3-D.  I have checked some >>geometry books, Graphics Gems, and Farin, but am still at a loss? >>Please have mercy on me and provide the solution?    >It's not a bad question: I don't have any refs that list this algorithm >either. But thinking about it a bit, it shouldn't be too hard.  >1) Take three of the points and find the plane they define as well as >the circle that they lie on (you say you have this algorithm already)  >2) Find the center  of this circle. The line passing through this center >perpendicular to the plane of the three points passes through the center of >the sphere.  >3) Repeat with the unused point and two of the original points. This >gives you two different lines that both pass through the sphere's >origin. Their interection is the center of the sphere.  >4) the radius is easy to compute, it's just the distance from the center to >any of the original points.  >I'll leave the math to you, but this is a workable algorithm. :-)  Good I had a bad feeling about this problem because of a special case with no solution that worried me.  Four coplanar points in the shape of a square have no unique sphere  that they are on the surface of. Similarly 4 colinear point have no finite sized sphere that they are on the surface of.  These algorithms being geometrical designed rather than algebraically design meet these problems neatly.  When determining which plane the 3 points are on if they are colinear the algorithm should afil or return infinite R. When intersecting the two lines there are 2 possibilities they are the same line  (the 4 points were on a planar circle) they are different lines but parallel. There is a sphere of in radius.  This last case can be achieved with 3 colinier points and any 4th point by taking the 4th point and pairs of the first 3 parallel lines will be produced  it can also be achieved by  If all 4 points are coplanar but are not on one circle.   It seems to me that the algorithm only fails when the 4 points are coplanar. The algorithm always fails when the points are coplanar. (4 points being colinear => coplanar)  Testing if the 4th point is coplanar when the plane of the first 3 points has been found is trivial.   >An alternate method would be to take pairs of points: the plane formed >by the perpendicular bisector of each line segment pair also contains the >center of the sphere. Three pairs will form three planes, intersecting >at a point. This might be easier to implement.