9. Symposium on Computational Geometry 1993: San Diego, CA, USA

• Mark de Berg:
  Generalized Hidden Surface Removal. 1-10
  
• Dan Halperin, Micha Sharir:
  New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. 11-18
  
• Marco Pellegrini:
  On Lines Missing Polyhedral Sets in 3-Space. 19-28
  
• Dan Halperin, Chee-Keng Yap:
  Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. 29-37
  
• Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld:
  An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. 38-46
  
• David P. Dobkin, David Eppstein:
  Computing the Discrepancy. 47-52
  
• Gautam Das, Paul J. Heffernan, Giri Narasimhan:
  Optimally Sparse Spanners in 3-Dimensional Euclidean Space. 53-62
  
• Nina Amenta:
  Helly Theorems and Generalized Linear Programming. 63-72
  
• Michael T. Goodrich:
  Geometric Partitioning Made Easier, Even in Parallel. 73-82
  
• Shreesh Jadhav, Asish Mukhopadhyay:
  Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. 83-90
  
• Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
  Approximating Center Points with Iterated Radon Points. 91-98
  
• David Eppstein, Gary L. Miller, Shang-Hua Teng:
  A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. 99-108
  
• A. Corbalan, M. L. Mazón, Tomás Recio, Francisco Santos:
  On the Topological Shape of Planar Voronoi Diagrams. 109-115
  
• Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma:
  Convex Distance Functions in 3-Space are Different. 116-123
  
• Rolf Klein, Andrzej Lingas:
  A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. 124-132
  
• David G. Kirkpatrick, Jack Snoeyink:
  Tentative Prune-and-Search for Computing Voronoi Vertices. 133-142
  
• Yui-Bin Chen, Doug Ierardi:
  Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints. 143-152
  
• Zhenyu Li, Victor Milenkovic:
  A Compaction Algorithm for Non-Convex Polygons and Its Application. 153-162
  
• Steven Fortune, Christopher J. Van Wyk:
  Efficient Exact Arithmetic for Computational Geometry. 163-172
  
• Sándor P. Fekete, William R. Pulleyblank:
  Area Optimization of Simple Polygons. 173-182
  
• Marshall W. Bern, David Eppstein:
  Worst-Case Bounds for Subadditive Geometric Graphs. 183-188
  
• Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
  Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. 189-197
  
• Matthew J. Katz, Micha Sharir:
  An Expander-Based Approach to Geometric Optimization. 198-207
  
• Thomas Dubé:
  Dominance Range-Query: The One-Reporting Case. 208-217
  
• Herbert Edelsbrunner:
  The Union of Balls and Its Dual Shape. 218-231
  
• Cecil Jose A. Delfinado, Herbert Edelsbrunner:
  An Incremental Algorithm for Betti Numbers of Simplicial Complexes. 232-239
  
• Ketan Mulmuley:
  Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. 240-246
  
• Jack Snoeyink, Jorge Stolfi:
  Objects That Cannot be Taken Apart with Two Hands. 247-256
  
• Noga Alon, Sridhar Rajagopalan, Subhash Suri:
  Long Non-Crossing Configurations in the Plane. 257-263
  
• János Pach, Jenö Töröcsik:
  Some Geometric Applications of Dilworth's Theorem. 264-269
  
• Tamal K. Dey, Herbert Edelsbrunner:
  Counting Triangle Crossings and Halving Planes. 270-273
  
• L. Paul Chew:
  Guaranteed-Quality Mesh Generation for Curved Surfaces. 274-280
  
• Marshall W. Bern:
  Compatible Tetrahedralizations. 281-288
  
• Nancy M. Amato, Franco P. Preparata:
  An NC Parallel 3D Convex Hull Algorithm. 289-297
  
• Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
  Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. 298-307
  
• Joseph S. B. Mitchell:
  Shortest Paths Among Obstacles in the Plane. 308-317
  
• Michael T. Goodrich, Roberto Tamassia:
  Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. 318-327
  
• Michel Pocchiola, Gert Vegter:
  The Visibility Complex. 328-337
  
• Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
  Can Visibility Graphs be Represented Compactly? 338-347
  
• Paul J. Heffernan:
  An Optimal Algorithm for the Two-Guard Problem. 348-358
  
• Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
  Area-Efficient Upward Tree Drawings. 359-368
  
• Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
  Decision Trees for Geometric Models. 369-378
  
• Y. B. Karasik, Micha Sharir:
  The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. 379-388
  
• Seth J. Teller:
  Visualizing Fortune's Sweepline Algorithm for Planar Voronoi Diagrams. 393
  
• David P. Dobkin, Ayellet Tal:
  Building and Using Polyhedral Hierarchies. 394
  
• Stefan Schirra:
  Moving a Disc Between Polygons. 395-396
  
• John Hershberger:
  Compliant Motion in a Simple Polygon. 397-398
  
• Estarose Wolfson, Micha Sharir:
  Implementation of a Motion Planning System in Three Dimensions. 399-400
  
• Pedro Jussieu de Rezende, Welson R. Jacometti:
  Animation of Geometric Algorithms Using GeoLab. 401-402
  
• Michael Murphy, Steven Skiena:
  Ranger: A Tool for Nearest Neighbor Search in High Dimensions. 403-404
  
• Jack Snoeyink:
  Video: Objects that Cannot be Taken Apart with Two Hands. 405