## cdd/cddplus

### Summary

The program cdd+ is a C++ implementation of the Double Description

Method of Motzkin et al. for generating all vertices (i.e. extreme points)

and extreme rays of a general convex polyhedron in R^d given by a system

of linear inequalities.

### Authors

Komei Fukuda

### Links

### Status

incomplete information or not officially approved by the authors### Aims and scope

### Mathematical Classification

### Keywords

- adjacency
- computational geometry
- convex hull computation
- convex hull problem
- convex hulls
- convexity
- Delaunay Triangulation
- Double Description Method of Motzkin
- Double Description Method of Motzkin
- dual problem
- extreme points
- extreme rays
- faces
- general convex polyhedra
- general convex polyhedrons
- generate all vertices
- generating all vertices
- H-polyhedra
- hyperplanes
- incidence
- linear programming
- LP solving
- Minkowski sum
- polyhedra
- polyhedral computation
- system of linear inequalities
- Voronoi diagram
- V-polyhedra