default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 3
Volume 3, 1993
- Muhammad H. Alsuwaiyel, D. T. Lee:
Minimal Link Visibility Paths Inside a Simple Polygon. 1-25 - Boris Aronov
, Raimund Seidel, Diane L. Souvaine:
On Compatible Triangulations of Simple Polygons. 27-35 - Sumanta Guha:
An Optimal Parallel Algorithm Using Exclusive Read/writes for the Rectilinear Voronoi Diagram. 37-52 - Marco Pellegrini:
Lower Bounds on Stabbing Lines in 3-space. 53-58 - L. Paul Chew, Klara Kedem:
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. 59-89 - Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum K-width-connectivity on Meshes. 91-105 - Klaus Jansen:
One Strike Against the Min-max Degree Triangulation Problem. 107-120 - Paul J. Heffernan:
Linear-time Algorithms for Weakly-monotone Polygons. 121-137 - Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Algorithms for Searching Unknown Scenes. 139-155 - Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. 157-184 - Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. 185-212 - Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons. 213-233 - Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. 235-246 - Efthymios Anagnostou, Derek G. Corneil:
Polynomial-time Instances of the Minimum Weight Triangulation Problem. 247-259 - Rex A. Dwyer:
Maximal and Minimal Balls. 261-275 - Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line. 277-288 - David G. Heath, Simon Kasif:
The Complexity of Finding Minimal Voronoi Covers with Applications to Machine Learning. 289-305 - Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle- Avoiding Paths. 307-313 - Tamal K. Dey:
On Counting Triangulations in D Dimensions. 315-325 - Lenwood S. Heath, Praveen K. Paripati, John W. Roach:
Representing Polyhedra: Faces Are Better Than Vertices. 327-351 - A. Frank van der Stappen, Dan Halperin, Mark H. Overmars:
The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. 353-373
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
