On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees

被引：28
|
作者：
Das, G
Goodrich, MT
机构：
[1] JOHNS HOPKINS UNIV, DEPT COMP SCI, BALTIMORE, MD 21218 USA
[2] MEMPHIS STATE UNIV, DEPT MATH SCI, MEMPHIS, TN 38152 USA
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1997年 / 8卷 / 03期
基金：
美国国家科学基金会;
关键词：
convex polyhedra; approximation; Steinitz's theorem; planar graphs; art gallery theorems; decision trees;
D O I：
10.1016/S0925-7721(97)00006-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We show that several well-known optimization problems involving 3-dimensional convex polyhedra and decision trees are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron, which may be of independent interest. (C) 1997 Published by Elsevier Science B.V.
引用
收藏
页码：123 / 137
页数：15
相关论文
共 50 条
12345