Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Some Extremal Results on Circles Containing Points.”
Finding Minimum Area k-gons.
The Complexity of Cutting Complexes.
B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (1989)
Discrete & computational geometry
Similarity:
X-Rays of Polygons.
R.J. Gardner (1992)
Discrete & computational geometry
Similarity:
Approximation of Convex Discs by Polygons.
A. Florian (1986)
Discrete & computational geometry
Similarity:
Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (1988)
Discrete & computational geometry
Similarity:
Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert, M. Bern, S. Mitchell (1995)
Discrete & computational geometry
Similarity:
Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles.
V. Soltan, A. Gorpinevich (1993)
Discrete & computational geometry
Similarity:
Nonoverlap of the Star Unfolding.
H. Edelsbrunner (1992)
Discrete & computational geometry
Similarity:
Tiling Polygons with Parallelograms.
S. Kannan, D. Soroker (1992)
Discrete & computational geometry
Similarity:
On Separating Two Simple Polygons by a Single Translation.
G. Toussaint (1989)
Discrete & computational geometry
Similarity: