Abstract is missing.
- Vertical Decompositions for Triangles in 3-SpaceMark de Berg, Leonidas J. Guibas, Dan Halperin. 1-10 [doi]
- Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three DimensionsDan Halperin, Micha Sharir. 11-20 [doi]
- On Translational Motion Planning in 3-SpaceBoris Aronov, Micha Sharir. 21-30 [doi]
- Motion Planning Amidst Fat Obstacles (Extended Abstract)A. Frank van der Stappen, Mark H. Overmars. 31-40 [doi]
- Approximate Euclidean Shortest Path in 3-SpaceJoonsoo Choi, Jürgen Sellen, Chee-Keng Yap. 41-48 [doi]
- The Realization Problem for Euclidean Minimum Spanning Trees is NP-hardPeter Eades, Sue Whitesides. 49-56 [doi]
- Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related ProblemsSanguthevar Rajasekaran, Suneeta Ramaswami. 57-66 [doi]
- Constructing Levels in Arrangements and Higher Order Voronoi DiagramsPankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. 67-75 [doi]
- Computing Many Faces in Arrangements of Lines and SegmentsPankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf. 76-84 [doi]
- Matching Shapes with a Reference PointHelmut Alt, Oswin Aichholzer, Günter Rote. 85-92 [doi]
- Piecewise-Linear Interpolation Between Polygonal SlicesGill Barequet, Micha Sharir. 93-102 [doi]
- Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version)Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky. 103-112 [doi]
- Spheres, Molecules, and Hidden Surface RemovalDan Halperin, Mark H. Overmars. 113-122 [doi]
- Determining the Castability of Simple PolyhedraProsenjit Bose, David Bremner, Marc J. van Kreveld. 123-131 [doi]
- A Fast Algorithm for Constructing Sparse Euclidean SpannersGautam Das, Giri Narasimhan. 132-139 [doi]
- Dynamic Maintenance of Maximas of 2-P Point SetsSanjiv Kapoor. 140-149 [doi]
- Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version)Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer. 150-159 [doi]
- An Algorithm for Approximate Closest-Point QueriesKenneth L. Clarkson. 160-164 [doi]
- New Techniques for Exact and Approximate Dynamic Closest-Point ProblemsSanjiv Kapoor, Michiel H. M. Smid. 165-174 [doi]
- Competitive Searching in a Generalized StreetAmitava Datta, Christian Icking. 175-182 [doi]
- The Tight Lower Bound for the Steiner Ratio in Minkowski PlanesBiao Gao, Ding-Zhu Du, Ronald L. Graham. 183-191 [doi]
- Bounding the Number of Geometric Permutations Induced by ::::k::::-TransversalsJacob E. Goodman, Richard Pollack, Rephael Wenger. 192-197 [doi]
- Applications of the Crossing NumberJános Pach, Farhad Shahrokhi, Mario Szegedy. 198-202 [doi]
- Cutting Dense Point Sets in HalfHerbert Edelsbrunner, Pavel Valtr, Emo Welzl. 203-209 [doi]
- Fast Greedy Triangulation AlgorithmsMatthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl. 211-220 [doi]
- Linear-Size Nonobtuse Triangulation of PolygonsMarshall W. Bern, Scott A. Mitchell, Jim Ruppert. 221-230 [doi]
- Bounds on the Size of TetrahedralizationsBernard Chazelle, Nadia Shouraboura. 231-239 [doi]
- An Optimal Bound for Conforming Quality Triangulations (Extended Abstract)Tiow Seng Tan. 240-249 [doi]
- On the Maximum Degree of Minimum Spanning TreesGabriel Robins, Jeffrey S. Salowe. 250-258 [doi]
- Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a PolygonGautam Das, Giri Narasimhan. 259-266 [doi]
- Morphing Simple PolygonsLeonidas J. Guibas, John Hershberger. 267-276 [doi]
- A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy DetectionTamal K. Dey. 277-284 [doi]
- Triangulating Topological SpacesHerbert Edelsbrunner, Nimish R. Shah. 285-292 [doi]
- Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version)Hervé Brönnimann, Michael T. Goodrich. 293-302 [doi]
- An Efficient Algorithm for the Euclidean Two-Center ProblemJerzy W. Jaromczyk, Miroslaw Kowaluk. 303-311 [doi]
- On Geometric Optimization with Few Violated ConstraintsJirí Matousek. 312-321 [doi]
- Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version)Michael T. Goodrich. 322-331 [doi]
- Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based ::::k::::-Clustering (Extended Abstract)Mary Inaba, Naoki Katoh, Hiroshi Imai. 332-339 [doi]
- Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-Type TheoremNina Amenta. 340-347 [doi]
- Computing Envelopes in Four Dimensions with ApplicationsPankaj K. Agarwal, Boris Aronov, Micha Sharir. 348-358 [doi]
- Query-Sensitive Ray ShootingJoseph S. B. Mitchell, David M. Mount, Subhash Suri. 359-368 [doi]
- Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented ObjectsProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid. 369-378 [doi]
- An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line SimplificationJohn Hershberger, Jack Snoeyink. 383-384 [doi]
- Computing the Rectangle DiscrepancyDavid P. Dobkin, Dimitrios Gunopulos. 385-386 [doi]
- An Animation of a Fixed-Radius All-Nearest-Neighbors AlgorithmHans-Peter Lenhof, Michiel H. M. Smid. 387 [doi]
- GASP: A System to Facilitate Animating Geometric AlgorithmsAyellet Tal, David P. Dobkin. 388-389 [doi]
- Exact Collision Detection for Interactive Environments (Extended Abstract)Jonathan D. Cohen, Ming C. Lin, Dinesh Manocha, Madhav K. Ponamgi. 391-392 [doi]
- Almost Optimal Polyhedral SeparatorsHervé Brönnimann. 393-394 [doi]
- Interactive Visualization of Weighted Three-Dimensional Alpha HullsAmitabh Varshney, Frederick P. Brooks Jr., William V. Wright. 395-396 [doi]