CGAL users discussion list

[Winnie Hellmann <>]

> arr.insert_in_face_interior(x) can be used under the severe
> restriction that x does not intersect with an existing feature.
Thank you, I did not know that!

> If you are in doubt, use CGAL::insert_point(p).
... which has a complexity of O(log n) instead of O(1) because of
point-location, right? Since my algorithm needs to run in linear time,
all insertions have to be in constant time.

> If you need to know whether p collides with an existing vertex or lie on an
> existing curve, locate p beforehand using some point-location strategy.
I can not do this with the same argument as above: As far as I know, all
point-location algorithms take at least O(log n) time.

Thank you in advance for any further help!

-- 
PGP key: http://www.winniehell.de/0xA8FE4F09.pub.asc

Attachment: signature.asc
Description: OpenPGP digital signature