mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-09 23:22:10 +00:00
e8ef531436
graph of a polygon; this graph is used to test whether the interior of a polygon is connected; algorithmic modeling: given a polygon, define its free space connectivity graph as follows: * add a graph vertex for the exterior of the polygon * add a graph vertex for every hole * add a graph vertex for each point of contact between two polygon rings * add a graph edge between every free space component (exterior or hole) and every point of contact on the boundary of this component * determining whether the polygon has connected interior amounts to testing whether the graph is acyclic
#
Boost.Geometry, part of collection of the Boost C++ Libraries, defines concepts, primitives and algorithms for solving geometry problems.
Directories
- doc - QuickBook documentation sources
- examples - Boost.Geometry examples
- extensions - examples and tests for the extensions - develop branch
- include - the sourcecode of Boost.Geometry
- index - examples and tests for the Spatial Index
- test - Boost.Geometry unit tests