default search action
14th SCG 1998: Minneapolis, Minnesota, USA
- Ravi Janardan:
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998. ACM 1998, ISBN 0-89791-973-4
Session 1, Applied Track
- Victor Milenkovic:
Rotational Polygon Containment and Minimum Enclosure. 1-8 - Dan Halperin, Jean-Claude Latombe, Randall H. Wilson:
A General Framework for Assembly Planning: The Motion Space Approach. 9-18 - Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt:
Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. 19-28 - Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam:
Design and Analysis of Planar Shape Deformation. 29-38
Session 2, Theoretical Track
- Nina Amenta, Marshall W. Bern:
Surface Reconstruction by Voronoi Filtering. 39-48 - Jack Snoeyink:
Cross-Ratios and Angles Determine a Polygon. 49-57 - David Eppstein, Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. 58-67 - Sergey P. Tarasov, Michael N. Vyalyi:
Construction of Contour Trees in 3D in O(n log n) Steps. 68-75
Session 3: Applied and Theoretical Track
- Jonathan Richard Shewchuk:
A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations. 76-85 - Jonathan Richard Shewchuk:
Tetrahedral Mesh Generation by Delaunay Refinement. 86-95 - Ronald Beirouti, Jack Snoeyink:
Implementations of the LMT Heuristic for Minimum Weight Triangulation. 96-105 - Olivier Devillers:
Improved Incremental Randomized Delaunay Triangulation. 106-115
Session 4: Theoretical Track
- Steven Fortune:
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. 116-125 - Marcus Vinícius Alvim Andrade, Jorge Stolfi:
Exact Algorithms for Circles on the Sphere. 126-134 - Alexandra Solan:
Cutting Cylces of Rods in Space. 135-142 - Alon Efrat, Sariel Har-Peled:
Fly Cheaply: On the Minimum Fuel-Consumption Problem. 143-145
Session 5: Applied Track
- Lutz Kettner:
Designing a Data Structure for polyhedral Surfaces. 146-154 - David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne:
Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. 155-164 - Hervé Brönnimann, Christoph Burnikel, Sylvain Pion:
Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. 165-174 - Christoph Burnikel, Stefan Funke, Michael Seel:
Exact Geometric Predicates Using Cascaded Computation. 175-183
Session 6: Applied Track
- Géza Tóth, Pavel Valtr:
Geometric Graphs with Few Disjoint Edges. 184-191 - Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl:
Results on k-Sets and j-Facets via Continuous Motion. 192-199 - Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy:
Point-Sets with few k-Sets. 200-205 - Alon Efrat, Matthew J. Katz:
On the Union of k-Curved Objects. 206-213
Session 7: Applied Track
- Fred L. Bookstein:
Features of Deformation Grids: An Approach via Singularity Theory. 214-221 - Frédéric Cazals:
Effective Nearest Neighbors Searching on the Hyper-Cube, with Applications to Molecular Clustering. 222-230 - Frank Hoffmann, Klaus Kriegel, Carola Wenk:
Matching 2D Patterns of Protein Spots. 231-239 - James D. Fix, Richard E. Ladner:
Multiresolution Banded Refinement to Accelerate Surface Reconstruction from Polygons. 240-248
Session 8: Theoretical Track
- Hervé Brönnimann:
Degenerate Convex Hulls On-Line in Any Fixed Dimension. 249-258 - Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems. 259-268 - Timothy M. Chan:
Geometric Applications of a Randomized Optimization Technique. 269-278 - Timothy M. Chan:
On Enumerating and Selecting Distances. 279-286
Session 9: Theoretical Track
- Therese C. Biedl:
Drawing Planar Partitions I: LL-Drawings and LH-Drawings. 287-296 - Sunil Arya, Siu-Wing Cheng, David M. Mount:
Approximation Algorithms for Multiple-Tool Miling. 297-306 - Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan:
Resource-Constrained Geometric Network Optimization. 307-316 - Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. 317-326
Session 10: Applied Track
- Sariel Har-Peled:
Constructing Cuttings in Theory and Practice. 327-336 - Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Point Set Labeling with Sliding Labels. 337-346 - Konstantinos G. Kakoulis, Ioannis G. Tollis:
A Unified Approach to Labeling Graphical Features. 347-356 - Sariel Har-Peled:
An Output Sensitive Algorithm for Discrete Convex Hulls. 357-364
Session 11: Theoretical Track
- Edward J. Anderson, Sándor P. Fekete:
Asymmetric Rendezvous on the Plane. 365-373 - Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. 374-382 - Sariel Har-Peled:
Constructing Approximate Shortest Path Maps in Three Dimensions. 383-391 - Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). 392-401
Video Review
- Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai:
Voronoi Diagrams by Divergences with Additive Weights. 403-404 - Maria Shneerson, Ayellet Tal:
GASP-II - A Geometric Algorithm Animation System for an Electronic Classroom. 405-406 - Luiz Velho, Jonas Gomes, Marcos Vinicius Rayol Sobreiro:
Visualization of Color Image Quantization Using Pairwise Clustering. 407-408 - Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. 409-410 - Alejo Hausner, David P. Dobkin:
GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation. 411-412 - Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicario:
Viewspace Partitioning of Densely Occluded Scenes. 413-414 - David P. Dobkin, Emden R. Gansner:
A Path Router for Graph Drawing. 415-416
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.