mirror of https://github.com/CGAL/cgal
535c5bb5b2
... by a factor 5 for big triangulations! The old code was using:
std::map<size_t, Vertex_handle> V;
std::map<size_t, Cell_handle> C;
whereas the indices are contiguous: from 0 to n. `std::vector` is a lot
better for that use case!
|
||
|---|---|---|
| .. | ||
| demo/Polyhedron | ||
| doc/Polyhedron | ||
| examples/Polyhedron | ||
| include/CGAL | ||
| package_info/Polyhedron | ||
| test/Polyhedron | ||
| dont_submit | ||