DYNAMIC ALGORITHMS IN COMPUTATIONAL GEOMETRY

被引：69

作者：

CHIANG, YJ

TAMASSIA, R

机构：

[1] Department of Computer Science, Brown University, Providence

来源：

PROCEEDINGS OF THE IEEE | 1992年 / 80卷 / 09期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/5.163409

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Research on dynamic algorithms for geometric problems has received increasing attention in recent years, and is motivated by many important applications in circuit layout, computer graphics, and computer-aided design. In this paper we survey dynamic algorithms and data structures in the area of computational geometry. Our work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist.

引用

页码：1412 / 1434

页数：23

共 175 条

[1]

ADELSONVELSKII GM, 1962, DOKL AKAD NAUK SSSR+, V146, P263

[2]

Agarwal P. K., 1991, Computational Geometry: Theory and Applications, V1, P65, DOI 10.1016/0925-7721(91)90001-U

[3]

AGARWAL PK, 1991, LECT NOTES COMPUT SC, V519, P379

[4] A LINEAR-TIME ALGORITHM FOR COMPUTING THE VORONOI DIAGRAM OF A CONVEX POLYGON [J].

AGGARWAL, A ;

GUIBAS, LJ ;

SAXE, J ;

SHOR, PW .

DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (06) :591-604

[5]

ANDERSSON A, 1989, LECT NOTES COMPUT SC, V382, P393

[6]

[Anonymous], 1987, EATCS MONOGRAPHS THE

[7] RANDOMIZED SEARCH-TREES [J].

ARAGON, CR ;

SEIDEL, RG .

30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, :540-545

[8]

Aurenhammer F., 1991, P ACM S COMP GEOM N, P142

[9]

BAUMGARTEN H, 1992, PROCEEDINGS OF THE THIRD ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P250

[10] BIASED SEARCH-TREES [J].

BENT, SW ;

SLEATOR, DD ;

TARJAN, RE .

SIAM JOURNAL ON COMPUTING, 1985, 14 (03) :545-568

← 1 2 3 4 5 6 7 8 9 10 →