|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Shared Bowyer-Watson core parameterized by in-circle predicate. More...
#include <geom_algorithms.H>
Classes | |
| struct | CmpUndirectedEdge |
| struct | UndirectedEdge |
| struct | WorkTriangle |
Static Public Member Functions | |
| template<typename IndexedTriangle , typename InCirclePredicate > | |
| static Array< IndexedTriangle > | triangulate (Array< Point > pts, const size_t n, InCirclePredicate point_in_circumcircle) |
Private Types | |
| using | EdgeSet = DynSetTree< UndirectedEdge, Treap_Rk, CmpUndirectedEdge > |
Static Private Member Functions | |
| static void | toggle_edge (EdgeSet &boundary, size_t u, size_t v) |
Shared Bowyer-Watson core parameterized by in-circle predicate.
Definition at line 410 of file geom_algorithms.H.
|
private |
Definition at line 437 of file geom_algorithms.H.
|
inlinestaticprivate |
Definition at line 439 of file geom_algorithms.H.
References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::search().
Referenced by triangulate().
|
inlinestatic |
Definition at line 458 of file geom_algorithms.H.
References Aleph::Array< T >::append(), Aleph::COLLINEAR, Aleph::CW, Aleph::divide_and_conquer_partition_dp(), FunctionalMethods< Container, T >::for_each(), Aleph::orientation(), Aleph::Array< T >::reserve(), Aleph::Array< T >::size(), toggle_edge(), Aleph::GeomBowyerWatsonUtils::UndirectedEdge::u, and Aleph::GeomBowyerWatsonUtils::UndirectedEdge::v.