Table of Contents

• Fault-tolerant geometric spannersArtur Czumaj, Hairong Zhao. 1-10 [doi]
• Euclidean bounded-degree spanning tree ratiosTimothy M. Chan. 11-19 [doi]
• Approximation algorithms for aligning pointsSergio Cabello, Marc J. van Kreveld. 20-28 [doi]
• Shape fitting with outliersSariel Har-Peled, Yusu Wang. 29-38 [doi]
• High-dimensional shape fitting in linear timeSariel Har-Peled, Kasturi R. Varadarajan. 39-47 [doi]
• Smooth kinetic maintenance of clustersJohn Hershberger. 48-57 [doi]
• Polygon decomposition based on the straight line skeletonMirela Tanase, Remco C. Veltkamp. 58-67 [doi]
• Efficient algorithms for shared camera controlSariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg. 68-77 [doi]
• Good NEWS: partitioning a simple polygon by compass directionsMarc J. van Kreveld, Iris Reinbacher. 78-87 [doi]
• Geometric algorithms for static leaf sequencing problems in radiation therapyDanny Z. Chen, Xiaobo Hu, Shuang Luan, Chao Wang, Xiaodong Wu. 88-97 [doi]
• Topological graphs with no self-intersecting cycle of lenth 4Rom Pinchasi, Rados Radoicic. 98-103 [doi]
• Distinct distances in homogeneous setsJózsef Solymosi, Van H. Vu. 104-105 [doi]
• A tight bound for the number of different directions in three dimensionsJános Pach, Rom Pinchasi, Micha Sharir. 106-113 [doi]
• On conflict-free coloring of points and simple regions in the planeSariel Har-Peled, Shakhar Smorodinsky. 114-123 [doi]
• Long monotone paths in line arrangementsJózsef Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy. 124-128 [doi]
• New constructions of weak epsilon-netsJivri Matouaek. 129-135 [doi]
• Curve-sensitive cuttingsVladlen Koltun, Micha Sharir. 136-143 [doi]
• Spatial embedding of pseudo-triangulationsOswin Aichholzer, Franz Aurenhammer, Peter Braay. 144-153 [doi]
• Planar minimally rigid graphs and pseudo-triangulationsRuth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley. 154-163 [doi]
• The complexity of (un)foldingHelmut Alt, Christian Knauer, Günter Rote, Sue Whitesides. 164-170 [doi]
• Local polyhedra and geometric graphsJeff Erickson. 171-180 [doi]
• Updating and constructing constrained delaunay and constrained regular triangulations by flipsJonathan Richard Shewchuk. 181-190 [doi]
• Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generationFrançois Labelle, Jonathan Richard Shewchuk. 191-200 [doi]
• Complexity of the delaunay triangulation of points on surfaces the smooth caseDominique Attali, Jean-Daniel Boissonnat, André Lieutier. 201-210 [doi]
• Incremental constructions con BRIONina Amenta, Sunghee Choi, Günter Rote. 211-219 [doi]
• Proximate planar point locationJohn Iacono, Stefan Langerman. 220-226 [doi]
• Cost-driven octree construction schemes: an experimental studyBoris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. 227-236 [doi]
• Cache-oblivious data structures for orthogonal range searchingPankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley. 237-245 [doi]
• Near-optimal parameterization of the intersection of quadricsLaurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean. 246-255 [doi]
• (no title)Sylvain Pion, Chee-Keng Yap. 256-263 [doi]
• Controlled perturbation for arrangements of circlesDan Halperin, Eran Leiserowitz. 264-273 [doi]
• Optimized color gamuts for tiled displaysMarshall W. Bern, David Eppstein. 274-281 [doi]
• Hausdorff distance under translation for points and ballsPankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. 282-291 [doi]
• The smallest enclosing ball of balls: combinatorial structure and algorithmsKaspar Fischer, Bernd Gärtner. 292-301 [doi]
• Curve reconstruction from noisy samplesSiu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos. 302-311 [doi]
• Restricted delaunay triangulations and normal cycleDavid Cohen-Steiner, Jean-Marie Morvan. 312-321 [doi]
• Estimating surface normals in noisy point cloud dataNiloy J. Mitra, An Nguyen. 322-328 [doi]
• Shape dimension and intrinsic metric from samples of manifolds with high co-dimensionJoachim Giesen, Uli Wagner. 329-337 [doi]
• An optimal algorithm for the minimum edge cardinality cut surface problemDavid E. Cardoze. 338-343 [doi]
• Loops in reeb graphs of 2-manifoldsKree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci. 344-350 [doi]
• Molecular shape analysis based upon the morse-smale complex and the connolly functionFrédéric Cazals, Frédéric Chazal, Thomas Lewiner. 351-360 [doi]
• Morse-smale complexes for piecewise linear 3-manifoldsHerbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci. 361-370 [doi]
• the asteroid surveying problem and other puzzlesTimothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper. 372-373 [doi]
• VASCO: visualizing and animating spatial constructs and operationsFrantisek Brabec, Hanan Samet, Cemal Yilmaz. 374-375 [doi]
• Billboard cloudsXavier Décoret, Frédo Durand, François X. Sillion. 376 [doi]
• A 3-D visualization of kirkpatrick s planar point location algorithmJohn Iacono. 377 [doi]
• Morphing between shapes by using their straight skeletonsGill Barequet, Evgeny Yakersberg. 378-379 [doi]
• 3DTreeDraw: a thjree dimensional tree drawing systemTom Murtagh, Seok-Hee Hong. 380-381 [doi]
• Online dispersion algorithms for swarms of robotsTien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell. 382-383 [doi]
• Finding a curve in a mapCarola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote. 384-385 [doi]
• Fast penetration depth estimation using rasterization hardware and hierarchical refinementYoung J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha. 386-387 [doi]