The concept PMPHolefillingVisitor
defines the requirements for the visitor used in holefillingrelated functions . The hole filling may use a 2D constrained triangulation for almost planar holes (planar phase). If that is not appropriate or fails it may use an algorithm with a quadratic running time relying on the 3D Delaunay triangulation (quadratic phase). If that fails, it uses an algorithm with cubic running time (cubic phase).
 Refines:
CopyConstructible
 Has Models:
CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor
.
◆ end_planar_phase()
void PMPHolefillingVisitor::end_planar_phase 
( 
bool 
success  ) 
const 
called when the planar hole filling algorithm stops.
 Parameters

success  true when the hole could be filled in this phase. 
◆ end_quadratic_phase()
void PMPHolefillingVisitor::end_quadratic_phase 
( 
bool 
success  ) 
const 
called when the algorithm with quadratic running time ends.
 Parameters

success  true when the hole could be filled in this phase. 
◆ quadratic_step()
void PMPHolefillingVisitor::quadratic_step 
( 
 ) 
const 
called at each step.
There may be less than n
calls as this is an upperbound.
◆ start_cubic_phase()
void PMPHolefillingVisitor::start_cubic_phase 
( 
std::size_t 
n  ) 
const 
called when the algorithm with cubic running time starts.
 Parameters

n  the upperbound on the number of steps 
◆ start_quadratic_phase()
void PMPHolefillingVisitor::start_quadratic_phase 
( 
std::size_t 
n  ) 
const 
called when the algorithm with quadratic running time starts.
 Parameters

n  the upperbound on the number of steps 