HDTenEightyP/NetNews huggingface dataset:
From: salaing@eos.ncsu.edu (Scott Laing)
Newsgroups: comp.graphics
Subject: Iris 20 & 25 differences = PROBLEM (help?)
Keywords: SGI
Date: 12 Apr 92 07:43:45 GMT
Reply-To: salaing@eos.ncsu.edu (Scott Laing)
Organization: Project EOS - North Carolina State University

Hey, I'm trying to Gouraud-shade some 3D data using the GL-defined lighting 
model.  Everything shows up fine on the model 20, but on the 25 the object
appears to be in backface or unlit (represented as dark grey area).

Has anyone else ever had this problem?  I could really use the 25's speed.

TIA,
Scott
From: spl@dim.uucp (Steve Lamont)
Newsgroups: comp.graphics
Subject: Re: polygon vertex in clockwise or counterclockwise?
Date: 7 Apr 92 15:39:15 GMT
Organization: University of Calif., San Diego/Microscopy and Imaging Resource
NNTP-Posting-Host: dim.ucsd.edu

In article <1992Apr6.231747.19597@aplcen.apl.jhu.edu> jclark@aplcen.apl.jhu.edu (S Clark james hawkin [A[A[A[B[Bx) writes:
>Given a list of 3 or more polygon vertex points (x,y) with first and last
>vertex point connect to each other.
>
>How do I code a function that will tell me if vertex list is arranged
>in clockwise or counterclockwise path along the polygon edges?

Compute the area of the polygon.  If the area is negative, then the
polygon is clockwise, positive and it's counterclockwise.

The algorithm for computing the area of a polygon can be found in the
chapter on analytic geometry of the _CRC Standard Mathematical Tables_
handbook, among other places.  Here's a little C routine that I've
coded to compute the area:

typedef struct {
    float x;
    float y;
    float z;
} Vertex;

typedef struct {
    int vertices;
    Vertex **vp;
} Polygon;

float polygonArea( p )

    Polygon *p;

{

    float a = 0.0;
    int i;

    for ( i = 0; i < p->vertices; i++ ) {

	int ip1 = ( i + 1 ) % p->vertices;
	int im1 = ( i - 1 ) < 0 ? p->vertices - 1 : i - 1;

	a += p->vp[i]->x * ( p->vp[ip1]->y - p->vp[im1]->y );

    }

    return( a / 2.0 );

}

Let me know if you pass the course. :-)

						spl (the p stands for
						pass/fail system)
-- 
Steve Lamont, SciViGuy -- (619) 534-7968 -- spl@dim.ucsd.edu
UCSD Microscopy and Imaging Resource/UCSD Med School/La Jolla, CA 92093-0608
"In the room women come and go/Talking of Michelangelo."
                           - T.S. Eliot, "The Love Song of J. Alfred Prufrock"
Newsgroups: comp.graphics,comp.sys.ibm.pc.misc
From: jimmy@namao.ucs.ualberta.ca ()
Subject: Simple GRAPHICS questions
Organization: University of Alberta
Distribution: na
Date: Thu, 9 Apr 1992 15:19:15 GMT


Hi folks,

Two graphics related questions:

1. DOS question:
   I have an application in DOS where I select an icon from a palette
   and place it on a screen. After the icon is placed on the canvas,
   pixels under the graphics mouse cursor disappear. Why does this 
   happen and what is the fix ? Using 386 and VGA.

2. GENERAL GRAPHICS question:
   Are there any conventions for representing "draggable" icons ? Should
   they show up as simple line drawings or can they show up as buttons
   with simulated depth ? The idea would be to "press" the selected icon
   button while it was selected.

Thanks,
Jimmy

jimmy@namao.ucs.ualberta.ca
--
jimmy@namao.ucs.ualberta.ca
Xref: sparky comp.graphics:5478 alt.binaries.pictures.d:2441
From: davidsen@yeti.crd.GE.COM (william E Davidsen)
Newsgroups: comp.graphics,alt.binaries.pictures.d
Subject: Re: JPEG viewer for win3.0 and 3.1
Keywords: jpeg
Date: 16 Apr 92 20:48:30 GMT
Reply-To: davidsen@crd.ge.com (bill davidsen)
Organization: GE Corporate R&D Center, Schenectady NY

In article <rolf.83.703337410@let.rug.nl>, rolf@let.rug.nl (R.P. Mulder) writes:

|  There is another problem to your suggestion: 15 or 24 BPP boards are pretty 
|  rare on a PC and that's what the question was all about.

  There are lots of 15 bit (aka hi-color) boards for prices ranging from
$120-190 depending on how big a brand name you want.
-- 
	- bill davidsen (davidsen@crd.ge.com)
	GE Corp. R&D Center; Box 8; Schenectady NY 12345
By analysis of usenet source, the hardest part of C to use is the comment
From: GJAMES@HUSKY1.STMARYS.CA (Geoff James)
Newsgroups: comp.graphics
Subject: ATI 32k Color
Date: 8 Apr 92 14:53:51 GMT
Organization: Saint Mary's University

I have an ATI vga board with 1 meg of memory. It is supposed to be able
to display 32,000 colors at one time in 640 * 480 resolution. I ahvent
been able to find programs to run or any gifs with these features to test 
the board.

Can anyone email with info?

GJAMES@HUSKY1.STMARYS.CA
From: takkhoo@nunki.usc.edu (Tak Khoo)
Newsgroups: comp.graphics
Subject: 3D projection
Date: 7 Apr 1992 23:14:29 -0700
Organization: University of Southern California, Los Angeles, CA
NNTP-Posting-Host: nunki.usc.edu

Hi there!  Anyone out there know how to do 3D parallel/perspective
projection?
Thanx in advance for your help.


Newsgroups: comp.graphics
From: ganter@milton.u.washington.edu (M. Ganter)
Subject: Re: drawing conic sections using homogeneous (4d) coordinates?
Organization: University of Washington
Date: Tue, 14 Apr 1992 06:22:08 GMT

Martin, Some "classic" refs on your question area are the four books by
George Salmon (Univ. of Dublin, circa 1850).  Not real asy reading but
some of the classics.  Any good math library should have them...Good Luck

Newsgroups: comp.graphics
From: sew@design.canberra.edu.au (Simon Ward)
Subject: Alias Research Email Address?
Organization: University of Canberra
Date: Thu, 16 Apr 92 03:04:31 GMT

I need a quiet chat with someone at Alias.

Anyone know their internet address?


Simon Ward
Faculty of Environmental Design
University of Canberra

sew@design.canberra.edu.au
Newsgroups: comp.graphics,soc.culture.soviet
From: ernestk@wam.umd.edu (TERMINATOR III)
Subject: Cyrillic fonts
Organization: University of Maryland at College Park
Date: Thu, 16 Apr 1992 02:45:47 GMT

	Could anybody out there send me Cyrillic fonts for IBM PC.
I have wordperfect and Microsoft Windows wordprocessor. 
	If anybody needs Cyrillic, Japanese, Arabic fonts for Mac mail
me something and I could provide them for you.
Newsgroups: comp.graphics
Subject: any format to VMS/UIS format converters needed
From: marcello@deis16cineca.it (Marcello Dalpasso)
Date: Thu, 9 Apr 92 17:21:40 GMT
Organization: *********************************************************
Originator: marcello@deis16


Hi 

I'm looking for programs to convert any of the Unix graphic formats
(xbitmaps, GIF, jpeg, tiff, pbm, ppm, sunraster) into the VMS UIS
format

Can anyone help me?

Thanks


-- 
	Marcello Dalpasso (e-mail: marcello@deis16.cineca.it)
	D.E.I.S. - Department of Electronics and Computer Science	
	Viale Risorgimento 2, I - 40136 Bologna, Italy			
	Phone: +39-51-644-3015 (fax: 3073)
-- 
	Marcello Dalpasso (e-mail: marcello@deis16.cineca.it)
	D.E.I.S. - Department of Electronics and Computer Science	
	Viale Risorgimento 2, I - 40136 Bologna, Italy			
	Phone: +39-51-644-3015 (fax: 3073)
Newsgroups: comp.graphics
From: sbrown@vx9000.weber.edu (Stacie Brown)
Subject: Re: Image Processing Group
News-Software: VAX/VMS VNEWS 1.41    
Organization: University of Utah Computer Center
Date: 16 Apr 1992 10:10 MST  

In article <1992Apr4.094841.29713@cc.tut.fi>, jk87377@cc.tut.fi (Juhana Kouhia) writes...
> 
>In article <3911@mercury.brunel.ac.uk>
>cspgdsh@brunel.ac.uk.brunel.ac.uk (Darren S Hague) writes:
>>
>>I agree. It is annoying, as an IP researcher, to sift through hundreds
>>of articles on rendering, etc, to get to the interesting (for me)
>>material.
> 
>What rendering articles? Have I missed something lately?
> 
>I agree too that it's annoying to not see serious articles written
>more oftenly -- in rendering subject too. Most serious articles I have
>seen discuss about computational geometry problems; mainly because
>beginners ask the questions and then professionals flames each other.
> 
>Juhana Kouhia
Newsgroups: comp.graphics
From: baker@elec.uq.oz.au (Rex Baker)
Subject: test
Organization: Prentice Centre, University of Queensland
Date: Mon, 13 Apr 1992 03:29:39 GMT

Just testing     

Newsgroups: comp.graphics
From: grot@srvmp21.physik.tu-berlin.de (Bjoern Grothkast)
Subject: .gif to AIM
Summary: conversion from .gif to AIM
Keywords: gif
Organization: ZRZ/TU-Berlin
Distribution: tub
Date: Mon, 6 Apr 1992 13:47:49 GMT


To anyone who it may concern ...

I'm looking for a nice utility to convert .gif Images from an IBM compatible
to the AIM (Atari Image Manager) format.

OK, that's all today.

(grot@srvmp21.physik.tu-berlin.de)
From: mccauley@ecn.purdue.edu (Darrell McCauley)
Newsgroups: comp.graphics
Subject: Re: need Texture algorithms
Date: 12 Apr 92 02:54:35 GMT
Article-I.D.: noose.1992Apr12.025435.28009
Followup-To: comp.graphics
Organization: Ag Engineering Dept, Purdue University

In article <1992Apr9.232517.8762@kpc.com>, hollasch@kpc.com (Steve Hollasch) writes:
|> hamid@imada.ou.dk (Hamid Sarabi) writes:
|> | I need an algorithm for texture mapping. 
|>     There are a variety of sources for texture mapping; here's a few
|> references from my shelf:
[1. foley, van dam, feiner, and hughes, 2. Gems, 3. rogers, 4. rogers 
and adams]

I'm interested in texture as an analytical tool (feature extraction, 
not picture making). Does anyone have any code/approaches that may 
add to or complement Haralick's stuff (co-occurrence matrix approach)?

Does anyone know of any references to work comparing the effects of
using different neighborhood sizes (d-values) for the cooccurrence
approach? (This is the neighborhood used when building the matrix.)
-- 
James Darrell McCauley          Department of Ag Engr, Purdue Univ
mccauley@ecn.purdue.edu         West Lafayette, Indiana 47907-1146

@article{haralick73,
   author = {Robert M. Haralick and K. Shanmugam and Its'hak Dinstein},
   journal = {IEEE Trans. on Systems, Man, and Cybertinetics},
   month = nov,
   number = 6,
   pages = {610--620},
   title = {Textural Features for Image Classification},
   volume = {SMC-3},
   year = 1973
}
From: gbol@rglnext.geol.vt.edu (Gregory Lampshire)
Newsgroups: comp.graphics
Subject: Where is the CIA world data bank?
Date: 6 Apr 92 16:03:56 GMT





Where is the CIA world data bank?  FTP arhive, mail server
purchase only?




--
Gregory Lampshire 
Virginia Tech 
Bradley Department of Electrical Engineering
laural@vttcf.cc.vt.edu
gbol@rglnext.geol.vt.edu (preferred) NeXTmail welcome
------------------------
Newsgroups: comp.graphics
From: jwstuart@ecst.csuchico.edu (Jesse William Leo Stuart)
Subject: GIF editor needed.
Organization: California State University, Chico
Date: Tue, 07 Apr 1992 17:03:24 GMT

	Has anyone seen an editor for gif files?  I'm looking for something
that would allow me to take images from one or more gifs, combine them, and
then save the result as a gif.

Jess Stuart
CSUC Chico CA
From: rjb12@unix.brighton.ac.uk (Browning;f110or89;[05306)
Newsgroups: comp.graphics
Subject: Re: Contour plots..
Date: 8 Apr 92 11:13:06 GMT
Organization: Brighton Polytechnic, UK

I've got a contour proggie that may do some of what you're after. You
give the program a script file, which contains *spot heights* in an
X Y Z format, and it then goes off and interpolates all the other heights
which haven't been defined.

If anyone's interested, email me.

Rich.
-- 
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Rich Browning (rjb12@bton.unix)   *   Madness ...
Department of Computer Science    *   ... is merely a state of 
Brighton Polytechnic              *       intellectual independence
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
From: revankar@cs.Buffalo.EDU (Shriram Revankar)
Newsgroups: comp.graphics
Subject: Re: Pattern recognition vs Vision
Date: 14 Apr 92 16:27:26 GMT
Organization: State University of New York at Buffalo/Comp Sci
Originator: revankar@errai.cs.buffalo.edu


In article <1992Apr14.102620.8364@csd.brispoly.ac.uk>, ph_su@csd.brispoly.ac.uk (J.B. the Frog!) writes:
> Bonjour,
> 
> There's a question which puzzle me a lot.
> Can anybody tell me the difference between Pattern recognition,
> Vision, Image understanding and a definition of each
> of the above.

There are no precise boundary that separates one from the other. There
is a lot of overlap. Here is a rough explanation.


Pattern Recognition:	given a graph or a set of points in a 
			n-dimensional space, detect and extract a 
			pattern of interest. 
			
			e.g. clustering, graph matching, etc. 

Image Understanding: 	Given a 2,3 dimensional real data, or 
			(2,3D)+time data generate a simplified 
			explanation of the scene.

		  	For example consider a binarization 
			scheme. It does not try
		    	to recognize any particular pattern, 
			but it generates a binary
			explanation, based on an assumed 
			data model for a binary scene.

Computer Vision:  	A higer level study of visual imagery
			to generate a symbolic explanation of a scene.

			This is a broad area that deals with some or 
			many of the issues of the areas such as 
			Pattern Recognition, Image Understanding
			active vision, computer simulation of 
			biological vision, cognitive study of 
			visual perception, etc.


> It seems for me that are very close to one another, and 
> that sometimes mean the same damn thing!
> 
   True. There is a large area of research that intersects 
	all the above fields. Some times new names are created to 
	encourage a research trend or to start a Journal.
   

> Merci beaucoup,
> 
> Jean-Baptiste
> ph_su@csd.brispoly.ac.uk
> -- 
> JB (Jean-Baptiste)

Shriram Revankar
From: rcssjh@minyos.xx.rmit.oz.au (Steven Hayes)
Newsgroups: comp.graphics
Subject: Re: Raytracing on a CM
Date: 6 Apr 92 04:07:08 GMT
Organization: RMIT Computer Centre, Melbourne Australia.

MXD120@psuvm.psu.edu (Beaker) writes:

>I have a friend who has access to a Connection Machine and we were
>thinking of compiling a raytracer on it (DKB or Rayshade) to create
>frames for animation.  I know that the code has to be optimized to
>run on a parallel machine, but I'm not sure how to do this.  Has
>anybody out there done this?  The most logical way, to me at least,
>of accomplishing this would be to send each line to a different
>processor.  Any ideas?

If its a CM-2, forget it. If its a CM-5, there may be some hope. I've
written a CM-2 raytracer based on the code by Hubert Delany 
(TMC Tech Report Series #VZ88-4). Its written in C*, and its pretty dismal.
The idea of porting something like rayshade
is just not possible. You need you need to completely re-write the code
to take advantage of the data parallel operations. There are some guys
at Princeton and MIT  who have been working on a very spiffy 
radiosity/raytracer application for the CM-2. You can contact one of them 
at smd@media.mit.edu I think. His name is Steve Drucker.
-- 

   Steven Hayes                                    |  steveh@cs.rmit.edu.au
   Royal Melbourne Institute of Technology (RMIT)  |  +61 3 660-2693
From: conley@uservx.plk.af.mil
Newsgroups: comp.graphics
Subject: Re: Looking for CGM format info
Date: 8 Apr 92 07:34:04 GMT
Organization: Phillips Laboratory - Kirtland AFB

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.


The official ANSI document is the following:

      ANSI X3.122-1986
      Computer Graphics-
      Metafile for the Storage and Transfer
      of Picture Description Information

Published by

      Americal National Standards Institute
      1430 Broadway
      New York, NY 10018
      USA

This document contains the full description of the functional specification
as well as three encodings (character, binary, and clear text).  Write or
phone the American National Standards Institute for information about
purchasing this document.
From: conley@uservx.plk.af.mil
Newsgroups: comp.graphics
Subject: Re: Polygon Vertices in Clockwise or Counterclockwise Order?
Date: 8 Apr 92 07:24:52 GMT
Organization: Phillips Laboratory - Kirtland AFB

In article <1992Apr7.173956.21900@kpc.com>, hollasch@kpc.com
(Steve Hollasch) writes:

> jclark@aplcen.apl.jhu.edu (S Clark James Hawkin) writes:
> | Given a list of 3 or more polygon vertex points (x,y) with first and last
> | vertex point connect to each other.
> | 
> | How do I code a function that will tell me if vertex list is arranged
> | in clockwise or counterclockwise path along the polygon edges?

        <deleted material>

>     First compute the normal to the triangle by taking the cross product
> of vector A = V1 - V0 and vector B = V2 - V0, and call the resulting
> vector C.  Now find the vector from a vertex on the triangle to the view
> point, S = E - V0, where E is the eye-point, or view point, or whatever
> you want to call it.
> 
>     Now just find the dot product between C and S.  If the result is
> negative, then the vertices are in a clockwise order.  If the result is
> positive, then the result is in counter-clockwise order.
> 
>     Now if you're in a left handed coordinate system, then C = B X A.

This can fail if the polygon is non-convex.  The original problem as stated
allows for non-convex polygons.  As an example where this solution fails,
consider the following non-convex polygon (assume a right handed coordinate
system with positive X to the right, positive Y "up" on the screen, and
positive Z toward the viewer):

                         V3
                         .                C = A X B = (V1-V0) X (V2-V0)
                       .    .             points away from the viewer, so
                     .   .     .          C * S is negative, but the polygon
                   .  .  V1   .   .       is counterclockwise as viewed
                 . .              .  .
               .                        .
             V0                         V2
Xref: sparky comp.graphics:5235 rec.video.production:383
From: RICKE@NDSUVM1.BITNET
Newsgroups: comp.graphics,rec.video.production
Subject: Re: IBM graphics --> Videotape
Date: 7 Apr 92 15:38:14 GMT
Article-I.D.: NDSUVM1.92098.103814RICKE
Organization: North Dakota Higher Education Computer Network

At our studio, we are using a card from Willow Peripherals.  The main use is
for a teleprompting system, but it works equally well for graphics.  It is
called VGA-TV and is good for up to 640 x 480 with 256 colors.  The company
can be reached at 1-800-444-1585.

Dale Ricke
Chief Engineer
University of North Dakota
TV Production Center
Newsgroups: comp.graphics
From: mccreary@sword.eng.hou.compaq.com (Ed McCreary)
Subject: Re: WANTED: GIF read/write code
Organization: Compaq Computer Corp.
Date: Wed, 15 Apr 1992 13:21:29 GMT

In article <92105.100059CXT105@psuvm.psu.edu> CXT105@psuvm.psu.edu (Christopher Tate) writes:
>Since the FAQ hasn't showed up in quite a while, I'll just ask....
>
>Does anyone have source code for a good (i.e. fast :-) set of GIF
>read and write routines?  I'd really much rather not have to re-invent
>this particular wheel.
>
>I've heard that the Stone Soup Group's code is publicly available, but
>I don't know where to lay hand on it.
>
>Any and all sources will be appreciated....

Check out the archives at wuarchive.wustl.edu under mirrors/msdos/graphics
I believe.  They have source samples in C and Pascal.  Note that the
Stone Soup Group's code for fractint is not a complete implementation
of the GIF standard.  A file describing the standard should be found
on the archive somewhere also.


--
McCreary@sword.eng.hou.compaq.com     Computers are like Old Testament gods;
Me? Speak for Compaq?  Yeah, right.   lots of rules and no mercy.
                                                             Joseph Campbell
From: kmsahr@happy.colorado.edu
Newsgroups: comp.graphics
Subject: Problem with MGED facetize command
Date: 10 Apr 92 18:56:31 GMT
Organization: University of Colorado, Boulder

This is posted for a colleague of mine, Tom Simmerman, who does
not have USENET access. Please reply to me at sahr@piglet.uccs.edu:

We are running MGED on an SGI 340 under IRIX 3.3.2. The facetize
command always causes a segmentation violation error (in RT_PLONG).
Where am I going wrong?

Thanks

Kevin Sahr
sahr@piglet.uccs.edu
Newsgroups: comp.graphics
From: reich@magnus.acs.ohio-state.edu (A Minor Diety)
Subject: Re: Cloudless Earth Image
Organization: The Ohio State University - Academic Computing Services
Distribution: usa
Date: Tue, 7 Apr 1992 22:01:51 GMT

In article <1992Apr6.192807.12225@unocal.com> stgprao@xing.unocal.com (Richard Ottolini) writes:
|In article <1992Apr6.153541.9843@aero.org> werner@aero.org (Michael F. Werner) writes:
|>
|>     Is the cloudless earth image in the public domain yet?   Anyone know
|>how I can get it (free)?

Hardly.  A JPEG version was distributed about a month and a half ago.
Probably very illegal.

On a related subject; I called Signals and got the catalog with the
Cloudless Earth poster in it.  Do you realize that they want 20 bucks
plus $4 P&H I thought that was a little steep, but I'm going to get it
anyway.  As long as I'm getting it, I might as well get it framed,
too.
Sigh....


-- 
  DDDDDD             k                | reich@magnus.acs.ohio-state.edu
  D     D  `   cccc  k  kk   (^8      | Dick C. Reichenbach
  D     D  i  c      kkk              | "Quoth the raven 'Eat My Shorts'" and
  DDDDDD   i   cccc  k  kk  WAS HERE  | "Later Grizzley Dudes" - Bart Simpson
From: hendrik@vedge.UUCP (Hendrik Boom)
Newsgroups: comp.graphics
Subject: Re: annealing algorithm?
Date: 8 Apr 92 14:10:32 GMT
Organization: Visual Edge Software, St. Laurent, Quebec

fester@island.COM (Mike Fester) writes:
In article <3718@wet.UUCP> smiller@wet.UUCP (Gregory Shane Miller) writes:
>
>i would like to receive any information on the so called annealing algorithm.

The one I know is fairly simple in concept.

The problem it solves: you have a huge state space, and you want to
search it for good states. There is a measure of goodness and a set
of transformations that change states into other states.

The basic approach: start with a state. Look at nearby states
(those produced by applying the available transformations)
Choose one of them.  Repeat until your solution is good enough.

The trick is, of course, in the choice of neighbour.  Different
strategies could lead to rapid convergence to a horrible state,
to an excellent one, or wandering all over.

The "greedy" algorithm just chooses the best neighbour each time.
This works for many problems, but can get permanently stuck in suboptimal
local minima.

The annealing algorithm uses a stochastic/ergodic approach.
One of the neighbours is chosen at random, with probabilities
chosen so that better solutions are more likely, but worse ones
are still possible.  If we are trying to minimize the function
E of the state, the porobablilities for neighbours n0, n1, n2, ...
with values E0, 1E, E2, ... are proportional to exp(-E0/T), exp(-E1/T)
exp(-E2/T), ... .  This is analogous to state changes in thermodynamics,
where E is energy and T is proportional to temperature (statistical
mecahnics uses kT instead of T in the above probablilities).

When T is high, the trial solution has lots of energy, and bounces
all over the state space.  Then T is low, is tends to get stuck
in a low-energy state and has a hard time getting out of it.

If you start out with high value of T and gradually lower it,
continuing forever the theoreticians say that the trial solition 
will reach the optimum solution infinitely often with probability
1.  In practice, you try a few decreasings of T until you get
an understanding of how it affects your problem.

In your problem with lots of variables, typical transformations
would be to make local changes in a few variables.  The transformations
could be such that important invariants of the problem are
preserved, or you could impose a high energy cost to violations
of the most important constraints.

Hope this helps.
-- 
-------------------------------------------------------
Try one or more of the following addresses to reply.
at work:	hendrik@vedge.uucp,  iros1!vedge!hendrik
at home:	uunet!altitude!ozrout!topoi!hendrik