Polygonizations of Point Sets in the Plane.
L. Deneen, Gary Shute (1988)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “There Exist 6n/13 Ordinary Points.”
Polygonizations of Point Sets in the Plane.
On Translating One Polyomino To Tile the Plane.
D. Beauquier, M. Nivat (1991)
Discrete & computational geometry
Similarity:
Visibility and Intersection Problems in Plane Geometry.
B. Chazelle, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
F.R.K. Chung, E. Szemeredi, W.T. Trotter (1992)
Discrete & computational geometry
Similarity:
Computing Simple Circuits from a Set of Line Segments.
D. Rappaport, H. Imai, G.T. Toussaint (1990)
Discrete & computational geometry
Similarity:
A Resolution of the Sylvester-Gallai Problem of J.-P. Serre.
L.M. Kelly (1986)
Discrete & computational geometry
Similarity:
A Sylvester Theorem for Conic Sections.
J.A. Wiseman, Paul R. Wilson (1988)
Discrete & computational geometry
Similarity:
More on k-Sets of Finite Sets in the Plane.
E. Welzl (1986)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Repeated Angles in E4 .
G. Purdy (1988)
Discrete & computational geometry
Similarity: