Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm 论文

1984SIAM Journal on Computing引用 241
Computational Geometry and Mesh GenerationOptimization and Packing ProblemsAdvanced Graph Theory Research

Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm · 相关技术