Shortest Watchman Routes in Simple Polygons.
Wei-Pang Chin, S. Ntafos (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.
Displaying similar documents to “A Polynomial Solution for the Potato-peeling Problem.”
Shortest Watchman Routes in Simple Polygons.
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
Dividing the polynomial expressions based on the criteria of reducing the number of computational operations.
Racković, Miloš (1998)
Novi Sad Journal of Mathematics
Similarity:
Some Provably Hard Crossing Number Problems.
D. Bienstock (1991)
Discrete & computational geometry
Similarity:
Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
M. Smid (1992)
Discrete & computational geometry
Similarity:
The Complexity of Cutting Complexes.
B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (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:
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
D. Kirkpatrick, B. Mishra, Chee-Keng Yap (1992)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity: