Publication | Closed Access
Finding minimal triangulations of convex 3-polytopes is NP-hard
14
Citations
0
References
2000
Year
Geometric ModelingMathematical ProgrammingEngineeringGraph TheoryGeometric AlgorithmNatural SciencesDelaunay TriangulationConvex HullDiscrete MathematicsCombinatorial OptimizationComputational GeometryMinimal Triangulations
No additional data available for this publication yet. Check back later!