CGAL 5.1 - 2D Boolean Operations on Nef Polygons
2D Boolean Operations on Nef Polygons Reference

Michael Seel
A Nef polygon is any set that can be obtained from a finite set of open halfspaces by set complement and set intersection operations. Due to the fact that all other binary set operations like union, difference and symmetric difference can be reduced to intersection and complement calculations, Nef polygons are also closed under those operations. Apart from the set complement operation there are more topological unary set operations that are closed in the domain of Nef polygons interior, boundary, and closure.
Introduced in: CGAL 2.3
BibTeX: cgal:s-bonp2-21b
License: GPL

Classified Reference Pages

Concepts

Classes

Modules

 Concepts
 

Classes

class  CGAL::Extended_cartesian< FT >
 
class  CGAL::Extended_homogeneous< RT >
 
class  CGAL::Filtered_extended_homogeneous< RT >
 
class  CGAL::Nef_polyhedron_2< T >::Topological_explorer
 
class  CGAL::Nef_polyhedron_2< T >::Explorer
 
class  CGAL::Nef_polyhedron_2< T >