Abstract is missing.
- Radiosity in Flatland Made Visibly Simple: Using the Visibility Complex for Lighting Simulation of Dynamic Scenes in FlatlandFrédo Durand, Rachel Orti, Stéphane Rivière, Claude Puech. [doi]
- Four-Polytopes and a Funeral (for my conjecture)Nina Amenta. [doi]
- Maintenance of the Set of Segments Visible from a Moving Viewpoint in Two DimensionsSherif Ghali, A. James Stewart. [doi]
- Collision Detection for Fly-Throughs in Virtual EnvironmentsMartin Held, James T. Klosowski, Joseph S. B. Mitchell. [doi]
- Experimental Results of Randomized Clustering AlgorithmMary Inaba, Hiroshi Imai, Naoki Katoh. [doi]
- Testing Control Systems Through Dynamic SimulationBrian Mirtich, John F. Canny. [doi]
- The Rotation Diagram and Optimal Containing Placements of a Convex PolygonMatthew Dickerson, Daniel Scharstein. [doi]
- A Package for TriangulationsTsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis. [doi]
- Partial Surface Matching by Using Directed FootprintsGill Barequet, Micha Sharir. [doi]
- Geometric Tree Matching with Applications to 3D Lung StructuresChandrasekhar Pisupati, Lawrence B. Wolff, Wayne Mitzner, Elias A. Zerhouni. [doi]
- Simple Traversal of a Subdivision Without Extra StorageMark de Berg, René van Oostrum, Mark H. Overmars. [doi]
- The Graph of Triangulations of a Convex PolygonFerran Hurtado, Marc Noy. [doi]
- On Computing Edges That Are In All Minimum-Weight TriangulationsPatrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink. [doi]
- Smallest Enclosing CylindersElmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. [doi]
- On the Sectional Area of Convex PolytopesDavid Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink. [doi]
- Curve Based Stereo Matching Using the Minimum Hausdorff DistanceKlara Kedem, Yana Yarmovski. [doi]
- The Power of Coherence: Fast Tessellation of SurfacesSubodh Kumar, Dinesh Manocha. [doi]
- Animating Geometric Algorithms Over the WebJames E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia. [doi]
- New Lower Bounds for Convex Hull Problems in Odd DimensionsJeff Erickson. 1-9 [doi]
- Shadows and Slices of PolytopesNina Amenta, Günter M. Ziegler. 10-19 [doi]
- Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its ApplicationsOtfried Schwarzkopf, Micha Sharir. 20-29 [doi]
- On the Number of Arrangements of PseudolinesStefan Felsner. 30-37 [doi]
- On Triangulating Three-Dimensional PolygonsGill Barequet, Matthew Dickerson, David Eppstein. 38-47 [doi]
- An Aspect Ratio Bound for Triangulating a ::::d::::-Grid Cut by a Hyperplane (Extended Abstract)Scott A. Mitchell, Stephen A. Vavasis. 48-57 [doi]
- Linear Complexity Hexahedral Mesh GenerationDavid Eppstein. 58-67 [doi]
- Temporally Coherent Conservative Visibility (Extended Abstract)Satyan R. Coorg, Seth J. Teller. 78-87 [doi]
- Splitting a Complex of Convex Polytopes In Any DimensionChandrajit L. Bajaj, Valerio Pascucci. 88-97 [doi]
- A Near-Linear Algorithm for the Planar 2-Center ProblemMicha Sharir. 106-112 [doi]
- On Piercing Sets of ObjectsMatthew J. Katz, Frank Nielsen. 113-121 [doi]
- Rectilinear and Polygonal ::::p::::-Piercing and ::::p::::-Center ProblemsMicha Sharir, Emo Welzl. 122-132 [doi]
- Parallel Robust Algorithms for Constructing Strongly Convex HullsWei Chen, Koichi Wada, Kimio Kawaguchi. 133-140 [doi]
- Checking Geometric Programs or Verification of Geometric StructuresKurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig. 159-165 [doi]
- On Computing Voronoi Diagrams by Divide-Prune-and-ConquerNancy M. Amato, Edgar A. Ramos. 166-175 [doi]
- Faster Output-Sensitive Parallel Convex Hulls for ::::d::::<=3: Optimal Sublogarithmic Algorithms for Small OutputsNeelima Gupta, Sandeep Sen. 176-185 [doi]
- Developing a Practical Projection-Based Parallel Delaunay AlgorithmGuy E. Blelloch, Gary L. Miller, Dafna Talmor. 186-195 [doi]
- Approaching the Largest beta-Skeleton within a Minimum Weight TriangulationSiu-Wing Cheng, Yin-Feng Xu. 196-203 [doi]
- A (Usually?) Connected Subgraph of the Minimum Weight TriangulationMatthew Dickerson, Mark H. Montague. 204-213 [doi]
- Flipping Edges in TriangulationsFerran Hurtado, Marc Noy, Jorge Urrutia. 214-223 [doi]
- Enumeration of Regular TriangulationsTomonari Masada, Hiroshi Imai, Keiko Imai. 224-233 [doi]
- An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple PolygonsG. D. Ramkumar. 234-241 [doi]
- A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract)Jean-Daniel Boissonnat, Sylvain Lazard. 242-251 [doi]
- ::::d::::::1::-Optimal Motion for a Rod (Extended Abstract)Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. 252-263 [doi]
- Optimal Robot Localization in TreesKathleen Romanik, Sven Schuierer. 264-273 [doi]
- Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay TriangulationsErnst P. Mücke, Isaac Saias, Binhai Zhu. 274-283 [doi]
- Fixed-Dimensional Linear Programming Queries Made EasyTimothy M. Chan. 284-290 [doi]
- Pseudo-Triangulations: Theory and ApplicationsMichel Pocchiola, Gert Vegter. 291-300 [doi]
- Improvements on Bottleneck Matching and Related Problems Using GeometryAlon Efrat, Alon Itai. 301-310 [doi]
- Approximating Monotone Polygonal Curves Using the Uniform MetricKasturi R. Varadarajan. 311-318 [doi]
- Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version)Marek Chrobak, Michael T. Goodrich, Roberto Tamassia. 319-328 [doi]
- Approximating Shortest Paths on a Convex Polytope in Three DimensionsSariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan. 329-338 [doi]
- Monotonicity of Rectilinear Geodesics in ::::d::::-Space (Extended Abstract)Joonsoo Choi, Chee-Keng Yap. 339-348 [doi]
- Disk Packings and Planar SeparatorsDaniel A. Spielman, Shang-Hua Teng. 349-358 [doi]
- Ramsey-Type Results for Geometric GraphsGyula Károlyi, János Pach, Géza Tóth. 359-365 [doi]