Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2000
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

computational geometry

  • To: mathgroup at smc.vnet.net
  • Subject: [mg22120] computational geometry
  • From: "CAJ" <kinky at chesapeake.net>
  • Date: Wed, 16 Feb 2000 02:34:36 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

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?

Thanks,

Charles A. Judge MD








  • Prev by Date: Simplifying a simple expression in Mathematica 3.0.x
  • Next by Date: Re: sum of recursive fn: solving for n
  • Previous by thread: Simplifying a simple expression in Mathematica 3.0.x
  • Next by thread: Re: computational geometry