Proceedings of the Third Annual Symposium on Computational Geometry, June 8-10, 1987, Waterloo, Ontario, Canada. ACM Press, 1987, ISBN 0-89791-231-4

• 
  William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. 1-10
• 
  John Hershberger: Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. 11-20
• 
  Franz Aurenhammer: Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. 21-29
• 
  Joseph S. B. Mitchell, Christos H. Papadimitriou: The Weighted Region Problem. 30-38
• 
  Boris Aronov: On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. 39-49
• 
  Leonidas J. Guibas, John Hershberger: Optimal Shortest Path Queries in a Simple Polygon. 50-63
• 
  Subhash Suri: The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. 64-75
• 
  Jorge Stolfi: Oriented Projective Geometry. 76-85
• 
  David P. Dobkin, Michael J. Laszlo: Primitives for the Manipulation of Three-Dimensional Subdivisions. 86-99
• 
  Leila De Floriani: A Graph Based Approach to Object Feature Recognition. 100-109
• 
  Wm. Randolph Franklin: Polygon Properties Calculated from the Vertex Neighborhoods. 110-118
• 
  Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich: Numerical Stability of Geometric Algorithms. 119-125
• 
  Robert L. (Scot) Drysdale III, Robert B. Jerard: Discrete Simulation of NC Machining. 126-135
• 
  Yan Ke, Joseph O'Rourke: Moving a Ladder in Three Dimensions: Upper and Lower Bounds. 136-146
• 
  B. K. Natarajan: On Detecting the Orientation of Polygons and Polyhedra. 147-152
• 
  John F. Canny, Bruce Randall Donald: Simplified Voronoi Diagrams. 153-161
• 
  Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec: An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. 162-170
• 
  Chandrajit L. Bajaj, Myung-Soo Kim: Compliant Motion Planning with Geometric Models. 171-180
• 
  Raimund Seidel: On the Number of Faces in Higher-Dimensional Voronoi Diagrams. 181-185
• 
  Michael B. Dillencourt: Toughness and Delaunay Triangulations. 186-194
• 
  Alan Saalfeld: Joint Triangulations and Triangulation Maps. 195-204
• 
  Norm Dadoun, David G. Kirkpatrick: Parallel Processing for Efficient Subdivision Search. 205-214
• 
  L. Paul Chew: Constrained Delaunay Triangulations. 215-222
• 
  Cao An Wang, Lenhart K. Schubert: An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. 223-232
• 
  Jerzy W. Jaromczyk, Miroslaw Kowaluk: A Note on Relative Neighborhood Graphs. 233-241
• 
  Francis Avnaim, Jean-Daniel Boissonnat: Simultaneous Containment of Several Polygons. 242-247
• 
  Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya: Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)²) Time. 251-257
• 
  Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano: A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. 258-267
• 
  Robert A. Reckhow, Joseph C. Culberson: Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. 268-277
• 
  Alok Aggarwal, Subhash Suri: Fast Algorithms for Computing the Largest Empty Rectangle. 278-290
• 
  J. Ian Munro, Mark H. Overmars, Derick Wood: Variations on Visibility. 291-299
• 
  David Avis, Rephael Wenger: Algorithms for Line Transversals in Space. 300-307
• 
  Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. 308-315
• 
  David G. Kirkpatrick: Establishing Order in Planar Subdivisions. 316-321
• 
  David Rappaport: Computing Simple Circuits from a Set of Line Segments is NP-Complete. 322-330
• 
  Noga Alon, David Haussler, Emo Welzl: Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. 331-340
• 
  Joe D. Warren: Blending Quadric Surfaces with Wuadric and Cubic Surfaces. 341-347
• 
  Art J. Schwartz, Charles Stanton: Analyzing Surfaces: The Truth About Elimination Theory. 348-353