CGAL users discussion list

[alexalexalex <>]

My problem:

There is a 2D plane with a coordinate system (x,y or latitude, longitude)
with many polygons within, that define areas: some of the polygons are
within polygons; and some of the polygons overlap other polygons; and some
polygons share coordinates to define their common edges. I want to input a
coordinate, then output a list of polygons (by id) that contain the input
coordinate point. 

I understand that this could be; a simple PIP problem; or maybe a "convert
two overlapping polygons to three polygons" (like an intersection problem i
think) then a PIP problem; or maybe there is a method unknown to me. 

My specialty is not computer science or mathematics (but mech. eng.),
otherwise I might know how to choose a solution. To my question: can CGAL be
used to solve this type of problem?

I thank you for your time.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Is-CGAL-the-best-solution-to-my-problem-tp4656882.html
Sent from the cgal-discuss mailing list archive at Nabble.com.