Pos	Paper	Citations	Year
1	Voronoi diagrams—a survey of a fundamental geometric data structure	6777	1991
2	Power diagrams: properties, algorithms and applications	1226	1987
3	Voronoi diagrams	1206	1996
4	Voronoi diagrams and Delaunay triangulations	715	2013
5	A novel type of skeleton for polygons	520	1996
6	An optimal algorithm for constructing the weighted Voronoi diagram in the plane	431	1984
7	Minkowski-type theorems and least-squares clustering	318	1998
8	Straight skeletons for general polygonal figures in the plane	294	1996
9	Enumerating order types for small sets with applications	212	2001
10	Handbook of computational geometry	149	2000
11	Medial axis computation for planar free–form shapes	136	2009
12	A criterion for the affine equivalence of cell complexes inR	124	1987
13	A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams	113	1991
14	Quickest paths, straight skeletons, and the city Voronoi diagram	89	2002
15	Cartesian graph factorization at logarithmic cost per edge	86	1992
16	Improved algorithms for discs and balls using power diagrams	78	1988
17	Triangulations intersect nicely	76	1995
18	On the crossing number of complete graphs	74	2006
19	Farthest line segment Voronoi diagrams	69	2006
20	Pseudotriangulations from surfaces and a novel type of edge flip	63	2003
21	Recognising polytopical cell complexes and constructing projection polyhedra	60	1987
22	Voronoi diagrams: a survey	59	1988
23	A new duality result concerning Voronoi diagrams	55	1990
24	On the crossing number of complete graphs	55	2002
25	Geometric relations among Voronoi diagrams	53	1988
26	Divide-and-conquer for Voronoi diagrams revisited	52	2009
27	Sequences of spanning trees and a fixed tree theorem	52	2002
28	Generalized self-approaching curves	42	2001
29	Minkowski-type theorems and least-squares partitioning	42	1992
30	Skew Voronoi diagrams	40	1999
31	Voronoi diagrams for direction-sensitive distances	40	1997
32	Classifying hyperplanes in hypercubes	39	1996
33	Convexity minimizes pseudo-triangulations	38	2004
34	Recognizing binary Hamming graphs inO(n	36	1995
35	Straight skeletons of simple polygons	34	1995
36	Weighted skeletons and fixed-share decomposition	34	2008
37	Edge Operations on Non-Crossing Spanning Trees	31	2000
38	Evolution strategy and hierarchical clustering	30	2002
39	Optimal triangulations	28	2000
40	Gray code enumeration of plane straight-line graphs	27	2007
41	Towards compatible triangulations	26	2003
42	New results on MWT subgraphs	25	1999
43	Optimal graph orientation with storage applications	25	1995
44	Computational and structural advantages of circular boundary representation	24	2007
45	Small weak epsilon-nets	24	2009
46	Computing equivalence classes among the edges of a graph with applications	23	1992
47	On k-convex polygons	23	2012
48	Transforming spanning trees and pseudo-triangulations	23	2006
49	The one-dimensional weighted Voronoi diagram	20	1986
50	Computational and structural advantages of circular boundary representation	19	2011
51	Linear combinations from power domains	19	1988
52	On-line sorting of twisted sequences in linear time	18	1988
53	Recovering Structure from r‐Sampled Objects	18	2009
54	Computational geometry--some easy questions and their recent solutions	15	2001
55	Exact medial axis computation for triangulated solids with respect to piecewise linear metrics	15	2010
56	On triangulation axes of polygons	15	2015
57	Algorithmic fun-abalone	14	2002
58	Faster isometric embedding in products of complete graphs	14	1994
59	Approximating uniform triangular meshes in polygons	13	2002
60	A relationship between Gale transforms and Voronoi diagrams	13	1990
61	Geometric relations among Voronoi diagrams	13	1987
62	Factoring Cartesian-product graphs at logarithmic cost per edge	11	1990
63	Recognizing binary hamming graphs in O(n	11	1990
64	Adapting (pseudo)-triangulations with a near-linear number of edge flips	10	2003
65	Matching edges and faces in polygonal partitions	10	2008
66	Straight skeletons and mitered offsets of nonconvex polytopes	10	2016
67	3-colorability of pseudo-triangulations	9	2015
68	Approximating boundary-triangulated objects with balls	9	2007
69	Constant-level greedy triangulations approximate the MWT well	9	1998
70	On k-convex point sets	9	2014
71	Structure and computation of straight skeletons in 3-space	9	2013
72	Three-dimensional straight skeletons from bisector graphs	9	2013
73	Voronoi diagrams-Computational geometry's favorite	9	2002
74	Arc triangulations	8	2010
75	New results on minimum weight triangulations and the lmt-skeleton	8	1997
76	Niching evolution strategy with cluster algorithms	8	2000
77	On shape Delaunay tessellations	8	2014
78	On the Peeper's Voronoi diagram	8	1991
79	Pseudo-simplicial complexes from maximal locally convex functions	8	2006
80	Triangulations with circular arcs	8	2011
81	Spatial embedding of pseudo-triangulations	7	2003
82	Voronoi diagrams for parallel halflines and line segments in space	7	2017
83	Computing convex quadrangulations	6	2012
84	Connecting colored point sets	6	2007
85	The post office problem for fuzzy point sets	6	1991
86	Using Gale transforms in computational geometry	6	1991
87	A note on visibility-constrained Voronoi diagrams	5	2014
88	Points and combinatorics	5	2002
89	Progress on rectilinear crossing numbers	5	2002
90	Two-convex polygons	5	2009
91	Generalized self-approaching curves	4	1998
92	Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-Algorithmen	4	1987
93	Jordan sorting via convex hulls of certain non-simple polygons	4	1987
94	Mitered offsets and skeletons for circular arc polygons	4	2020
95	New greedy triangulation algorithms	4	1996
96	On computing the convex hull of (piecewise) curved objects	4	2012
97	On (Pointed) Minimum Weight Pseudo-Triangulations	4	2007
98	Straight skeletons for binary shapes	4	2010
99	A new duality result concerning Voronoi diagrams	3	1986
100	Optimal triangulations	3	2001
101	Piecewise-linear farthest-site Voronoi diagrams	3	2021
102	Voronoi diagrams for parallel halflines in 3D	3	2016
103	Arc fibration kernels of arc spline domains	2	2021
104	Computing convex quadrangulations	2	2008
105	On minimum weight pseudo-triangulations	2	2009
106	On the generality of power diagrams	2	1983
107	Polytope offsets and straight skeletons in 3D	2	2014
108	Pre-triangulations and liftable complexes	2	2007
109	An insertion strategy for motorcycle graphs	1	2022
110	Efficient computation of low-order Voronoi diagrams via convex hulls	1	1985
111	Evolution strategy and hierarchical clustering	1	2001
112	Incremental Construction of Motorcycle Graphs	1	2022
113	ϕ-self-approaching curves	1	1997
114	Least-squares partitioning	1	1992
115	Maximal two-guard walks in a polygon	1	2018
116	On merging straight skeletons	1	2018
117	Partially walking a polygon	1	2019
118	phi-Self-Approaching Curves	1	1997
119	Pseudo-tetrahedral complexes	1	2005
120	Recognizing Binary Hamming Graphs in O [formula] Time	1	1989
121	The one-dimensional weighted Voronoi diagram	1	1983
122	Towards compatible triangulations	1	2001
123	Using Gale transforms in computational geometry	1	1988
124	Using scaled embedded distances to generate metrics for R2	1	2013
125	Voronoi 図-一つの基本的な幾何データ構造に関する概論	1	1993
126	Voronoi diagrams for oriented spheres	1	2007
127	28th International Symposium on Algorithms and Computation (ISAAC 2017)	0	2017
128	Adcock, M., R. Cleve, K. Iwama, R. Putra and	0	2006
129	Approximating boundary-triangulated objects with balls	0	2006
130	Computational Geometry	0	2009
131	Computing straight skeletons for arc polygons	0	2017
132	Counting quadrics and Delaunay triangulations and a new convex hull theorem	0	2008
133	Forschungsschwerpunkt S92	0	2006
134	Gray Code Enumeration of Plane Straight-Line Graphs	0	2007
135	Lower and upper bounds on the number of empty cylinders and ellipsoids	0	2009
136	Master index volumes 291–300	0	2003
137	MR2519380 (2010g: 68258) 68U05 (52B05)	0	2009
138	National Research Network S92	0	2013
139	On (pointed) minimum weight pseudo-triangulations	0	2007
140	Polyhedral Offsets and 3D Straight Skeletons	0	2025
141	Pre-triangulations: A generalization of Delaunay triangulations and flips	0	2005
142	Pseudo-simplices and their derivation	0	2003
143	Seed polytopes for incremental approximation	0	2008
144	Special Issue on the 23rd European Workshop on Computational Geometry (EuroCC'07)	0	2009
145	Vertex Splitter for Straight Skeletons in 3-space	0	2017
146	Voronoi diagrams from distance graphs	0	2013
147	Voronoi diagrams from distance graphs	0	2013
148	Voronoi Diagrams from (Possibly Discontinuous) Embeddings	0	2013