Abstract is missing.
- Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple PolygonsLeonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. 1-13 [doi]
- Optimum Watchman RoutesWei-pang Chin, Simeon C. Ntafos. 24-33 [doi]
- Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple PolygonsC. Wang, Edward P. F. Chan. 34-42 [doi]
- Minimally Covering a Horizontally Convex Orthogonal PolygonJ. Mark Keil. 43-51 [doi]
- On Computing Simple Circuits on a Set of Line SegmentsDavid Rappaport, Hiroshi Imai, Godfried T. Toussaint. 52-60 [doi]
- Epsilon-Nets and Simplex Range QueriesDavid Haussler, Emo Welzl. 61-71 [doi]
- On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point SetsAndrzej Lingas. 72-79 [doi]
- On the Application of Shared Retrieval to Orthogonal Range QueriesDan E. Willard. 80-89 [doi]
- Computing Convolutions by Reciprocal SearchLeonidas J. Guibas, Raimund Seidel. 90-99 [doi]
- Fast Heuristics for Minimum Length Rectangular Partitions of PolygonsChristos Levcopoulos. 100-108 [doi]
- Optimal Dynamic Solutions for Fixed Windowing ProblemsRolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. 109-115 [doi]
- Scene Analysis and Geometric HomologyHenry Crapo, Juliette Ryan. 125-132 [doi]
- Triangulating Simplicial Point Sets in SpaceDavid Avis, Hossam A. ElGindy. 133-141 [doi]
- Two Algorithms for Polyhedral PicturesWalter Whiteley. 142-149 [doi]
- Storing the Subdivision of a Polyhedral SurfaceDavid M. Mount. 150-158 [doi]
- There is a Planar Graph Almost as Good as the Complete GraphPaul Chew. 169-177 [doi]
- A New Efficient Motion-Planning Algorithm for a Rod in Polygonal SpaceShmuel Sifrony, Micha Sharir. 178-186 [doi]
- Moving a Polygon Around the Corner in a CorridorS. Maddila, Chee-Keng Yap. 187-192 [doi]
- On Shortest Paths Amidst Convex PolyhedraMicha Sharir, Avikam Baltsan. 193-206 [doi]
- An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear TransformationV. Visvanathan, Linda S. Milor. 207-215 [doi]
- Efficient Plane Sweeping in ParallelMikhail J. Atallah, Michael T. Goodrich. 216-225 [doi]
- Smoothing of Polyhedral HodelsPer-Olof Fjällström. 226-235 [doi]
- CSG Set-Theoretic Solid Modelling and NC Machining of Blend AurfacesDayong Zhang, Adrian Bowyer. 236-245 [doi]
- The Hierarchical Representation of Objects: The Delaunay TreeJean-Daniel Boissonnat, Monique Teillaud. 260-268 [doi]
- A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected TimeRex A. Dwyer. 276-284 [doi]
- Geometric Applications of a Matrix Searching AlgorithmAlok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber. 285-292 [doi]
- Linear Data Structures for Two Types of Range SearchBernard Chazelle, Herbert Edelsbrunner. 293-302 [doi]
- Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search ProblemsRajeev Motwani, Prabhakar Raghavan. 303-312 [doi]
- A Sweepline Algorithm for Voronoi DiagramsSteven Fortune. 313-322 [doi]