Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Speeding up point-in-polygon -- take two

by hardburn (Abbot)
on Aug 28, 2006 at 15:04 UTC ( #569993=note: print w/ replies, xml ) Need Help??


in reply to Speeding up point-in-polygon -- take two

Using a bounding box is a good start, but a bounding circle should be even better. A circle only needs to test one dimention:

if( $circle->distance_from_center( $x, $y ) <= $circle->radius ) { # Point ($x, $y) is in circle }

I've also found that dropping some of the calculations into C can speed it up quite a bit without being terribly complex to interface back to Perl.

"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.


Comment on Re: Speeding up point-in-polygon -- take two
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://569993]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (18)
As of 2015-07-07 17:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (92 votes), past polls