Abstract is missing.
- On Levels of Detail in TerrainsMark de Berg, Katrin Dobrindt. [doi]
- A Global Motion Planner for a Mobile Robot on a TerrainJean-Daniel Boissonnat, Katrin Dobrindt, Bernhard Geiger, Henri Michel. [doi]
- An Animated Library of Combinatorial VLSI-Routing AlgorithmsDorothea Wagner, Karsten Weihe. [doi]
- The Visibility Complex Made Visibly Simple: An Introduction to 2D Structures of VisibilityFrédo Durand, Claude Puech. [doi]
- 3D Modeling using the Delaunay TriangulationBernhard Geiger. [doi]
- Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting GripperAnil S. Rao, David J. Kriegman, Kenneth Y. Goldberg. [doi]
- Representation and Computation of Boolean Combinations of Sculptured ModelsShankar Krishnan, Atul Narkhede, Dinesh Manocha. [doi]
- Convex Surface DecompositionBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal. [doi]
- Hexahedral Mesh Generation via the DualSteven E. Benzley, Ted D. Blacker, Scott A. Mitchell, Peter Murdoch, Timothy J. Tautges. [doi]
- Fast and Robust Computation of Molecular SurfacesMichel F. Sanner, Arthur J. Olson, Jean-Claude Spehner. [doi]
- An Implementation for Maintaining Arrangements of PolygonsMichael H. Goldwasser. [doi]
- Geometry in GIS is not Combinatorial: Segment Intersection for Polygon OverlayD. S. Andrews, Jack Snoeyink. [doi]
- Exact Geometric Computation in LEDAChristoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig. [doi]
- Incremental Collision Detection for Polygonal ModelsMadhav K. Ponamgi, Ming C. Lin, Dinesh Manocha. [doi]
- An Animation of Euclid s Proposition 47: The Pythagorean TheoremSteve Glassman, Greg Nelson. [doi]
- HIPAIR: Interactive Mechanism Analysis and Design Using Configuration SpacesLeo Joskowicz, Elisha Sacks. [doi]
- Evaluation of a New Method to Compute Signs of DeterminantsFrancis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec. [doi]
- Printed Circuit Board Simplification: Simplifying Subdivisions in PracticeBerto van de Kraats, Marc J. van Kreveld, Mark H. Overmars. [doi]
- ::::VideHoc::::: A Visualizer for Homogeneous CoordinatesRobert R. Lewis. [doi]
- Geomview: A System for Geometric VisualizationNina Amenta, Stuart Levy, Tamara Munzner, Mark Phillips. [doi]
- Minimal Enclosing Parallelogram with ApplicationChristian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans. [doi]
- Union of Spheres (UoS) Model for Volumetric DataVishwa Ranjan, Alain Fournier. [doi]
- A Polynomial Time Algorithm for Minkowski ReconstructionPeter Gritzmann, Alexander Hufnagel. 1-9 [doi]
- Output-Sensitive Results on Convex Hulls, Extreme Points, and Related ProblemsTimothy M. Chan. 10-19 [doi]
- Immobilizing Polygons against a WallMark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink. 29-38 [doi]
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its ApplicationsPankaj K. Agarwal, Alon Efrat, Micha Sharir. 39-50 [doi]
- Efficient Collision Detection for Moving PolyhedraElmar Schömer, Christian Thiel. 51-60 [doi]
- A Comparison of Sequential Delaunay Triangulation AlgorithmsPeter Su, Robert L. (Scot) Drysdale III. 61-70 [doi]
- Voronoi Diagrams and Containment of Families of Convex Sets on the PlaneManuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia. 71-78 [doi]
- Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance FunctionsJean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec. 79-88 [doi]
- The Voronoi Diagram of Curved ObjectsHelmut Alt, Otfried Schwarzkopf. 89-97 [doi]
- Map Labeling Heuristics: Provably Good and Practically UsefulFrank Wagner, Alexander Wolff. 109-118 [doi]
- Overlaying Simply Connected Planar Subdivisions in Linear TimeUlrich Finke, Klaus Hinrichs. 119-126 [doi]
- New Lower Bounds for Hopcroft s Problem (Extended Abstract)Jeff Erickson. 127-137 [doi]
- A Helly-Type Theorem for Unions of Convex SetsJirí Matousek. 138-146 [doi]
- On Conway s Thrackle ConjectureLászló Lovász, János Pach, Mario Szegedy. 147-151 [doi]
- An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract)Sergei Bespamyatnikh. 152-161 [doi]
- The Rectangle Enclosure and Point-Dominance Problems RevisitedProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta. 162-171 [doi]
- Approximate Range SearchingSunil Arya, David M. Mount. 172-181 [doi]
- The Overlay of Lower Envelopes in Three Dimensions and Its ApplicationsPankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. 182-189 [doi]
- Rounding Arrangements DynamicallyLeonidas J. Guibas, David H. Marimont. 190-199 [doi]
- A New Technique for Analyzing Substructures in ArrangementsBoaz Tagansky. 200-210 [doi]
- Triangulations Intersect NicelyOswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote. 220-229 [doi]
- New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract)Matthew Dickerson, Scott A. McElfresh, Mark H. Montague. 238-247 [doi]
- Computing the Visibility Graph via Pseudo-TriangulationsMichel Pocchiola, Gert Vegter. 248-257 [doi]
- Stabbing Triangulations by Lines in 3DPankaj K. Agarwal, Boris Aronov, Subhash Suri. 267-276 [doi]
- A Complete and Practical Algorithm for Geometric Theorem Proving (Extended Abstract)Ashutosh Rege. 277-286 [doi]
- Monte Carlo Approximation of Form Factors with Error Bounded a PrioriMarco Pellegrini. 287-296 [doi]
- Strategies for Polyhedral Surface Decomposition: An Experimental StudyBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal. 297-305 [doi]
- An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract)Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu. 306-315 [doi]
- Visibility with ReflectionBoris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad. 316-325 [doi]
- Efficient Randomized Algorithms for Some Geometric Optimization ProblemsPankaj K. Agarwal, Micha Sharir. 326-335 [doi]
- Accounting for Boundary Effects in Nearest Neighbor SearchingSunil Arya, David M. Mount, Onuttom Narayan. 336-344 [doi]
- A Parallel Algorithm for Linear Programming in Fixed DimensionMartin E. Dyer. 345-349 [doi]
- Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract)Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap. 350-359 [doi]
- Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract)Cristian S. Mata, Joseph S. B. Mitchell. 360-369 [doi]
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear PlaneDanny Z. Chen, Kevin S. Klenk, Hung-Yi Tu. 370-379 [doi]
- Rectilinear Geodesics in 3-Space (Extended Abstract)Joonsoo Choi, Chee-Keng Yap. 380-389 [doi]