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!
|
||
|---|---|---|
| .. | ||
| IO | ||
| constructions | ||
| internal | ||
| predicates | ||
| Delaunay_triangulation_3.h | ||
| Delaunay_triangulation_cell_base_3.h | ||
| Delaunay_triangulation_cell_base_with_circumcenter_3.h | ||
| Regular_triangulation_3.h | ||
| Regular_triangulation_cell_base_3.h | ||
| Regular_triangulation_cell_base_with_weighted_circumcenter_3.h | ||
| Regular_triangulation_euclidean_traits_3.h | ||
| Triangulation_3.h | ||
| Triangulation_cell_base_3.h | ||
| Triangulation_cell_base_with_circumcenter_3.h | ||
| Triangulation_cell_base_with_info_3.h | ||
| Triangulation_geom_traits_3.h | ||
| Triangulation_hierarchy_3.h | ||
| Triangulation_hierarchy_vertex_base_3.h | ||
| Triangulation_simplex_3.h | ||
| Triangulation_utils_3.h | ||
| Triangulation_vertex_base_3.h | ||
| Triangulation_vertex_base_with_info_3.h | ||