CGAL users discussion list

[Winnie Hellmann <>]

>> std::set<Point> unique_points;
>> if (unique_points.size() != L.size())
> Thank you, that would indeed be a solution.
After rethinking this - that does not solve my problem. Because
inserting in std::set does take O(log n) the insertion of all points
would take O(n log n) - which is more than I can afford.

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

Attachment: signature.asc
Description: OpenPGP digital signature