comp.lang.idl-pvwave archive: archive » polygon intersection routine in IDL

Home » Public Forums » archive » polygon intersection routine in IDL

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

Re: polygon intersection routine in IDL [message #52676 is a reply to message #52545]

Wed, 14 February 2007 11:05

JD Smith
Messages: 850
Registered: December 1999

Senior Member

On Tue, 13 Feb 2007 19:15:15 -0800, Weihua FANG wrote:

> hi, all,
>
> I need a routine to get the exact intersection, to be returned as a
> polygon, of 2 polygons (could be convex or concave) . I did some search
> and found similar routines from the libs of motley and Dr. D.Faning. but
> seems not the exact one i am looking for.
>
> Is there anybody knows such a routine in IDL?

I have such a routine called POLYCLIP, for clipping arbitrary polygons
to a rectangular grid, and I believe Mark Hadfield reimplemented it in
his library. I also have a auto-compiling C DLM version of the
Sutherland Hodgeman clipper which is much (50x) faster than the
internal IDL version, when you have very many polygons to clip. It's
coming out with another package soon.

JD

Report message to a moderator

[Message index]

		polygon intersection routine in IDL By: Weihua FANG on Tue, 13 February 2007 19:15
		Re: polygon intersection routine in IDL By: JD Smith on Wed, 14 February 2007 11:05
		Re: polygon intersection routine in IDL By: mmeron on Wed, 14 February 2007 10:07
		Re: polygon intersection routine in IDL By: Weihua FANG on Wed, 14 February 2007 03:36

Previous Topic:	Writing to the IDLde
Next Topic:	any objects for handling (program) state transitions

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sat Oct 11 08:06:24 PDT 2025

Total time taken to generate the page: 0.87840 seconds