Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities.
Gennadiy AverkovMartin HenkPublished in: Discret. Comput. Geom. (2009)
Keyphrases
- three dimensional
- sufficient conditions
- subtour elimination
- linear inequalities
- d objects
- human body
- virtual reality
- image sequences
- convex polyhedra
- special case
- risk bounds
- range images
- extreme points
- low order
- linear systems
- mixed integer
- geometric properties
- surface reconstruction
- convex hull
- real time
- multi view
- viewpoint
- data sets