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

Home » Public Forums » archive » Re: Weiler Atherton Clipping Algorithm
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: Weiler Atherton Clipping Algorithm [message #62455 is a reply to message #62454] Tue, 09 September 2008 05:32 Go to previous messageGo to previous message
rogass is currently offline  rogass
Messages: 200
Registered: April 2008
Senior Member
On Sep 9, 1:35 pm, Wox <nom...@hotmail.com> wrote:
> On Tue, 9 Sep 2008 01:46:21 -0700 (PDT), rog...@googlemail.com wrote:
>> Hello,
>> I need the Weiler-Atherton-Clipping algorithm within IDL. Can somebody
>> submit any kind of ready-to-use code? I would really appreciate it. A
>> good demonstration of the algorithm is shown here:
>> http://research.cs.vt.edu/algoviz/Clip/clipping_applet.html
>
>> Thank you and best regards
>
>> Chris
>
> Maybe not the same algorithm, but the result should be the same:http://www.dfanning.com/graphics_tips/polygonclip.html

Thank you, but unfortunately the use algorithm cannot deal very good
with concave and complicated (self intersecting) polygons. Only Weiler-
Atherton and newer algorithms are able to solve this kind of problem.
The Algorithm is not so much complicated, but in terms of speed it is.
But maybe there are other algorithms like the Sutherland approach?

Thanks nad best regards

Chris
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Re: Changing WIDGET_BUTTON behaviour
Next Topic: problem with online help IDL v7.0

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

Current Time: Wed Oct 08 19:03:32 PDT 2025

Total time taken to generate the page: 0.00480 seconds