Abstract is missing.
- Rotational Polygon Containment and Minimum EnclosureVictor Milenkovic. 1-8 [doi]
- A General Framework for Assembly Planning: The Motion Space ApproachDan Halperin, Jean-Claude Latombe, Randall H. Wilson. 9-18 [doi]
- Multi-Criteria Geometric Optimization Problems in Layered ManufacturingJayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt. 19-28 [doi]
- Design and Analysis of Planar Shape DeformationSiu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam. 29-38 [doi]
- Surface Reconstruction by Voronoi FilteringNina Amenta, Marshall W. Bern. 39-48 [doi]
- Cross-Ratios and Angles Determine a PolygonJack Snoeyink. 49-57 [doi]
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise InteractionsDavid Eppstein, Jeff Erickson. 58-67 [doi]
- A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay TriangulationsJonathan Richard Shewchuk. 76-85 [doi]
- Tetrahedral Mesh Generation by Delaunay RefinementJonathan Richard Shewchuk. 86-95 [doi]
- Vertex-Rounding a Three-Dimensional Polyhedral SubdivisionSteven Fortune. 116-125 [doi]
- Exact Algorithms for Circles on the SphereMarcus Vinícius Alvim Andrade, Jorge Stolfi. 126-134 [doi]
- Cutting Cylces of Rods in SpaceAlexandra Solan. 135-142 [doi]
- Fly Cheaply: On the Minimum Fuel-Consumption ProblemAlon Efrat, Sariel Har-Peled. 143-145 [doi]
- Designing a Data Structure for polyhedral SurfacesLutz Kettner. 146-154 [doi]
- Improved Algorithms for Robust Point Pattern Matching and Applications to Image RegistrationDavid M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne. 155-164 [doi]
- Interval Arithmetic Yields Efficient Dynamic Filters for Computational GeometryHervé Brönnimann, Christoph Burnikel, Sylvain Pion. 165-174 [doi]
- Exact Geometric Predicates Using Cascaded ComputationChristoph Burnikel, Stefan Funke, Michael Seel. 175-183 [doi]
- Geometric Graphs with Few Disjoint EdgesGéza Tóth, Pavel Valtr. 184-191 [doi]
- Results on ::::k::::-Sets and ::::j::::-Facets via Continuous MotionArtur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl. 192-199 [doi]
- Point-Sets with few ::::k::::-SetsHelmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy. 200-205 [doi]
- On the Union of ::::k::::-Curved ObjectsAlon Efrat, Matthew J. Katz. 206-213 [doi]
- Features of Deformation Grids: An Approach via Singularity TheoryFred L. Bookstein. 214-221 [doi]
- Effective Nearest Neighbors Searching on the Hyper-Cube, with Applications to Molecular ClusteringFrédéric Cazals. 222-230 [doi]
- Matching 2D Patterns of Protein SpotsFrank Hoffmann, Klaus Kriegel, Carola Wenk. 231-239 [doi]
- Multiresolution Banded Refinement to Accelerate Surface Reconstruction from PolygonsJames D. Fix, Richard E. Ladner. 240-248 [doi]
- Degenerate Convex Hulls On-Line in Any Fixed DimensionHervé Brönnimann. 249-258 [doi]
- Randomized External-Memory Algorithms for Some Geometric ProblemsAndreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos. 259-268 [doi]
- Geometric Applications of a Randomized Optimization TechniqueTimothy M. Chan. 269-278 [doi]
- On Enumerating and Selecting DistancesTimothy M. Chan. 279-286 [doi]
- Drawing Planar Partitions I: LL-Drawings and LH-DrawingsTherese C. Biedl. 287-296 [doi]
- Approximation Algorithms for Multiple-Tool MilingSunil Arya, Siu-Wing Cheng, David M. Mount. 297-306 [doi]
- Resource-Constrained Geometric Network OptimizationEsther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan. 307-316 [doi]
- Efficiently Approximating Polygonal Paths in Three and Higher DimensionsGill Barequet, Michael T. Goodrich. 317-326 [doi]
- Constructing Cuttings in Theory and PracticeSariel Har-Peled. 327-336 [doi]
- Point Set Labeling with Sliding LabelsMarc J. van Kreveld, Tycho Strijk, Alexander Wolff. 337-346 [doi]
- A Unified Approach to Labeling Graphical FeaturesKonstantinos G. Kakoulis, Ioannis G. Tollis. 347-356 [doi]
- An Output Sensitive Algorithm for Discrete Convex HullsSariel Har-Peled. 357-364 [doi]
- Asymmetric Rendezvous on the PlaneEdward J. Anderson, Sándor P. Fekete. 365-373 [doi]
- Motion Planning for Multiple RobotsBoris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels. 374-382 [doi]
- Constructing Approximate Shortest Path Maps in Three DimensionsSariel Har-Peled. 383-391 [doi]
- Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract)Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. 392-401 [doi]
- Voronoi Diagrams by Divergences with Additive WeightsKunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai. 403-404 [doi]
- GASP-II - A Geometric Algorithm Animation System for an Electronic ClassroomMaria Shneerson, Ayellet Tal. 405-406 [doi]
- Visualization of Color Image Quantization Using Pairwise ClusteringLuiz Velho, Jonas Gomes, Marcos Vinicius Rayol Sobreiro. 407-408 [doi]
- Optimal Floodlight Illumination of StagesFelipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia. 409-410 [doi]
- GAWAIN: Visualizing Geometric Algorithms with Web-Based AnimationAlejo Hausner, David P. Dobkin. 411-412 [doi]
- Viewspace Partitioning of Densely Occluded ScenesYiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicario. 413-414 [doi]
- A Path Router for Graph DrawingDavid P. Dobkin, Emden R. Gansner. 415-416 [doi]