Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

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

by eric256 (Parson)
on Aug 30, 2006 at 16:45 UTC ( #570418=note: print w/ replies, xml ) Need Help??


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

3d renderers do this all the time and normaly pretty darn fast. Just polygons + a raycast to determine which polygon you hit. Why not break down the polygon into triagles and then sort those with a b-tree? Isn't that still how 3d games handle the process? Alternatly just use a 3d engine and load all the polygons in and raytrace ;) but that seems silly.


___________
Eric Hodges


Comment on Re: Speeding up point-in-polygon -- take two
Re^2: Speeding up point-in-polygon -- take two
by Anonymous Monk on Jun 02, 2009 at 13:55 UTC
    Years later... I don't think that the ray projection will work without a method to see if the ray passes between two points that may make up the vertices of the polygon. - lartnec

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2014-11-27 18:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (186 votes), past polls