comp.lang.idl-pvwave archive: archive » Re: intersecting polygons

Home » Public Forums » archive » Re: intersecting polygons

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: intersecting polygons [message #29373]

Mon, 18 February 2002 15:45

meron
Messages: 51
Registered: July 1995

Member

In article <e8de391d.0202171458.294f04@posting.google.com>, jvp10@psu.edu (Jonathan Pearce) writes:
> Hi,
>
> Does anybody know of, or have a routine that could take polygonal
> areas and find the common area between them? Consider the first
> polygon defined by the set of points x1,y1 where x1 and y1 are arrays.
> The second polygon is defined by the set of points x2 and y2. What I
> am looking for is the points where the lines given by x1,y1 and x2,y2
> intersect. Owing to limited time I am wondering if anybody has written
> such a routine, that would return a polygon describing the area common
> to both polygons.
>
I happen to have a set of routines which operate on 2D shapes and,
yes, there is one there that given two polygons will return the
vertices of their intersection, and there is another which will
calculate the area of any polygon.

Mati Meron | "When you argue with a fool,
meron@cars.uchicago.edu | chances are he is doing just the same"

Report message to a moderator

[Message index]

		Re: intersecting polygons By: meron on Mon, 18 February 2002 15:45
		Re: intersecting polygons By: Pavel A. Romashkin on Mon, 18 February 2002 14:40
		Re: intersecting polygons By: jvp10 on Mon, 18 February 2002 04:03
		Re: intersecting polygons By: David Fanning on Sun, 17 February 2002 17:38

Previous Topic:	Re: debug IDL DLM in Visual C++
Next Topic:	color and idl -rt

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sun Nov 30 00:14:00 PST 2025

Total time taken to generate the page: 1.43754 seconds