## On the Complexity of Optimization Problems for 3-Dimensional Convex Polyhedra and Decision Trees (1995)

Venue: | Comput. Geom. Theory Appl |

Citations: | 14 - 0 self |

### BibTeX

@ARTICLE{Das95onthe,

author = {Gautam Das and Michael T. Goodrich},

title = {On the Complexity of Optimization Problems for 3-Dimensional Convex Polyhedra and Decision Trees},

journal = {Comput. Geom. Theory Appl},

year = {1995},

volume = {8},

pages = {8--123}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. Key words: Convex polyhedra, approximation, Steinitz's theorem, planar graphs, art gallery theorems, decision trees. 1 Introduction Convex polyhedra are fundamental geometric structures (e.g., see [20]). They are the product of convex hull algorithms, and are key components for problems in robot motion planning and computer-aided geometric design. Moreover, due to a beautiful theorem of Steinitz [20, 38], they provide a strong link between computational geometry and graph theory, for Steinitz shows that a graph forms the edge structure of a convex polyhedra if and only if it is planar and 3-connected. Unfortunately, algorithmic problems dealing with 3-dimensional convex polyhedra ...

### Citations

8828 |
Introduction to algorithms
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ... s." 2. We then radix sort into a list L all the labels computed in the previous step together with all the existing adjacencies in G, lexicographically. This takes O(n) time (e.g., see Cormen et=-= al. [10]). 3. For -=-any match of a real adjacency (s i ; s j ) with a candidate disqualifying adjacency (s i ; s j ; s) we mark the edge (s j ; s) as "disqualified." We remove all the (s i ; s j ) and (s i ; s ... |

5220 |
C4.5: programs for machine learning
- Quinlan
(Show Context)
Citation Context ...ith the more-complex object. In addition, there has been considerable work in machine learning directed at the design of small linear decision trees to represent a multi-category point set (e.g., see =-=[5, 6, 8, 21, 29, 32, 33, 34, 35, 36]-=-). In this paper we formally establish that several natural problems on convex polyhedra are provably difficult, including several problems involving the approximation and illumination of convex polyh... |

4155 |
Classi and Regression Trees
- Breiman, Friedman, et al.
- 1984
(Show Context)
Citation Context ...ith the more-complex object. In addition, there has been considerable work in machine learning directed at the design of small linear decision trees to represent a multi-category point set (e.g., see =-=[5, 6, 8, 21, 29, 32, 33, 34, 35, 36]-=-). In this paper we formally establish that several natural problems on convex polyhedra are provably difficult, including several problems involving the approximation and illumination of convex polyh... |

3509 | Induction of decision trees
- Quinlan
- 1986
(Show Context)
Citation Context ...ith the more-complex object. In addition, there has been considerable work in machine learning directed at the design of small linear decision trees to represent a multi-category point set (e.g., see =-=[5, 6, 8, 21, 29, 32, 33, 34, 35, 36]-=-). In this paper we formally establish that several natural problems on convex polyhedra are provably difficult, including several problems involving the approximation and illumination of convex polyh... |

407 |
Art Gallery Theorems and Algorithms
- O’Rourke
- 1987
(Show Context)
Citation Context ...m of finding the minimum number of vertex lamps needed to illuminate a convex polyhedron, which is a problem studied by Grunbaum and O'Rourke and featured in O'Rourke's book on "art gallery"=-= theorems [30]-=-, where they show that, for a convex polyhedron P with f faces in IR 3 , b(2f \Gamma 4)=2c vertices are sometimes necessary and always sufficient to see the exterior of P . In Section 4, we show that ... |

262 | Convex Polytopes
- Grünbaum
- 2003
(Show Context)
Citation Context ...t. Key words: Convex polyhedra, approximation, Steinitz's theorem, planar graphs, art gallery theorems, decision trees. 1 Introduction Convex polyhedra are fundamental geometric structures (e.g., see =-=[20]-=-). They are the product of convex hull algorithms, and are key components for problems in robot motion planning and computer-aided geometric design. Moreover, due to a beautiful theorem of Steinitz [2... |

259 | Optimal search in planar subdivisions
- Kirkpatrick
- 1983
(Show Context)
Citation Context ... is polynomial in n. The running time is O(n) in the rational-RAM model. Before we prove this theorem we present the following graph-theoretic lemma, which has been proven in various forms (e.g., see =-=[16, 24]-=-). 2 Lemma 2.2 Given a n-vertex planar graph G = (V; E), one can compute in linear time an independent set with at least n=18 vertices such that each vertex has degrees8. The above lemma is crucial to... |

259 | A System for Induction of Oblique Decision Trees
- Murthy, Kasif, et al.
- 1994
(Show Context)
Citation Context |

196 |
The rectilinear Steiner tree problem is NP-complete
- Garey, Johnson
- 1977
(Show Context)
Citation Context ...or 3connected planar graphs, and show how this can be used to further extend the NPcompleteness of vertex covering to convex polyhedra in IR 3 . This extends the previous results of Garey and Johnson =-=[18]-=- and Garey, Johnson, and Stockmeyer [19], which showed that the vertex cover problem remains NP-complete for planar graphs with degree at most three. 3.1 Vertex Cover for 3-connected planar graphs Our... |

190 |
Constructing optimal binary decision trees is NPcomplete
- Hyafil, Rivest
- 1976
(Show Context)
Citation Context ...en set to multi-category points in IR 3 (indeed, we define the problem for two categories: "red" and "blue"). It is well known, for example, that constructing a best decision tree =-=in general settings [22, 23]-=- or in arbitrary dimensions [7, 26] is NP-complete, but in the context of fixed-dimensional decision-tree approximations, however, each of these NP-completeness proofs fail. Indeed, each of their resp... |

160 | Optimal set covers in finite VC-dimension
- Brönnimann, Goodrich
- 1995
(Show Context)
Citation Context ...tally, another well-known instance of a geometric optimization problem for polyhedra, which we did not consider is polyhedral separability, which has been the subject of extensive research, e.g., see =-=[1, 9, 15, 17, 26, 28, 27, 31]-=-. For example, a heavily-studied 12 instance of this problem is that one given two concentric polyhedra, and one wishes to find a separating polyhedra with minimum faces nested between the two. The ne... |

133 |
Algorithms in Combinatorial Geometry, volume 10
- Edelsbrunner
- 1987
(Show Context)
Citation Context ... is polynomial in n. The running time is O(n) in the rational-RAM model. Before we prove this theorem we present the following graph-theoretic lemma, which has been proven in various forms (e.g., see =-=[16, 24]-=-). 2 Lemma 2.2 Given a n-vertex planar graph G = (V; E), one can compute in linear time an independent set with at least n=18 vertices such that each vertex has degrees8. The above lemma is crucial to... |

110 | A survey of Decision Tree Classifier Methodology
- Safavian, Landgrebe
- 1991
(Show Context)
Citation Context |

96 | Congruence, similarity and symmetries of geometric objects
- ALT, MEHLHORN, et al.
- 1988
(Show Context)
Citation Context ...nds upon particular optimization criteria and the geometric properties of P . For example, there have been many results describing and analyzing various approximation schemes for polyhedra (e.g., see =-=[1, 2, 3, 4, 11, 13, 14, 25, 27]-=-). These schemes find applications in robotics and motion planning, solid modeling, surface approximations, and computational geography. We are in particular concerned with the combinatorialssimplicit... |

94 | Surface approximation and geometric partitions
- Agarwal, Suri
- 1998
(Show Context)
Citation Context ...nds upon particular optimization criteria and the geometric properties of P . For example, there have been many results describing and analyzing various approximation schemes for polyhedra (e.g., see =-=[1, 2, 3, 4, 11, 13, 14, 25, 27]-=-). These schemes find applications in robotics and motion planning, solid modeling, surface approximations, and computational geography. We are in particular concerned with the combinatorialssimplicit... |

86 | Induction of oblique decision trees
- Heath, Kasif, et al.
- 1993
(Show Context)
Citation Context |

82 |
Vorlesungen über die Theorie der Polyeder
- Steinitz, Rademacher
- 1934
(Show Context)
Citation Context ...0]). They are the product of convex hull algorithms, and are key components for problems in robot motion planning and computer-aided geometric design. Moreover, due to a beautiful theorem of Steinitz =-=[20, 38]-=-, they provide a strong link between computational geometry and graph theory, for Steinitz shows that a graph forms the edge structure of a convex polyhedra if and only if it is planar and 3-connected... |

79 |
Fast detection of polyhedral intersection
- Dobkin, Kirkpatrick
- 1983
(Show Context)
Citation Context ...tally, another well-known instance of a geometric optimization problem for polyhedra, which we did not consider is polyhedral separability, which has been the subject of extensive research, e.g., see =-=[1, 9, 15, 17, 26, 28, 27, 31]-=-. For example, a heavily-studied 12 instance of this problem is that one given two concentric polyhedra, and one wishes to find a separating polyhedra with minimum faces nested between the two. The ne... |

72 |
Approximate matching of polygonal shapes
- Alt, Behrends, et al.
- 1995
(Show Context)
Citation Context ...nds upon particular optimization criteria and the geometric properties of P . For example, there have been many results describing and analyzing various approximation schemes for polyhedra (e.g., see =-=[1, 2, 3, 4, 11, 13, 14, 25, 27]-=-). These schemes find applications in robotics and motion planning, solid modeling, surface approximations, and computational geography. We are in particular concerned with the combinatorialssimplicit... |

40 |
Decision tree construction via linear programming
- Bennett
- 1992
(Show Context)
Citation Context |

40 | On the complexity of polyhedral separability
- Megiddo
- 1988
(Show Context)
Citation Context ...R 3 (indeed, we define the problem for two categories: "red" and "blue"). It is well known, for example, that constructing a best decision tree in general settings [22, 23] or in a=-=rbitrary dimensions [7, 26]-=- is NP-complete, but in the context of fixed-dimensional decision-tree approximations, however, each of these NP-completeness proofs fail. Indeed, each of their respective optimization problems are po... |

33 |
Training a 3-node neural net is NP-Complete
- Blum, Rivest
- 1989
(Show Context)
Citation Context ...R 3 (indeed, we define the problem for two categories: "red" and "blue"). It is well known, for example, that constructing a best decision tree in general settings [22, 23] or in a=-=rbitrary dimensions [7, 26]-=- is NP-complete, but in the context of fixed-dimensional decision-tree approximations, however, each of these NP-completeness proofs fail. Indeed, each of their respective optimization problems are po... |

33 |
On the complexity of loading shallow neural networks
- Judd
- 1988
(Show Context)
Citation Context ...en set to multi-category points in IR 3 (indeed, we define the problem for two categories: "red" and "blue"). It is well known, for example, that constructing a best decision tree =-=in general settings [22, 23]-=- or in arbitrary dimensions [7, 26] is NP-complete, but in the context of fixed-dimensional decision-tree approximations, however, each of these NP-completeness proofs fail. Indeed, each of their resp... |

32 |
Minimum polygon separation
- Edelsbrunner, Preparata
- 1987
(Show Context)
Citation Context ...tally, another well-known instance of a geometric optimization problem for polyhedra, which we did not consider is polyhedral separability, which has been the subject of extensive research, e.g., see =-=[1, 9, 15, 17, 26, 28, 27, 31]-=-. For example, a heavily-studied 12 instance of this problem is that one given two concentric polyhedra, and one wishes to find a separating polyhedra with minimum faces nested between the two. The ne... |

31 |
Separation and approximation of polyhedral surfaces
- Mitchell, Suri
- 1995
(Show Context)
Citation Context |

30 |
The complexity of minimum convex nested polyhedra
- Das, Joseph
- 1990
(Show Context)
Citation Context ...gulation, and the version presented in [11] does not run in polynomial time. Theorem 2.1 can be used to correct this flaw in the proof, as is shown in a revised version of the proof of Das and Joseph =-=[12]-=-. Acknowledgements We would like to thank Marek Chrobak for his encouragement and his diligence in pointing out places in previous versions of this paper that needed more details. The second author wo... |

28 |
C.K.: Finding minimal convex nested polygons
- Aggarwal, Booth, et al.
- 1989
(Show Context)
Citation Context |

17 |
Intersection detection and separators for simple polygons
- Mount
- 1992
(Show Context)
Citation Context |

15 | Global tree optimization: a non-greedy decision tree algorithm
- Bennett
- 1994
(Show Context)
Citation Context |

15 |
Finding the smallest triangles containing a given convex polygon
- Klee, Laskowski
- 1985
(Show Context)
Citation Context |

12 |
Minimum vertex hulls for polyhedral domains
- Das, Joseph
- 1990
(Show Context)
Citation Context |

10 | Decision trees for automated identification of cosmic-ray hits in Hubble Space Telescope images
- Salzberg, Chandar, et al.
- 1995
(Show Context)
Citation Context |

7 |
Approximation schemes in computational geometry
- Das
- 1990
(Show Context)
Citation Context |

3 |
The Computational Geometry Column #4
- O’Rourke
- 1988
(Show Context)
Citation Context |

2 |
An e#cient simplex coverability algorithm in E with application to stochastic sequential machines
- Silio
- 1979
(Show Context)
Citation Context ... minimum faces nested between the two. The nested polyhedral separability problem that we consider was first raised by Victor Klee [31], which arose during the study of sequential stochastic automata =-=[37]-=-. In two dimensions, this problem has been solved in polynomial time by Aggarwal et al [2]. Das and Joseph [11, 13] proved the interesting result that the problem is NP-hard for three dimensions, even... |

1 |
Some simpligied NP-complete graph problems
- Garey, Johnson, et al.
- 1976
(Show Context)
Citation Context ...w this can be used to further extend the NPcompleteness of vertex covering to convex polyhedra in IR 3 . This extends the previous results of Garey and Johnson [18] and Garey, Johnson, and Stockmeyer =-=[19]-=-, which showed that the vertex cover problem remains NP-complete for planar graphs with degree at most three. 3.1 Vertex Cover for 3-connected planar graphs Our reduction is actually a chain of reduct... |