arrange_poly: Refactor into logical blocks; add timing

This commit is contained in:
Thomas Krijnen
2026-02-10 14:01:10 +01:00
parent c6072e416c
commit e6780973da
2 changed files with 825 additions and 965 deletions
File diff suppressed because it is too large Load Diff
+12
View File
@@ -2,8 +2,10 @@
#define GRAPH_2D_H
#ifdef SVGFILL_DEBUG
#if 0
#include <nlohmann/json.hpp>
#endif
#endif
template <typename Kernel>
class Graph2D {
@@ -334,6 +336,16 @@ public:
return Graph2D(input_adjacency_list);
}
template <typename T>
void to_arrangement(T& arr) {
for (auto it = edges_begin(); it != edges_end(); ++it) {
if (it->first == it->second) {
continue;
}
CGAL::insert(arr, CGAL::Segment_2<Kernel>(it->first, it->second));
}
}
void assert_symmetric() {
#ifdef SVGFILL_DEBUG
#if 0