Abstract is missing.
- Computing the Link Center of a Simple PolygonWilliam Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. 1-10 [doi]
- Finding the Visibility Graph of a Simple Polygon in Time Proportional to its SizeJohn Hershberger. 11-20 [doi]
- Jordan Sorting Via Convex Hulls of Certain Non-Simple PolygonsFranz Aurenhammer. 21-29 [doi]
- The Weighted Region ProblemJoseph S. B. Mitchell, Christos H. Papadimitriou. 30-38 [doi]
- On the Geodesic Voronoi Diagram of Point Sites in a Simple PolygonBoris Aronov. 39-49 [doi]
- Optimal Shortest Path Queries in a Simple PolygonLeonidas J. Guibas, John Hershberger. 50-63 [doi]
- Oriented Projective GeometryJorge Stolfi. 76-85 [doi]
- Primitives for the Manipulation of Three-Dimensional SubdivisionsDavid P. Dobkin, Michael J. Laszlo. 86-99 [doi]
- A Graph Based Approach to Object Feature RecognitionLeila De Floriani. 100-109 [doi]
- Polygon Properties Calculated from the Vertex NeighborhoodsWm. Randolph Franklin. 110-118 [doi]
- Numerical Stability of Geometric AlgorithmsThomas Ottmann, Gerald Thiemt, Christian P. Ullrich. 119-125 [doi]
- Discrete Simulation of NC MachiningRobert L. (Scot) Drysdale III, Robert B. Jerard. 126-135 [doi]
- Moving a Ladder in Three Dimensions: Upper and Lower BoundsYan Ke, Joseph O Rourke. 136-146 [doi]
- On Detecting the Orientation of Polygons and PolyhedraB. K. Natarajan. 147-152 [doi]
- Simplified Voronoi DiagramsJohn F. Canny, Bruce Randall Donald. 153-161 [doi]
- An Optimal O(n log n) Algorithm for Contour Reconstruction from RaysPanagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec. 162-170 [doi]
- Compliant Motion Planning with Geometric ModelsChandrajit L. Bajaj, Myung-Soo Kim. 171-180 [doi]
- On the Number of Faces in Higher-Dimensional Voronoi DiagramsRaimund Seidel. 181-185 [doi]
- Toughness and Delaunay TriangulationsMichael B. Dillencourt. 186-194 [doi]
- Joint Triangulations and Triangulation MapsAlan Saalfeld. 195-204 [doi]
- Parallel Processing for Efficient Subdivision SearchN. Dadoun, David G. Kirkpatrick. 205-214 [doi]
- Constrained Delaunay TriangulationsL. Paul Chew. 215-222 [doi]
- An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line SegmentsCao An Wang, Lenhart K. Schubert. 223-232 [doi]
- A Note on Relative Neighborhood GraphsJerzy W. Jaromczyk, Miroslaw Kowaluk. 233-241 [doi]
- Simultaneous Containment of Several PolygonsFrancis Avnaim, Jean-Daniel Boissonnat. 242-247 [doi]
- Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) TimeKenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya. 251-257 [doi]
- A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical EfficiencyMasato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano. 258-267 [doi]
- Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex PolygonsRobert A. Reckhow, Joseph C. Culberson. 268-277 [doi]
- Fast Algorithms for Computing the Largest Empty RectangleAlok Aggarwal, Subhash Suri. 278-290 [doi]
- Variations on VisibilityJ. Ian Munro, Mark H. Overmars, Derick Wood. 291-299 [doi]
- Algorithms for Line Transversals in SpaceDavid Avis, Rephael Wenger. 300-307 [doi]
- Congruence, Similarity, and Symmetries of Geometric ObjectsHelmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl. 308-315 [doi]
- Establishing Order in Planar SubdivisionsDavid G. Kirkpatrick. 316-321 [doi]
- Computing Simple Circuits from a Set of Line Segments is NP-CompleteDavid Rappaport. 322-330 [doi]
- Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis DimensionNoga Alon, David Haussler, Emo Welzl. 331-340 [doi]
- Blending Quadric Surfaces with Wuadric and Cubic SurfacesJoe D. Warren. 341-347 [doi]