LEDA Guide: Geometry Algorithms

> LEDA Guide > Geometry Algorithms

The Geometry Algorithms

All geometry algorithms work for geometric objects based on both the floating point and the rational kernel.

Geometry Algorithms provided by LEDA:

Convex Hulls and The Width of a Point Set
Triangulations
Delaunay Triangulations
Delaunay Diagrams and Euclidean Minimum Spanning Trees
Voronoi Diagrams

Extremal Circles
Minimum Width and Minimum Area Annuli
Curve Reconstruction

Duality between Voronoi and Delaunay Diagrams
Line Segment Intersection
Verification of Geometric Structures
Convex Components
Minkowski Sums
Closest Pairs

See also:

Data types for 2-D geometry

Advanced Data Types for 2-D Geometry

Data Types for 3-D Geometry

Number Types

Manual Page of Geometry Algorithms