Two Algorithms for Decomposing a Polyhedron into Convex Parts.
Márta Szilvási-NagyPublished in: Comput. Graph. Forum (1986)
Keyphrases
- computational cost
- convex hull
- graph theory
- computational complexity
- theoretical analysis
- orders of magnitude
- recently developed
- data structure
- optimization problems
- computational efficiency
- times faster
- convex optimization problems
- optimization methods
- computationally expensive
- convex optimization
- search algorithm
- image processing
- learning algorithm