Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
A. Mukhopadhyay, S. Jadhav (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Area Requirement and Symmetry Display of Planar Upward Drawings.”
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
Establishing Order in Planar Subdivisions.
D.G. Kirkpatrick (1988)
Discrete & computational geometry
Similarity:
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Robert E. Tarjan, P. Rosenstiehl (1986)
Discrete & computational geometry
Similarity:
An Equipartition of Planar Sets.
L.J. Schulman (1993)
Discrete & computational geometry
Similarity:
The Maximum Number of Second Smallest Distances in Finite Planar Sets.
P. Brass (1992)
Discrete & computational geometry
Similarity:
An Upper Bound on the Number of Planar K-Sets.
J. Pach, E. Szemeredi, W. Steiger (1992)
Discrete & computational geometry
Similarity:
The characterization of the cut of funnel in a planar semidynamical system
Krzysztof Ciesielski (1990)
Annales Polonici Mathematici
Similarity:
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
A Left-First Search Algorithm for Planar Graphs.
J. Pach, H. de Fraysseix, P.O. de Mendez (1995)
Discrete & computational geometry
Similarity:
Separating Two Simple Polygons by a Sequence of Translations.
R. Pollack, M. Sharir, S. Sifrony (1988)
Discrete & computational geometry
Similarity:
Upward planar drawings and switch-regularity heuristics.
Didimo, Walter (2006)
Journal of Graph Algorithms and Applications
Similarity:
The Worm Problem of Leo Moser.
R. Norwood, G. Poole, M. Laidacker (1992)
Discrete & computational geometry
Similarity: