Table of Contents

• Geodesic ham-sandwich cutsProsenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin. 1-9 [doi]
• Separating point sets in polygonal environmentsErik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides. 10-16 [doi]
• Approximate convex decomposition of polygonsJyh-Ming Lien, Nancy M. Amato. 17-26 [doi]
• Computing the visibility graph of points within a polygonBoaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell. 27-35 [doi]
• On lines avoiding unit balls in three dimensionsPankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. 36-45 [doi]
• The number of lines tangent to arbitrary convex polyhedra in 3DHervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides. 46-55 [doi]
• Random monotone paths on polyhedraGünter M. Ziegler. 56 [doi]
• On distinct distances from a vertex of a convex polygonAdrian Dumitrescu. 57-60 [doi]
• Algorithms for center and Tverberg pointsPankaj K. Agarwal, Micha Sharir, Emo Welzl. 61-67 [doi]
• Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth. 68-75 [doi]
• Solution of Scott s problem on the number of directions determined by a point set in 3-spaceJános Pach, Rom Pinchasi, Micha Sharir. 76-85 [doi]
• Continuous path verification in multi-axis NC-machiningRon Wein, Oleg Ilushin, Gershon Elber, Dan Halperin. 86-95 [doi]
• Finding planar regions in a terrain: in practice and with a guarantreeStefan Funke, Theocharis Malamatos, Rahul Ray. 96-105 [doi]
• A scalable simulator for forest dynamicsSathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark. 106-115 [doi]
• Pushing squares aroundAdrian Dumitrescu, János Pach. 116-123 [doi]
• New results on shortest paths in three dimensionsJoseph S. B. Mitchell, Micha Sharir. 124-133 [doi]
• An energy-driven approach to linkage unfoldingJason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O Brien. 134-143 [doi]
• Deterministic sampling and range counting in geometric data streamsAmitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. 144-151 [doi]
• Faster core-set constructions and data stream algorithms in fixed dimensionsTimothy M. Chan. 152-159 [doi]
• Range counting over multidimensional data streamsSubhash Suri, Csaba D. Tóth, Yunhong Zhou. 160-169 [doi]
• An empirical comparison of techniques for updating Delaunay triangulationsLeonidas J. Guibas, Daniel Russel. 170-179 [doi]
• A 2D kinetic triangulation with near-quadratic topological changesPankaj K. Agarwal, Yusu Wang, Hai Yu. 180-189 [doi]
• Deformable spanners and applicationsJie Gao, Leonidas J. Guibas, An Nguyen. 190-199 [doi]
• A computational framework for incremental motionDavid M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. 200-209 [doi]
• Counting and representing intersections among triangles in three dimensionsEsther Ezra, Micha Sharir. 210-219 [doi]
• Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curveIlya Baran, Erik D. Demaine. 220-229 [doi]
• Binary space partitions of orthogonal subdivisionsJohn Hershberger, Subhash Suri, Csaba D. Tóth. 230-238 [doi]
• Towards in-place geometric algorithms and data structuresHervé Brönnimann, Timothy M. Chan, Eric Y. Chen. 239-246 [doi]
• A near-linear constant-factor approximation for euclidean bipartite matching?Pankaj K. Agarwal, Kasturi R. Varadarajan. 247-252 [doi]
• Locality-sensitive hashing scheme based on p-stable distributionsMayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni. 253-262 [doi]
• Practical methods for shape fitting and kinetic data structures using core setsHai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan. 263-272 [doi]
• On the least median square problemJeff Erickson, Sariel Har-Peled, David M. Mount. 273-279 [doi]
• Sampling and meshing a surface with guaranteed topology and geometrySiu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray. 280-289 [doi]
• Quality meshing for polyhedra with small anglesSiu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray. 290-299 [doi]
• Spacetime meshing with adaptive refinement and coarseningReza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert Haber, John M. Sullivan, Shripad Thite, Yuan Zhou. 300-309 [doi]
• A Bézier-based approach to unstructured moving meshesDavid E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington. 310-319 [doi]
• Low-dimensional embedding with extra informationMihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk. 320-329 [doi]
• Provable surface reconstruction from noisy samplesTamal K. Dey, Samrat Goswami. 330-339 [doi]
• The geometric thickness of low degree graphsChristian A. Duncan, David Eppstein, Stephen G. Kobourov. 340-346 [doi]
• Computing persistent homologyAfra Zomorodian, Gunnar Carlsson. 347-356 [doi]
• Extreme elevation on a 2-manifoldPankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang. 357-365 [doi]
• Time-varying reeb graphs for continuous space-time dataHerbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci. 366-372 [doi]
• Searching for 2D RNA geometries in bacterial genomesUri Laserson, Hin Hark Gan, Tamar Schlick. 373-377 [doi]
• On locally Delaunay geometric graphsRom Pinchasi, Shakhar Smorodinsky. 378-382 [doi]
• On the union of kapa-round objectsBoris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. 383-390 [doi]
• On empty convex polygons in a planar point setRom Pinchasi, Rados Radoicic, Micha Sharir. 391-400 [doi]
• The criss-cross method can take Omega(n:::d:::) pivotsBohdan Kaluzny, Komei Fukuda. 401-408 [doi]
• Complete, exact, and efficient computations with cubic curvesArno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert. 409-418 [doi]
• Intersecting quadrics: an efficient and exact implementationSylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean. 419-428 [doi]
• Inner and outer rounding of set operations on lattice polygonal regionsOlivier Devillers, Philippe Guigue. 429-437 [doi]
• Towards and open curved kernelIoannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas. 438-446 [doi]
• Adaptive mesh generation for real-time terrain modelingRussel A. Apu, Marina L. Gavrilova. 447-448 [doi]
• Searching with an autonomous robotSándor P. Fekete, Rolf Klein, Andreas Nüchter. 449-450 [doi]
• Morphing planar graphsCesim Erten, Stephen G. Kobourov, Chandan Pitta. 451-452 [doi]
• The corner arc algorithmOlaf A. Hall-Holt. 453-454 [doi]
• Single-strip triangulation of manifolds with arbitrary topologyDavid Eppstein, M. Gopi. 455-456 [doi]
• Approximate convex decompositionJyh-Ming Lien, Nancy M. Amato. 457-458 [doi]