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. But it would require that I
insert each vertex at least twice (in the arangement and the set) -
which would be a lot of extra space for doing this simple check.

However I would use this solution in case there is no other (more
elegant) way to prevent the arrangement from having duplicate vertices.

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

Attachment: signature.asc
Description: OpenPGP digital signature