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 #62454 is a reply to message #62447] Tue, 09 September 2008 06:40 Go to previous messageGo to previous message
wlandsman is currently offline  wlandsman
Messages: 743
Registered: June 2000
Senior Member
> But maybe there are other algorithms like the Sutherland approach?

As noted on David Fanning's webpage mentioned above there are IDL
implementations of Sutherland-Hodgman polygon clipping from both JD
Smith ( http://turtle.as.arizona.edu/jdsmith/scraps.php) and Mark
Hadfield. JD Smith also provides a C version polyclip.c which is
50 (!) times faster, and callable from IDL via call_external.

Since the Weiler-Atherton algorithm is even more computationally
intensive than Sutherland-Hodgman, I suspect one would want a C
version linked to IDL (or to convince ITTVIS to implement it
natively!)

--Wayne


>
> 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: Fri Oct 10 00:03:42 PDT 2025

Total time taken to generate the page: 1.11980 seconds