CGAL users discussion list

[vanimurarka <>]

Hi,

Is there a way I can query a polyhedron model to check whether a point
exists as a vertex in the polyhedron?

I looked into the documentation and could not seem to find any direct query.
I do not really want to iterate over the whole set of vertices because this
query needs to be done repeatedly in the algorithm I am implementing. 

If there is no direct query, what are the suggestions for the shortest /
most efficient way of obtaining this information?

At present, the best I can think of is to maintain a separate HashTable of
the vertices added to the polyhedron, where the x-y-z co-ordinate of the
vertex is concatinated as a string to serve as the key of the HashTable.
Then when I have a new point, I can use its co-ordinate values to query the
HashTable. However, I might possibly run into accuracy issues.

Thanks

Vani
-- 
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Checking-for-a-vertex-in-a-Polyhedron-tp3262000p3262000.html
Sent from the cgal-discuss mailing list archive at Nabble.com.