Pos	Paper	Citations	Year
1	A novel type of skeleton for polygons	520	1996
2	Straight skeletons for general polygonal figures in the plane	294	1996
3	Enumerating order types for small sets with applications	212	2001
4	Medial axis computation for planar free–form shapes	127	2009
5	Matching shapes with a reference point	125	1994
6	The point set order type data base: A collection of applications and results	104	2001
7	Abstract order type extension and new results on the rectilinear crossing number	94	2005
8	Quickest paths, straight skeletons, and the city Voronoi diagram	89	2002
9	Flip distance between triangulations of a simple polygon is NP-complete	82	2015
10	Triangulations intersect nicely	76	1995
11	On the crossing number of complete graphs	74	2006
12	On the number of plane geometric graphs	74	2007
13	A lower bound on the number of triangulations of planar point sets	66	2004
14	Compatible geometric matchings	66	2009
15	New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of K	66	2007
16	Pseudotriangulations from surfaces and a novel type of edge flip	63	2003
17	All good drawings of small complete graphs	57	2015
18	The 2-Page Crossing Number of	57	2013
19	The path of a triangulation	57	1999
20	On the crossing number of complete graphs	55	2002
21	Divide-and-conquer for Voronoi diagrams revisited	52	2009
22	Sequences of spanning trees and a fixed tree theorem	52	2002
23	Shellable Drawings and the Cylindrical Crossing Number of	51	2014
24	Edge-removal and non-crossing configurations in geometric graphs	49	2010
25	Modem illumination of monotone polygons	43	2018
26	Generalized self-approaching curves	42	2001
27	On the number of pseudo-triangulations of certain point sets	41	2008
28	Skew Voronoi diagrams	40	1999
29	Voronoi diagrams for direction-sensitive distances	40	1997
30	Classifying hyperplanes in hypercubes	39	1996
31	Extremal properties of 0/1-polytopes of dimension 5	39	2000
32	Convexity minimizes pseudo-triangulations	38	2004
33	Large bichromatic point sets admit empty monochromatic 4-gons	38	2010
34	The zigzag path of a pseudo-triangulation	38	2003
35	A quadratic distance bound on sliding between crossing-free spanning trees	35	2007
36	Empty monochromatic triangles	35	2009
37	Long proteins with unique optimal foldings in the HP model	35	2003
38	Reconfiguring convex polygons	34	2001
39	Straight skeletons of simple polygons	34	1995
40	On the number of plane graphs	33	2006
41	Edge Operations on Non-Crossing Spanning Trees	31	2000
42	A simple linear time greedy triangulation algorithm for uniformly distributed points	30	1995
43	Evolution strategy and hierarchical clustering	30	2002
44	Packing plane spanning trees and paths in complete geometric graphs	30	2017
45	Minimization and maximization versions of the quadratic travelling salesman problem	28	2017
46	Gray code enumeration of plane straight-line graphs	27	2007
47	Convexifying Polygons Without Losing Visibilities	26	2011
48	On k-gons and k-holes in point sets	26	2015
49	Towards compatible triangulations	26	2003
50	Flipturning polygons	25	2002
51	New results on MWT subgraphs	25	1999
52	Optimal graph orientation with storage applications	25	1995
53	Twisted ways to find plane structures in simple drawings of complete graphs	25	2024
54	An ongoing project to improve the rectilinear and the pseudolinear crossing constants	24	2019
55	Computational and structural advantages of circular boundary representation	24	2007
56	A superlinear lower bound on the number of 5-holes	23	2020
57	On k-convex polygons	23	2012
58	Transforming spanning trees and pseudo-triangulations	23	2006
59	Bishellable drawings of	22	2018
60	Degree Bounds for Constrained Pseudo-Triangulations	22	2003
61	Theta-3 is connected	22	2014
62	Flip distances between graph orientations	21	2021
63	Hardness of token swapping on trees	21	2021
64	On flips in polyhedral surfaces	20	2002
65	4-holes in point sets	19	2014
66	Blocking delaunay triangulations	19	2013
67	Computational and structural advantages of circular boundary representation	19	2011
68	Non-Shellable Drawings of Kn with Few Crossings	19	2014
69	Disjoint compatibility graph of non-crossing matchings of points in convex position	18	2014
70	Games on triangulations	18	2005
71	Improved upper bounds on the reflexivity of point sets	18	2009
72	Recovering Structure from r‐Sampled Objects	18	2009
73	Triangulations without pointed spanning trees	18	2008
74	Decompositions, partitions, and coverings with convex polygons and pseudo-triangles	17	2007
75	[Empty][colored] k-gons-Recent results on some Erd˝ os-Szekeres type problems	17	2009
76	Flipping plane spanning paths	17	2023
77	Geodesic-preserving polygon simplification	17	2014
78	Lower bounds for the number of small convex k-holes	17	2014
79	More on the crossing number of Kn: Monotone drawings	17	2013
80	New results on lower bounds for the number of (≤ k)-facets	17	2009
81	Reconfiguration of non-crossing spanning trees	17	2022
82	Deciding monotonicity of good drawings of the complete graph	16	2015
83	Empty triangles in good drawings of the complete graph	16	2015
84	On the number of triangulations every planar point set must have	16	2001
85	An improved lower bound on the minimum number of triangulations	15	2016
86	An optimal algorithm for reconstructing point set order types from radial orderings	15	2017
87	Exact medial axis computation for triangulated solids with respect to piecewise linear metrics	15	2010
88	Edge partitions of complete geometric graphs	14	2022
89	Reprint of: Extreme point and halving edge search in abstract order types	14	2014