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

被引：0

作者：

Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, United States ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 123-137期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Das, G
Goodrich, MT
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 8 (03): : 123 - 137
[2] COLLAPSING 3-DIMENSIONAL CONVEX POLYHEDRA
CHILLING.DR
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1967, 63 : 353 - &
[3] THE NUMBER OF 3-DIMENSIONAL CONVEX POLYHEDRA
BENDER, EA
AMERICAN MATHEMATICAL MONTHLY, 1987, 94 (01): : 7 - 21
[4] COLLAPSING 3-DIMENSIONAL CONVEX POLYHEDRA - CORRECTION
CHILLINGWORTH, DRJ
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1980, 88 (SEP) : 307 - 310
[5] AN OPTIMAL ALGORITHM FOR INTERSECTING 3-DIMENSIONAL CONVEX POLYHEDRA
CHAZELLE, B
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 586 - 591
[6] AN OPTIMAL ALGORITHM FOR INTERSECTING 3-DIMENSIONAL CONVEX POLYHEDRA
CHAZELLE, B
SIAM JOURNAL ON COMPUTING, 1992, 21 (04) : 671 - 696
[7] The computational complexity of basic decision problems in 3-dimensional topology
S. V. Ivanov
Geometriae Dedicata, 2008, 131 : 1 - 26
[8] The computational complexity of basic decision problems in 3-dimensional topology
Ivanov, S. V.
GEOMETRIAE DEDICATA, 2008, 131 (01) : 1 - 26
[9] On the complements of 3-dimensional convex polyhedra as polynomial images of R3
Fernando, Jose F.
Ueno, Carlos
INTERNATIONAL JOURNAL OF MATHEMATICS, 2014, 25 (07)
[10] On the complexity of approximating and illuminating three-dimensional convex polyhedra
Das, G
Goodrich, MT
ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 74 - 85

← 1 2 3 4 5 →