Reference Manual

Pierre Alliez, David Cohen-Steiner, Michael Hemmer, Cédric Portaneri, and Mael Rouxel-Labbé

This component takes a polygon soup, a 2D segment soup, and/or a 2D point set as input, and generates a valid (watertight, intersection-free and 1-manifold) multi-polygon that strictly encloses the input. The algorithm proceeds by shrink-wrapping and refining a 2D Delaunay triangulation starting from a loose bounding box of the input. Two user-defined parameters, alpha and offset, offer control over the maximum size of cavities where the shrink-wrapping process can enter, and the tightness of the final polygon(s) to the input, respectively. Once combined, these parameters provide a means to trade fidelity to the input for complexity of the output.

Introduced in: CGAL 6.2
Depends on: 2D Triangulations and 2D Polygon Repair
BibTeX: cgal:achpr-aw2-25b
License: GPL

Classified Reference Pages

Functions

• CGAL::alpha_wrap_2()

Modules
	Free Functions
	Functions to create a wrap from point clouds, segment soups, and polygons with holes.