An Efficient Algorithm for Guard Placement in Polygons with Holes.
I. Bjorling-Sachs, D.L. Souvaine (1995)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Shortest Watchman Routes in Simple Polygons.”
An Efficient Algorithm for Guard Placement in Polygons with Holes.
Separating Two Simple Polygons by a Sequence of Translations.
R. Pollack, M. Sharir, S. Sifrony (1988)
Discrete & computational geometry
Similarity:
X-Rays of Polygons.
R.J. Gardner (1992)
Discrete & computational geometry
Similarity:
On Separating Two Simple Polygons by a Single Translation.
G. Toussaint (1989)
Discrete & computational geometry
Similarity:
Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (1988)
Discrete & computational geometry
Similarity:
Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles.
V. Soltan, A. Gorpinevich (1993)
Discrete & computational geometry
Similarity:
Tiling Polygons with Parallelograms.
S. Kannan, D. Soroker (1992)
Discrete & computational geometry
Similarity:
Triangulating a Simple Polygon in Linear Time.
B. Chazelle (1991)
Discrete & computational geometry
Similarity:
Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert, M. Bern, S. Mitchell (1995)
Discrete & computational geometry
Similarity:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
Robert E. Tarjan, K.L. Clarkson, Christopher J. van Wyk (1989)
Discrete & computational geometry
Similarity:
Areas of Polygons Inscribed in a Circle.
D.P. Robbins (1994)
Discrete & computational geometry
Similarity: