Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by roboticus (Chancellor)
on Aug 28, 2006 at 15:16 UTC ( #569996=note: print w/ replies, xml ) Need Help??


in reply to Re: Speeding up point-in-polygon -- take two
in thread Speeding up point-in-polygon -- take two

Okay--Yet another thought (and then I promise I'll shut up for a while!).

How important are exact results? If somewhat "fuzzy" edges are acceptable, you could use a quadtree, and just insert enough nodes to get the precision you want. Then you'd only need a select statement to determine whether your point is internal to the polygon.

--roboticus

Who intends to stop thinking about this question for at least an hour!


Comment on Re^2: Speeding up point-in-polygon -- take two

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (16)
As of 2015-07-28 20:49 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 (258 votes), past polls