Approximation algorithms for developable surfaces.
Helmut PottmannJohannes WallnerPublished in: Comput. Aided Geom. Des. (1999)
Keyphrases
- approximation algorithms
- np hard
- special case
- surface shape
- minimum cost
- worst case
- vertex cover
- set cover
- approximation ratio
- approximation schemes
- facility location problem
- network design problem
- exact algorithms
- primal dual
- precedence constraints
- np hardness
- surface reconstruction
- open shop
- randomized algorithms
- optimal solution
- curved surfaces
- network flow
- constant factor
- polynomial time approximation
- computational complexity