CONVEX PARTITIONS OF POLYHEDRA - A LOWER BOUND AND WORST-CASE OPTIMAL ALGORITHM

被引：135

作者：

CHAZELLE, B

机构：

来源：

关键词：

D O I：

10.1137/0213031

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：488 / 507

页数：20

共 12 条

[1] CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146
[2] CHAZELLE B, CMUCS80150 CARN MELL
[3] CHAZELLE BM, 1980, THESIS YALE U NEW HA
[4] Coxeter H.S.M., 1973, REGULAR POLYTOPES
[5] TRIANGULATING A SIMPLE POLYGON
GAREY, MR
JOHNSON, DS
PREPARATA, FP
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 175 - 179
[6] LINGAS A, 1982, LECT NOTES COMPUT SC, V140, P369
[7] Massey W.S., 1967, ALGEBRAIC TOPOLOGY I
[8] Munkres J.R., 1975, TOPOLOGY 1 COURSE
[9] SOME NP-HARD POLYGON DECOMPOSITION PROBLEMS
OROURKE, J
SUPOWIT, KJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 181 - 190
[10] A NEW APPROACH TO PLANAR POINT LOCATION
PREPARATA, FP
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (03) : 473 - 482