A LINEAR-TIME ALGORITHM FOR COMPUTING THE VORONOI DIAGRAM OF A CONVEX POLYGON

被引：162

作者：

AGGARWAL, A

GUIBAS, LJ

SAXE, J

SHOR, PW

机构：

[1] STANFORD UNIV, DEPT COMP SCI, STANFORD, CA 94305 USA

[2] DEC, SYST RES CTR, PALO ALTO, CA 94301 USA

[3] AT&T BELL LABS, MURRAY HILL, NJ 07974 USA

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1989年 / 4卷 / 06期

关键词：

D O I：

10.1007/BF02187749

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：591 / 604

页数：14

共 50 条

[21] A LINEAR TIME ALGORITHM FOR FINDING ALL FARTHEST NEIGHBORS IN A CONVEX POLYGON
AGGARWAL, A
KRAVETS, D
INFORMATION PROCESSING LETTERS, 1989, 31 (01) : 17 - 20
[22] A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
Chih-Hung Liu
Algorithmica, 2020, 82 : 915 - 937
[23] A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
Liu, Chih-Hung
ALGORITHMICA, 2020, 82 (04) : 915 - 937
[24] Spontaneous Construction of Voronoi Diagram for Polygon
Zhao, Ye
Liu, Xin
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONICS AND COMPUTER, 2014, 59 : 125 - 128
[25] A LINEAR-TIME ALGORITHM FOR SOLVING THE STRONG HIDDEN-LINE PROBLEM IN A SIMPLE POLYGON
TOUSSAINT, GT
PATTERN RECOGNITION LETTERS, 1986, 4 (06) : 449 - 451
[26] SIMPLIFIED LINEAR-TIME JORDAN SORTING AND POLYGON CLIPPING
FUNG, KY
NICHOLL, TM
TARJAN, RE
VANWYK, CJ
INFORMATION PROCESSING LETTERS, 1990, 35 (02) : 85 - 92
[27] A linear-time algorithm for computing translocation distance between signed genomes
Li, GJ
Qi, XQ
Wang, XL
Zhu, BH
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 323 - 332
[28] A SIMPLE LINEAR-TIME ALGORITHM FOR COMPUTING THE RNG AND MST OF UNIMODAL POLYGONS
OLARIU, S
INFORMATION PROCESSING LETTERS, 1989, 31 (05) : 243 - 247
[29] A linear-time algorithm for computing the intersection of all odd cycles in a graph
Cai, LZ
Schieber, B
DISCRETE APPLIED MATHEMATICS, 1997, 73 (01) : 27 - 34
[30] AN ALMOST LINEAR-TIME ALGORITHM FOR COMPUTING A DEPENDENCY BASIS IN A RELATIONAL DATABASE
GALIL, Z
JOURNAL OF THE ACM, 1982, 29 (01) : 96 - 102

← 1 2 3 4 5 →