Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Triangulating a Simple Polygon in Linear Time.”
Nonobtuse Triangulation of Polygons.
Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles.
V. Soltan, A. Gorpinevich (1993)
Discrete & computational geometry
Similarity:
Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert, M. Bern, S. Mitchell (1995)
Discrete & computational geometry
Similarity:
X-Rays of Polygons.
R.J. Gardner (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:
Separating Two Simple Polygons by a Sequence of Translations.
R. Pollack, M. Sharir, S. Sifrony (1988)
Discrete & computational geometry
Similarity:
On the Number of Guard Edges of a Polygon.
Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, T.C. Woo (1993)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Computing the Link Center of a Simple Polygon.
R. Pollack, M. Sharir, W. Lenhart, J. Sack, R. Seidel, S. Suri, G. Toussaint, S. Whitesides, C. Yap (1988)
Discrete & computational geometry
Similarity:
Repeated Angles in E4 .
G. Purdy (1988)
Discrete & computational geometry
Similarity: