19th ACM Symposium on
Computational Geometry

June 8-10, 2003   -   San Diego, USA
In conjunction with FCRC 2003
Sponsored by ACM SIGACT and SIGGRAPH
 

       
General Information Electronic Submissions Accepted Papers Committees Conference Program  

(Go to the list of Accepted Videos.)

List of Accepted Papers

  1. High-Dimensional Shape Fitting in Linear Time
    Sariel Har-Peled and Kasturi R. Varadarajan
  2. On Conflict-Free Coloring of Points and Simple Regions in the Plane
    Sariel Har-Peled and Shakhar Smorodinsky
  3. Controlled Perturbation for Arrangements of Circles
    Dan Halperin and Eran Leiserowitz
  4. Shape Fitting with Outliers
    Sariel Har-Peled and Yusu Wang
  5. Proximate Planar Point Location
    John Iacono and Stefan Langerman
  6. Spatial Embedding of Pseudo-Triangulations
    Oswin Aichholzer and Franz Aurenhammer and Peter Brass and Hannes Krasser
  7. Updating and Constructing Constrained Delaunay and Constrained Regular Triangulations by Flips
    Jonathan Richard Shewchuk
  8. Topological graphs with no self-intersecting cycle of length 4
    Rom Pinchasi and Rados Radoicic
  9. Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation
    Francois Labelle and Jonathan Richard Shewchuk
  10. Euclidean Bounded-Degree Spanning Tree Ratios
    Timothy M. Chan
  11. Optimized Color Gamuts for Tiled Displays
    Marshall Bern and David Eppstein
  12. Polygon Decomposition based on the Straight Line Skeleton
    Mirela Tanase, Remco Veltkamp
  13. Incremental Constructions con BRIO
    Nina Amenta, Sunghee Choi, and Guenter Rote
  14. Hausdorff Distance under Translation for Points, Disks, and Balls
    Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir and Yusu Wang
  15. An Optimal Algorithm for the Minimum Length Cut Surface Problem
    David E. Cardoze
  16. Loops in Reeb Graphs of 2-Manifolds
    Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan and Valerio Pascucci
  17. Long Monotone Paths in Line Arrangements
    Jozsef Balogh and Oded Regev and Clifford Smyth and William Steiger and Mario Szegedy
  18. Efficient Algorithms for Shared Camera Control
    Sariel Har-Peled, Vladlen Koltun, Dezhen Song, and Ken Goldberg
  19. Distinct distances in homogeneous pointsets
    Jozsef Solymosi and Van Vu
  20. A tight bound for the number of different directions in three dimensions
    J. Pach, R. Pinchasi and M. Sharir
  21. Good NEWS: Partitioning a Simple Polygon by Compass Directions
    Marc van Kreveld and Iris Reinbacher
  22. Approximation Algorithms for Aligning Points
    Sergio Cabello and Marc van Kreveld
  23. The Complexity of (Un)folding
    Helmut Alt, Christian Knauer, Guenter Rote, Sue Whitesides
  24. New Constructions for Weak Epsilon-Nets
    Jiri Matousek and Uli Wagner
  25. Molecular Shape Analysis based upon the Morse-Smale Complex and the Connolly Function
    Frederic Cazals, Frederic Chazal, Thomas Lewiner
  26. Planar Minimally Rigid Graphs and Pseudo-Triangulations
    R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, W.Whiteley
  27. Near-Optimal Parameterization of the Intersection of Quadrics
    Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean
  28. Curve-Sensitive Cuttings
    Vladlen Koltun and Micha Sharir
  29. Constructive Root Bound for k-Ary Rational Input Numbers
    Sylvain Pion and Chee Yap
  30. Curve Reconstruction from Noisy Samples
    S. W. Cheng, S. Funke, M. Golin, P. Kumar, S.-H. Poon and E.A. Ramos
  31. Morse Complexes for Piecewise Linear 3-Manifolds
    Herbert Edelsbrunner, John Harer, Vijay Natarajan and Valerio Pascucci
  32. Geometric Algorithms for Static Leaf Sequencing Problems in Radiation Therapy
    D.Z. Chen and X.S. Hu and S. Luan and C. Wang and X. Wu
  33. Complexity of the Delaunay Triangulation of Points on Surfaces: The Smooth Case
    D. Attali and J.-D. Boissonnat and A. Lieutier
  34. The Smallest Enclosing Ball of Balls: Combinatorial Structure and Algorithms
    Bernd Gaertner, Kaspar Fischer
  35. Local polyhedra and geometric graphs
    Jeff Erickson
  36. Smooth Kinetic Maintenance of Clusters
    John Hershberger
  37. Restricted Delaunay triangulations and normal cycle
    David Cohen-Steiner and Jean-Marie Morvan
  38. On Cache-Oblivious Multidimensional Range Searching
    Pankaj Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
  39. Estimating Surface Normals in Noisy Point Cloud Data
    Niloy J. Mitra, An Nguyen
  40. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
    Joachim Giesen, Uli Wagner
  41. Fault-Tolerant Geometric Spanners
    Artur Czumaj and Hairong Zhao
  42. Cost-Driven Octree Construction Schemes: An Experimental Study
    Boris Aronov, Herve Bronnimann, Allen Y. Chang, and Yi-Jen Chiang

19th ACM Symposium on Computational Geometry 2003