Re: computational geometry
- To: mathgroup at smc.vnet.net
- Subject: [mg22232] Re: computational geometry
- From: joegwinn at mediaone.net (Joe Gwinn)
- Date: Fri, 18 Feb 2000 02:35:20 -0500 (EST)
- Organization: Gwinn Instruments
- References: <email@example.com>
- Sender: owner-wri-mathgroup at wolfram.com
Try looking in Graphics Gems, a series of algorithm books currently
numbering five or more. I recall such an algorithm and many others there.
In article <88dn2m$t3 at smc.vnet.net>, "CAJ" <kinky at chesapeake.net> wrote:
> I need a way to determine the intersection of polygons in a plane.
> In particular, I am representing data as a complex hull surrounding 2
> dimensional points in the xy plane.
> Multiple polygons representing different experiments are represented in the
> same plane.
> I need to determine if there exists a polygon which is isolated from all
> other polygons in the plane and is located in the upper right quadrant of
> the plane.
> This particular polygon would represent the best of the best in the series.
> It has no intersections with any other polygons and is located in the upper
> right quadrant.
> I have had serveral ideas on how to do this, but none are clean and elegant.
> Anyone have any good ideas?
> Charles A. Judge MD
Prev by Date:
Re: How to call by reference for particular argument(s)?
Next by Date:
Re: Mathematica formulae as Word metafiles
Previous by thread:
Next by thread:
Graphics and animation