Table of Contents

• Dynamic coresetsTimothy M. Chan. 1-9 [doi]
• Optimizing active ranges for consistent dynamic map labelingKen Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff. 10-19 [doi]
• Maximum thick paths in static and dynamic environmentsEsther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk. 20-27 [doi]
• Circular partitions with applications to visualization and embeddingsKrzysztof Onak, Anastasios Sidiropoulos. 28-37 [doi]
• Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applicationsAlexander I. Bobenko. 38 [doi]
• Tighter bounds for random projections of manifoldsKenneth L. Clarkson. 39-48 [doi]
• Markov convexity and local rigidity of distorted metricsManor Mendel, Assaf Naor. 49-58 [doi]
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphsVictor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès. 59-68 [doi]
• The complexity of the outer face in arrangements of random segmentsNoga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir. 69-78 [doi]
• On ::::s::::-intersecting curves and related problemsSarit Buzaglo, Ron Holzman, Rom Pinchasi. 79-84 [doi]
• On levels in arrangements of curves, iii: further improvementsTimothy M. Chan. 85-93 [doi]
• A (slightly) faster algorithm for klee s measure problemTimothy M. Chan. 94-100 [doi]
• Walking your dog in the woods in polynomial timeErin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite. 101-109 [doi]
• Hinged dissections existTimothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers. 110-119 [doi]
• Helly-type theorems for approximate coveringJulien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. 120-128 [doi]
• I/o-efficient efficient algorithms for computing contours on a terrainPankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri. 129-138 [doi]
• External memory planar point location with logarithmic updatesLars Arge, Gerth Stølting Brodal, S. Srinivasa Rao. 139-147 [doi]
• Self-improving algorithms for delaunay triangulationsKenneth L. Clarkson, C. Seshadhri. 148-155 [doi]
• Markov incremental constructionsBernard Chazelle, Wolfgang Johann Heinrich Mulzer. 156-163 [doi]
• Exact geometric-topological analysis of algebraic surfacesEric Berberich, Michael Kerber, Michael Sagraloff. 164-173 [doi]
• Predicates for line transversals to lines and line segments in three-dimensional spaceOlivier Devillers, Marc Glisse, Sylvain Lazard. 174-181 [doi]
• Robust construction of the three-dimensional flow complexFrédéric Cazals, Aditya Parameswaran, Sylvain Pion. 182-191 [doi]
• On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphismHans Raj Tiwary, Khaled M. Elbassioni. 192-198 [doi]
• New existence proofs epsilon-netsEvangelia Pyrga, Saurabh Ray. 199-207 [doi]
• Extremal problems on triangle areas in two and three dimensionsAdrian Dumitrescu, Micha Sharir, Csaba D. Tóth. 208-217 [doi]
• Arrangements of geodesic arcs on the sphereEfi Fogel, Ophir Setter, Dan Halperin. 218-219 [doi]
• Delpsc: a delaunay mesher for piecewise smooth complexesTamal K. Dey, Joshua A. Levine. 220-221 [doi]
• On the computation of 3d periodic triangulationsManuel Caroli, Monique Teillaud. 222-223 [doi]
• Visualizing and exploring planar algebraic arrangements: a web applicationPavel Emeliyanenko, Michael Kerber. 224-225 [doi]
• Analyzing rigidity with pebble gamesAudrey Lee, Ileana Streinu, Louis Theran. 226-227 [doi]
• Minkowski sums of rotating convex polyhedraJyh-Ming Lien. 228-229 [doi]
• Routing a maximum number of disks through a scene of moving obstaclesJoondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen. 230-231 [doi]
• Towards persistence-based reconstruction in euclidean spacesFrédéric Chazal, Steve Oudot. 232-241 [doi]
• Reeb spaces of piecewise linear mappingsHerbert Edelsbrunner, John Harer, Amit K. Patel. 242-250 [doi]
• Testing contractibility in planar rips complexesErin W. Chambers, Jeff Erickson, Pratik Worah. 251-259 [doi]
• Approximating the pathway axis and the persistence diagram of a collection of balls in 3-spaceEitan Yaffe, Dan Halperin. 260-269 [doi]
• Locally uniform anisotropic meshingJean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec. 270-277 [doi]
• Discrete laplace operator on meshed surfacesMikhail Belkin, Jian Sun, Yusu Wang. 278-287 [doi]
• Untangling triangulations through local explorationsPankaj K. Agarwal, Bardia Sadri, Hai Yu. 288-297 [doi]
• Delaunay triangulations of imprecise pointsin linear time after preprocessingMaarten Löffler, Jack Snoeyink. 298-304 [doi]
• Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measuresKenneth L. Clarkson. 305 [doi]
• A simple and efficient kinetic spannerMohammad Ali Abam, Mark de Berg, Joachim Gudmundsson. 306-310 [doi]
• Schnyder woods for higher genus triangulated surfacesLuca Castelli Aleardi, Éric Fusy, Thomas Lewiner. 311-319 [doi]
• Embedding and similarity search for point sets under translationMinkyoung Cho, David M. Mount. 320-327 [doi]
• Fast enumeration algorithms for non-crossing geometric graphsNaoki Katoh, Shin-ichi Tanigawa. 328-337 [doi]
• Polychromatic colorings of plane graphsNoga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein. 338-345 [doi]
• Coloring ::::k::k::::::-free intersection graphs of geometric objects in the planeJacob Fox, János Pach. 346-354 [doi]
• Consistent digital raysJinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama. 355-364 [doi]
• Combinatorial genericity and minimal rigidityIleana Streinu, Louis Theran. 365-374 [doi]
• Improved upper bounds on the crossing numberVida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood. 375-384 [doi]
• Intersecting convex sets by raysRadoslav Fulek, Andreas Holmsen, János Pach. 385-391 [doi]