Abstract is missing.
- Some New Bounds for Epsilon-NetsJános Pach, Gerhard J. Woeginger. 10-15 [doi]
- Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone TheoremsBernard Chazelle, Micha Sharir, Emo Welzl. 23-33 [doi]
- Polygon Triangulation in O(n log log n) Time with Simple Data-StructuresDavid G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan. 34-43 [doi]
- An O(n:::2:::log n) Time Algorithm for the MinMax Angle TriangulationHerbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch. 44-52 [doi]
- Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract)Paul J. Heffernan, Joseph S. B. Mitchell. 53-62 [doi]
- Minimum-Link Paths Among Obstacles in the PlaneJoseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger. 63-72 [doi]
- Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version)Michael T. Goodrich, Steven B. Shauck, Sumanta Guha. 73-82 [doi]
- The Combinatorial Complexity of Hyperplane TransversalsSylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger. 83-91 [doi]
- On the Limited Power of Linear Probes and Other Optimization OraclesPeter Gritzmann, Victor Klee, John Westwater. 92-101 [doi]
- Computational Complexity of Combinatorial SurfacesGert Vegter, Chee-Keng Yap. 102-111 [doi]
- Points and Triangles in the Plane and Halving Planes in SpaceBoris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger. 112-115 [doi]
- Slimming Down by Adding: Selecting Heavily Covered PointsBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. 116-127 [doi]
- Tiling the Plane with One TileDanièle Beauquier, Maurice Nivat. 128-138 [doi]
- A Trivial Knot Whose Spanning Disks Have Exponential SizeJack Snoeyink. 139-147 [doi]
- Merging Visibility MapsMark H. Overmars, Micha Sharir. 168-176 [doi]
- Stabbing and Ray Shooting in 3 Dimensional SpaceMarco Pellegrini. 177-186 [doi]
- K-d Trees for Semidynamic Point SetsJon Louis Bentley. 187-197 [doi]
- Euclidean Minimum Spanning Trees and Bichromatic Closest PairsPankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. 203-210 [doi]
- Linear Programming and Convex Hulls Made EasyRaimund Seidel. 211-215 [doi]
- On Simultaneous Inner and Outer Approximation of ShapesRudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. 216-224 [doi]
- Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi DiagramsHiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama. 225-234 [doi]
- Constructing Strongly Convex Hulls Using Exact or Rounded ArithmeticZhenyu Li, Victor Milenkovic. 235-243 [doi]
- Finding Compact Coordinate Representations for Polygons and PolyhedraVictor Milenkovic, Lee R. Nackman. 244-252 [doi]
- Enumeration and Visibility Problems in Integer Lattices (Extended Abstract)Evangelos Kranakis, Michel Pocchiola. 261-270 [doi]
- An Exact Algorithm for Kinodynamic Planning in the PlaneJohn F. Canny, Ashutosh Rege, John H. Reif. 271-280 [doi]
- Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric FiguresHelmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig. 281-289 [doi]
- Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain ManipulatorsBruce Randall Donald, Patrick G. Xavier. 290-300 [doi]
- Shortest Rectilinear Paths among Weighted ObstaclesD. T. Lee, T. H. Chen, Chung-Do Yang. 301-310 [doi]
- On Minimal Rectilinear Steiner Trees in All DimensionsTimothy Law Snyder. 311-320 [doi]
- Reconstructing Sets from Interpoint Distances (Extended Abstract)Steven Skiena, Warren D. Smith, Paul Lemke. 332-339 [doi]
- Computing the Minimum Hausdorff Distance for Point Sets Under TranslationDaniel P. Huttenlocher, Klara Kedem. 340-349 [doi]
- On Solving Geometric Optimization Problems Using Shortest PathsElefterios A. Melissaratos, Diane L. Souvaine. 350-359 [doi]
- Shortest Paths on a PolyhedronJindong Chen, Yijie Han. 360-369 [doi]