10. Symposium on Computational Geometry 1994: Stony Brook, New York, USA

• Mark de Berg, Leonidas J. Guibas, Dan Halperin:
  Vertical Decompositions for Triangles in 3-Space. 1-10
  
• Dan Halperin, Micha Sharir:
  Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. 11-20
  
• Boris Aronov, Micha Sharir:
  On Translational Motion Planning in 3-Space. 21-30
  
• A. Frank van der Stappen, Mark H. Overmars:
  Motion Planning Amidst Fat Obstacles (Extended Abstract). 31-40
  
• Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
  Approximate Euclidean Shortest Path in 3-Space. 41-48
  
• Peter Eades, Sue Whitesides:
  The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. 49-56
  
• Sanguthevar Rajasekaran, Suneeta Ramaswami:
  Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems. 57-66
  
• Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
  Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. 67-75
  
• Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf:
  Computing Many Faces in Arrangements of Lines and Segments. 76-84
  
• Helmut Alt, Oswin Aichholzer, Günter Rote:
  Matching Shapes with a Reference Point. 85-92
  
• Gill Barequet, Micha Sharir:
  Piecewise-Linear Interpolation Between Polygonal Slices. 93-102
  
• Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky:
  Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). 103-112
  
• Dan Halperin, Mark H. Overmars:
  Spheres, Molecules, and Hidden Surface Removal. 113-122
  
• Prosenjit Bose, David Bremner, Marc J. van Kreveld:
  Determining the Castability of Simple Polyhedra. 123-131
  
• Gautam Das, Giri Narasimhan:
  A Fast Algorithm for Constructing Sparse Euclidean Spanners. 132-139
  
• Sanjiv Kapoor:
  Dynamic Maintenance of Maximas of 2-P Point Sets. 140-149
  
• Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer:
  Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). 150-159
  
• Kenneth L. Clarkson:
  An Algorithm for Approximate Closest-Point Queries. 160-164
  
• Sanjiv Kapoor, Michiel H. M. Smid:
  New Techniques for Exact and Approximate Dynamic Closest-Point Problems. 165-174
  
• Amitava Datta, Christian Icking:
  Competitive Searching in a Generalized Street. 175-182
  
• Biao Gao, Ding-Zhu Du, Ronald L. Graham:
  The Tight Lower Bound for the Steiner Ratio in Minkowski Planes. 183-191
  
• Jacob E. Goodman, Richard Pollack, Rephael Wenger:
  Bounding the Number of Geometric Permutations Induced by k-Transversals. 192-197
  
• János Pach, Farhad Shahrokhi, Mario Szegedy:
  Applications of the Crossing Number. 198-202
  
• Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
  Cutting Dense Point Sets in Half. 203-209
  
• Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
  Fast Greedy Triangulation Algorithms. 211-220
  
• Marshall W. Bern, Scott A. Mitchell, Jim Ruppert:
  Linear-Size Nonobtuse Triangulation of Polygons. 221-230
  
• Bernard Chazelle, Nadia Shouraboura:
  Bounds on the Size of Tetrahedralizations. 231-239
  
• Tiow Seng Tan:
  An Optimal Bound for Conforming Quality Triangulations (Extended Abstract). 240-249
  
• Gabriel Robins, Jeffrey S. Salowe:
  On the Maximum Degree of Minimum Spanning Trees. 250-258
  
• Gautam Das, Giri Narasimhan:
  Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. 259-266
  
• Leonidas J. Guibas, John Hershberger:
  Morphing Simple Polygons. 267-276
  
• Tamal K. Dey:
  A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection. 277-284
  
• Herbert Edelsbrunner, Nimish R. Shah:
  Triangulating Topological Spaces. 285-292
  
• Hervé Brönnimann, Michael T. Goodrich:
  Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). 293-302
  
• Jerzy W. Jaromczyk, Miroslaw Kowaluk:
  An Efficient Algorithm for the Euclidean Two-Center Problem. 303-311
  
• Jirí Matousek:
  On Geometric Optimization with Few Violated Constraints. 312-321
  
• Michael T. Goodrich:
  Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). 322-331
  
• Mary Inaba, Naoki Katoh, Hiroshi Imai:
  Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). 332-339
  
• Nina Amenta:
  Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-Type Theorem. 340-347
  
• Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
  Computing Envelopes in Four Dimensions with Applications. 348-358
  
• Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
  Query-Sensitive Ray Shooting. 359-368
  
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
  Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. 369-378
  
• John Hershberger, Jack Snoeyink:
  An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. 383-384
  
• David P. Dobkin, Dimitrios Gunopulos:
  Computing the Rectangle Discrepancy. 385-386
  
• Hans-Peter Lenhof, Michiel H. M. Smid:
  An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. 387
  
• Ayellet Tal, David P. Dobkin:
  GASP: A System to Facilitate Animating Geometric Algorithms. 388-389
  
• Adrian Mariano, Linus Upson:
  Penumbral Shadows. 390
  
• Jonathan D. Cohen, Ming C. Lin, Dinesh Manocha, Madhav K. Ponamgi:
  Exact Collision Detection for Interactive Environments (Extended Abstract). 391-392
  
• Hervé Brönnimann:
  Almost Optimal Polyhedral Separators. 393-394
  
• Amitabh Varshney, Frederick P. Brooks Jr., William V. Wright:
  Interactive Visualization of Weighted Three-Dimensional Alpha Hulls. 395-396