Volume 3,
1993
- Muhammad H. Alsuwaiyel, D. T. Lee:
Minimal Link Visibility Paths Inside a Simple Polygon.
1-25 BibTeX
- Boris Aronov, Raimund Seidel, Diane L. Souvaine:
On Compatible Triangulations of Simple Polygons.
27-35 BibTeX
- Sumanta Guha:
An Optimal Parallel Algorithm Using Exclusive Read/writes for the Rectilinear Voronoi Diagram.
37-52 BibTeX
- Marco Pellegrini:
Lower Bounds on Stabbing Lines in 3-space.
53-58 BibTeX
- L. Paul Chew, Klara Kedem:
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion.
59-89 BibTeX
- Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum K-width-connectivity on Meshes.
91-105 BibTeX
- Klaus Jansen:
One Strike Against the Min-max Degree Triangulation Problem.
107-120 BibTeX
- Paul J. Heffernan:
Linear-time Algorithms for Weakly-monotone Polygons.
121-137 BibTeX
- Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Algorithms for Searching Unknown Scenes.
139-155 BibTeX
- Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams.
157-184 BibTeX
- Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions.
185-212 BibTeX
- Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons.
213-233 BibTeX
- Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection.
235-246 BibTeX
- Efthymios Anagnostou, Derek G. Corneil:
Polynomial-time Instances of the Minimum Weight Triangulation Problem.
247-259 BibTeX
- Rex A. Dwyer:
Maximal and Minimal Balls.
261-275 BibTeX
- Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
277-288 BibTeX
- David G. Heath, Simon Kasif:
The Complexity of Finding Minimal Voronoi Covers with Applications to Machine Learning.
289-305 BibTeX
- Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle- Avoiding Paths.
307-313 BibTeX
- Tamal K. Dey:
On Counting Triangulations in D Dimensions.
315-325 BibTeX
- Lenwood S. Heath, Praveen K. Paripati, John W. Roach:
Representing Polyhedra: Faces Are Better Than Vertices.
327-351 BibTeX
- 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 BibTeX
Copyright © Sat May 16 23:53:22 2009
by Michael Ley (ley@uni-trier.de)
