comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: intersecting polygons
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: intersecting polygons [message #29374 is a reply to message #29373] Mon, 18 February 2002 14:40 Go to previous messageGo to previous message
Pavel A. Romashkin is currently offline  Pavel A. Romashkin
Messages: 531
Registered: November 2000
Senior Member
Have you tried IDLanROI? It has ContainsPoints method. It looks to me you
can call it twice setting ROI to one polygon, then another, and using the
remaining poilygon as data points to test. Then, once you have the results
from the two ContainsPoints operations, join tham to get the polygon
defining the intersection area.
Pavel

"Jonathan Pearce" <jvp10@psu.edu> wrote in message
news:e8de391d.0202171458.294f04@posting.google.com...
> 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'd be most grateful for any responses!
>
> Jon Pearce.
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Previous Topic: Re: debug IDL DLM in Visual C++
Next Topic: color and idl -rt

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sun Oct 12 00:01:27 PDT 2025

Total time taken to generate the page: 0.01110 seconds