2. Symposium on Computational Geometry 1986: Yorktown Heights, NY, USA

• Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
  Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. 1-13
  Electronic Edition (ACM DL) BibTeX
• Subhash Suri, Joseph O'Rourke:
  Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. 14-23
  Electronic Edition (ACM DL) BibTeX
• Wei-pang Chin, Simeon C. Ntafos:
  Optimum Watchman Routes. 24-33
  Electronic Edition (ACM DL) BibTeX
• C. Wang, Edward P. F. Chan:
  Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. 34-42
  Electronic Edition (ACM DL) BibTeX
• J. Mark Keil:
  Minimally Covering a Horizontally Convex Orthogonal Polygon. 43-51
  Electronic Edition (ACM DL) BibTeX
• David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
  On Computing Simple Circuits on a Set of Line Segments. 52-60
  Electronic Edition (ACM DL) BibTeX
• David Haussler, Emo Welzl:
  Epsilon-Nets and Simplex Range Queries. 61-71
  Electronic Edition (ACM DL) BibTeX
• Andrzej Lingas:
  On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. 72-79
  Electronic Edition (ACM DL) BibTeX
• Dan E. Willard:
  On the Application of Shared Retrieval to Orthogonal Range Queries. 80-89
  Electronic Edition (ACM DL) BibTeX
• Leonidas J. Guibas, Raimund Seidel:
  Computing Convolutions by Reciprocal Search. 90-99
  Electronic Edition (ACM DL) BibTeX
• Christos Levcopoulos:
  Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. 100-108
  Electronic Edition (ACM DL) BibTeX
• Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
  Optimal Dynamic Solutions for Fixed Windowing Problems. 109-115
  Electronic Edition (ACM DL) BibTeX
• V. Vijayan:
  Geometry of Planar Graphs with Angles. 116-124
  Electronic Edition (ACM DL) BibTeX
• Henry Crapo, Juliette Ryan:
  Scene Analysis and Geometric Homology. 125-132
  Electronic Edition (ACM DL) BibTeX
• David Avis, Hossam A. ElGindy:
  Triangulating Simplicial Point Sets in Space. 133-141
  Electronic Edition (ACM DL) BibTeX
• Walter Whiteley:
  Two Algorithms for Polyhedral Pictures. 142-149
  Electronic Edition (ACM DL) BibTeX
• David M. Mount:
  Storing the Subdivision of a Polyhedral Surface. 150-158
  Electronic Edition (ACM DL) BibTeX
• A. H. Schoen:
  A Defect-Correction algorithm for Minimizing the Volume of a Simple Polyhedron Which Circumscribes a Sphere. 159-168
  Electronic Edition (ACM DL) BibTeX
• Paul Chew:
  There is a Planar Graph Almost as Good as the Complete Graph. 169-177
  Electronic Edition (ACM DL) BibTeX
• Shmuel Sifrony, Micha Sharir:
  A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. 178-186
  Electronic Edition (ACM DL) BibTeX
• S. Maddila, Chee-Keng Yap:
  Moving a Polygon Around the Corner in a Corridor. 187-192
  Electronic Edition (ACM DL) BibTeX
• Micha Sharir, Avikam Baltsan:
  On Shortest Paths Amidst Convex Polyhedra. 193-206
  Electronic Edition (ACM DL) BibTeX
• V. Visvanathan, Linda S. Milor:
  An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation. 207-215
  Electronic Edition (ACM DL) BibTeX
• Mikhail J. Atallah, Michael T. Goodrich:
  Efficient Plane Sweeping in Parallel. 216-225
  Electronic Edition (ACM DL) BibTeX
• Per-Olof Fjällström:
  Smoothing of Polyhedral Hodels. 226-235
  Electronic Edition (ACM DL) BibTeX
• Dayong Zhang, Adrian Bowyer:
  CSG Set-Theoretic Solid Modelling and NC Machining of Blend Aurfaces. 236-245
  Electronic Edition (ACM DL) BibTeX
• D. A. Field:
  Implementing Watson's Algorithm in Three Dimensions. 246-259
  Electronic Edition (ACM DL) BibTeX
• Jean-Daniel Boissonnat, Monique Teillaud:
  The Hierarchical Representation of Objects: The Delaunay Tree. 260-268
  Electronic Edition (ACM DL) BibTeX
• Ferenc Dévai:
  Quadratic Bounds for Hidden Line Elimination. 269-275
  Electronic Edition (ACM DL) BibTeX
• Rex A. Dwyer:
  A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. 276-284
  Electronic Edition (ACM DL) BibTeX
• Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
  Geometric Applications of a Matrix Searching Algorithm. 285-292
  Electronic Edition (ACM DL) BibTeX
• Bernard Chazelle, Herbert Edelsbrunner:
  Linear Data Structures for Two Types of Range Search. 293-302
  Electronic Edition (ACM DL) BibTeX
• Rajeev Motwani, Prabhakar Raghavan:
  Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. 303-312
  Electronic Edition (ACM DL) BibTeX
• Steven Fortune:
  A Sweepline Algorithm for Voronoi Diagrams. 313-322
  Electronic Edition (ACM DL) BibTeX