CGAL 4.14 - 2D Arrangements
2D Arrangement Reference
Ron Wein, Eric Berberich, Efi Fogel, Dan Halperin, Michael Hemmer, Oren Salzman, and Baruch Zukerman
This package can be used to construct, maintain, alter, and display arrangements in the plane. Once an arrangement is constructed, the package can be used to obtain results of various queries on the arrangement, such as point location. The package also includes generic implementations of two algorithmic frameworks, that are, computing the zone of an arrangement, and line-sweeping the plane, the arrangements is embedded on. These frameworks are used in turn in the implementations of other operations on arrangements. Computing the overlay of two arrangements, for example, is based on the sweep-line framework. Arrangements and arrangement components can also be extended to store additional data. An important extension stores the construction history of the arrangement, such that it is possible to obtain the originating curve of an arrangement subcurve.
Introduced in: CGAL 2.1
BibTeX: cgal:wfzh-a2-19a
Windows Demo: 2D Arrangements
Common Demo Dlls: dlls

Given a set $$\mathcal{C}$$ of planar curves, the arrangement $${\mathcal A}({\mathcal C})$$ is the subdivision of the plane induced by the curves in $$\mathcal{C}$$ into maximally connected cells. The cells can be $$0$$-dimensional (vertices), $$1$$-dimensional (edges) or $$2$$-dimensional (faces).

The class Arrangement_2<Traits,Dcel> encapsulates a data structure that maintains arrangements of arbitrary bounded planar curves. It comes with a variety of algorithms that operate on planar arrangement, such as point-location queries and overlay computations, which are implemented as peripheral classes or as free (global) functions.

## Modules

Concepts

Traits Classes

DCEL

I/O

Point Location

Overlay
Computes the overlay of two arrangements with history arr1 and arr2, and sets the output arrangement with history res to represent the overlaid arrangement.

Free Functions

Tags

Macros

Enumerations

## Classes

class  CGAL::Arr_accessor< Arrangement >

class  CGAL::Arr_face_index_map< Arrangement >
Arr_face_index_map maintains a mapping of face handles of an attached arrangement object to indices (of type unsigned int). More...

class  CGAL::Arr_observer< Arrangement >

class  CGAL::Arr_vertex_index_map< Arrangement >
Arr_vertex_index_map maintains a mapping of vertex handles of an attached arrangement object to indices (of type unsigned int). More...

class  CGAL::Arrangement_2< Traits, Dcel >

class  CGAL::Arrangement_with_history_2< Traits, Dcel >