3. Symposium on Computational Geometry 1987: Waterloo, Ontario, Canada

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