19. Symposium on Computational Geometry 2003: San Diego, CA, USA

@proceedings{DBLP:conf/compgeom/2003,
  title     = {Proceedings of the 19th ACM Symposium on Computational Geometry,
               June 8-10, 2003, San Diego, CA, USA},
  publisher = {ACM},
  year      = {2003},
  isbn      = {1-58113-663-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Geometric graphs

• Artur Czumaj, Hairong Zhao:
  Fault-tolerant geometric spanners. 1-10
  
• Timothy M. Chan:
  Euclidean bounded-degree spanning tree ratios. 11-19
  
• Sergio Cabello, Marc J. van Kreveld:
  Approximation algorithms for aligning points. 20-28
  

Approximation

• Sariel Har-Peled, Yusu Wang:
  Shape fitting with outliers. 29-38
  
• Sariel Har-Peled, Kasturi R. Varadarajan:
  High-dimensional shape fitting in linear time. 39-47
  
• John Hershberger:
  Smooth kinetic maintenance of clusters. 48-57
  

Applications

• Mirela Tanase, Remco C. Veltkamp:
  Polygon decomposition based on the straight line skeleton. 58-67
  
• Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg:
  Efficient algorithms for shared camera control. 68-77
  
• Marc J. van Kreveld, Iris Reinbacher:
  Good NEWS: partitioning a simple polygon by compass directions. 78-87
  
• Danny Z. Chen, Xiaobo Hu, Shuang Luan, Chao Wang, Xiaodong Wu:
  Geometric algorithms for static leaf sequencing problems in radiation therapy. 88-97
  

Combinatorial geometry

• Rom Pinchasi, Rados Radoicic:
  Topological graphs with no self-intersecting cycle of lenth 4. 98-103
  
• József Solymosi, Van H. Vu:
  Distinct distances in homogeneous sets. 104-105
  
• János Pach, Rom Pinchasi, Micha Sharir:
  A tight bound for the number of different directions in three dimensions. 106-113
  
• Sariel Har-Peled, Shakhar Smorodinsky:
  On conflict-free coloring of points and simple regions in the plane. 114-123
  

Partitions and arrangements

• József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy:
  Long monotone paths in line arrangements. 124-128
  
• Jivri Matouaek:
  New constructions of weak epsilon-nets. 129-135
  
• Vladlen Koltun, Micha Sharir:
  Curve-sensitive cuttings. 136-143
  

Motion and pseudotriangulations

• Oswin Aichholzer, Franz Aurenhammer, Peter Braay:
  Spatial embedding of pseudo-triangulations. 144-153
  
• Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
  Planar minimally rigid graphs and pseudo-triangulations. 154-163
  
• Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides:
  The complexity of (un)folding. 164-170
  

Models and meshes

• Jeff Erickson:
  Local polyhedra and geometric graphs. 171-180
  
• Jonathan Richard Shewchuk:
  Updating and constructing constrained delaunay and constrained regular triangulations by flips. 181-190
  
• François Labelle, Jonathan Richard Shewchuk:
  Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation. 191-200
  
• Dominique Attali, Jean-Daniel Boissonnat, André Lieutier:
  Complexity of the delaunay triangulation of points on surfaces the smooth case. 201-210
  
• Nina Amenta, Sunghee Choi, Günter Rote:
  Incremental constructions con BRIO. 211-219
  

Data structures

• John Iacono, Stefan Langerman:
  Proximate planar point location. 220-226
  
• Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
  Cost-driven octree construction schemes: an experimental study. 227-236
  
• Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley:
  Cache-oblivious data structures for orthogonal range searching. 237-245
  

Numerical issues and robustness

• Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean:
  Near-optimal parameterization of the intersection of quadrics. 246-255
  
• Sylvain Pion, Chee-Keng Yap:
  Constructive root bound for k-ary rational input numbers. 256-263
  
• Dan Halperin, Eran Leiserowitz:
  Controlled perturbation for arrangements of circles. 264-273
  

Optimization

• Marshall W. Bern, David Eppstein:
  Optimized color gamuts for tiled displays. 274-281
  
• Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang:
  Hausdorff distance under translation for points and balls. 282-291
  
• Kaspar Fischer, Bernd Gärtner:
  The smallest enclosing ball of balls: combinatorial structure and algorithms. 292-301
  

Curve and surface reconstruction

• Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos:
  Curve reconstruction from noisy samples. 302-311
  
• David Cohen-Steiner, Jean-Marie Morvan:
  Restricted delaunay triangulations and normal cycle. 312-321
  
• Niloy J. Mitra, An Nguyen:
  Estimating surface normals in noisy point cloud data. 322-328
  
• Joachim Giesen, Uli Wagner:
  Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. 329-337
  

Topology

• David E. Cardoze:
  An optimal algorithm for the minimum edge cardinality cut surface problem. 338-343
  
• Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
  Loops in reeb graphs of 2-manifolds. 344-350
  
• Frédéric Cazals, Frédéric Chazal, Thomas Lewiner:
  Molecular shape analysis based upon the morse-smale complex and the connolly function. 351-360
  
• Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
  Morse-smale complexes for piecewise linear 3-manifolds. 361-370
  

Video and multimedia session

• Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
  the asteroid surveying problem and other puzzles. 372-373
  
• Frantisek Brabec, Hanan Samet, Cemal Yilmaz:
  VASCO: visualizing and animating spatial constructs and operations. 374-375
  
• Xavier Décoret, Frédo Durand, François X. Sillion:
  Billboard clouds. 376
  
• John Iacono:
  A 3-D visualization of kirkpatrick's planar point location algorithm. 377
  
• Gill Barequet, Evgeny Yakersberg:
  Morphing between shapes by using their straight skeletons. 378-379
  
• Tom Murtagh, Seok-Hee Hong:
  3DTreeDraw: a thjree dimensional tree drawing system. 380-381
  
• Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
  Online dispersion algorithms for swarms of robots. 382-383
  
• Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote:
  Finding a curve in a map. 384-385
  
• Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha:
  Fast penetration depth estimation using rasterization hardware and hierarchical refinement. 386-387
  

Last update Thu May 24 04:15:12 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page