Table of Contents

• Applications of Random Sampling in Computational Geometry, IIKenneth L. Clarkson. 1-11 [doi]
• Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and IncrementalKenneth L. Clarkson, Peter W. Shor. 12-17 [doi]
• A Fast Las Vegas Algorithm for Triangulating a Simple PolygonKenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk. 18-22 [doi]
• Partition Trees for Triangle Counting and Other Range Searching ProblemsEmo Welzl. 23-33 [doi]
• Quasi-Valid Range Querying and Its Implications for Nearest Neighbor ProblemsDan E. Willard, Young C. Wee. 34-43 [doi]
• The Complexity of Many Faces in Arrangements of Lines of SegmentsHerbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. 44-55 [doi]
• Implicitly Representing Arrangements of Lines or SegmentsHerbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. 56-69 [doi]
• Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision DetectionPankaj K. Agarwal, Micha Sharir. 70-80 [doi]
• Algebraic Methods for Non-Linear Computational Geometry (Invited Address)Bruno Buchberger. 81-82 [doi]
• The Design of LINETOOL, a Geometric EditorL. W. Ericson, Chee-Keng Yap. 83-92 [doi]
• Recipes for Geometry and Numerical Analysis - Part I: An Empirical StudyDavid P. Dobkin, Deborah Silver. 93-105 [doi]
• Towards Implementing Robust Geometric ComputationsChristoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick. 106-117 [doi]
• Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric AlgorithmsHerbert Edelsbrunner, Ernst P. Mücke. 118-133 [doi]
• A Geometric Consistency Theorem for a Symbolic Perturbation SchemeChee-Keng Yap. 134-142 [doi]
• Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) TimeDavid M. Mount, Alan Saalfeld. 143-152 [doi]
• Analysis of a Simple Yet Efficient Convex Hull AlgorithmMordecai J. Golin, Robert Sedgewick. 153-163 [doi]
• New Methods for Computing Visibility GraphsMark H. Overmars, Emo Welzl. 164-171 [doi]
• Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal ObstaclesSanjiv Kapoor, S. N. Maheshwari. 172-182 [doi]
• Hidden Surface Removal for RectanglesMarshall W. Bern. 183-192 [doi]
• An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its ParallelizationJohn H. Reif, Sandeep Sen. 193-200 [doi]
• Optimal Parallel Algorithms for Polygon and Point-Set ProblemsRichard Cole, Michael T. Goodrich. 201-210 [doi]
• Covering Orthogonal Polygons with Star Polygons: The Perfect Graph ApproachRajeev Motwani, Arvind Raghunathan, Huzur Saran. 211-223 [doi]
• Searching for Empty Convex PolygonsDavid P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars. 224-228 [doi]
• The Furthest-Site Geodesic Voronoi DiagramBoris Aronov, Steven Fortune, Gordon T. Wilfong. 229-240 [doi]
• Computing Euclidean Maximum Spanning TreesClyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. 241-251 [doi]
• Clustering Algorithms Based on Minimum and Maximum Spanning TreesTetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao. 252-257 [doi]
• On Arrangements of Jordan Arcs with Three Intersections per PairHerbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. 258-265 [doi]
• Path Planning in 0/1/infinity Weighted Regions with ApplicationsLaxmi Gewali, Alex Meng, Joseph S. B. Mitchell, Simeon C. Ntafos. 266-278 [doi]
• Motion Planning in the Presence of Movable ObstaclesGordon T. Wilfong. 279-288 [doi]
• On the General Motion Planning Problem with Two Degrees of FreedomLeonidas J. Guibas, Micha Sharir, Shmuel Sifrony. 289-298 [doi]
• On Planning AssembliesB. K. Natarajan. 299-308 [doi]
• The Complexity of Planar Compliant Motion Planning Under UncertaintyBruce Randall Donald. 309-318 [doi]
• Coordinated Motion Planning for Two Independent RobotsMicha Sharir, Shmuel Sifrony. 319-328 [doi]
• An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal SpaceKlara Kedem, Micha Sharir. 329-340 [doi]
• On Maximum Flows in Polyhedral DomainsJoseph S. B. Mitchell. 341-351 [doi]
• Algorithms for Vertical and Orthogonal L1 Linear Approximation of PointsPeter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai. 352-361 [doi]
• Skewed Projections with an Application to Line Stabbing in R3Jerzy W. Jaromczyk, Miroslaw Kowaluk. 362-370 [doi]
• Arrangements of Lines in 3-Space: A Data Structure with ApplicationsM. McKenna, Joseph O Rourke. 371-380 [doi]
• Triangles in Space or Building (and Analyzing) Castles in the AirBoris Aronov, Micha Sharir. 381-391 [doi]
• On Continuous Homotopic One Layer RoutingShaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling. 392-402 [doi]