On Translating One Polyomino To Tile the Plane.
D. Beauquier, M. Nivat (1991)
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 “Polygonizations of Point Sets in the Plane.”
On Translating One Polyomino To Tile the Plane.
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:
More on k-Sets of Finite Sets in the Plane.
E. Welzl (1986)
Discrete & computational geometry
Similarity:
A Gallai-Type Transversal Problem in the Plane.
J. Eckhoff (1993)
Discrete & computational geometry
Similarity:
Two Combinatorial Problems in the Plane.
P. Erdös, G. Purdy (1995)
Discrete & computational geometry
Similarity:
On the Exact Constant in the Quantitative Steinitz Theorem in the Plane.
I. Bárány, A. Heppes (1994)
Discrete & computational geometry
Similarity:
Visibility and Intersection Problems in Plane Geometry.
B. Chazelle, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
The Maximum Number of Second Smallest Distances in Finite Planar Sets.
P. Brass (1992)
Discrete & computational geometry
Similarity:
A Matroid on Hypergraphs, with Applications in Scene Analysis and Geometry.
W. Whiteley (1989)
Discrete & computational geometry
Similarity:
Repeated Angles in E4 .
G. Purdy (1988)
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: