Table of Contents

• Optimal partition treesTimothy M. Chan. 1-10 [doi]
• Consistent digital line segmentsTobias Christ, Dömötör Pálvölgyi, Milos Stojakovic. 11-18 [doi]
• The geometry of flockingBernard Chazelle. 19-28 [doi]
• Tight lower bounds for halfspace range searchingSunil Arya, David M. Mount, Jian Xia. 29-37 [doi]
• Discrete geometric structures for architectureHelmut Pottmann. 38 [doi]
• Better bounds on the union complexity of locally fat objectsMark de Berg. 39-47 [doi]
• On the complexity of sets of free lines and line segments among balls in three dimensionsMarc Glisse, Sylvain Lazard. 48-57 [doi]
• Lines avoiding balls in three dimensions revisitedNatan Rubin. 58-67 [doi]
• Adding one edge to planar graphs makes crossing number hardSergio Cabello, Bojan Mohar. 68-76 [doi]
• Planar visibility: testing and countingJoachim Gudmundsson, Pat Morin. 77-86 [doi]
• The 2-center problem in three dimensionsPankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. 87-96 [doi]
• Linkless and flat embeddings in 3-space and the unknot problemKen-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar. 97-106 [doi]
• Visualizing 3D Euler spiralsGur Harary, Ayellet Tal. 107-108 [doi]
• Shape approximation using k-order alpha-hullsDmitry N. Krasnoshchekov, Valentin Polishchuk, Arto Vihavainen. 109-110 [doi]
• Constructing Reeb graphs using cylinder mapsHarish Doraiswamy, Aneesh Sood, Vijay Natarajan. 111-112 [doi]
• Convexification of polygons by length preserving transformationsAdrian Dumitrescu, Evan Hilscher. 113-114 [doi]
• Geometric methods for multi-agent collision avoidanceStephen J. Guy, Jur P. van den Berg, Ming C. Lin, Dinesh Manocha. 115-116 [doi]
• A geometric approach to collective motionBernard Chazelle. 117-126 [doi]
• Kinetic stable Delaunay graphsPankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. 127-136 [doi]
• A kinetic triangulation scheme for moving points in the planeHaim Kaplan, Natan Rubin, Micha Sharir. 137-146 [doi]
• Output-sensitive algorithm for the edge-width of an embedded graphSergio Cabello, Éric Colin de Verdière, Francis Lazarus. 147-155 [doi]
• Finding shortest non-trivial cycles in directed graphs on surfacesSergio Cabello, Éric Colin de Verdière, Francis Lazarus. 156-165 [doi]
• Approximating loops in a shortest homology basis from point dataTamal K. Dey, Jian Sun, Yusu Wang. 166-175 [doi]
• A traveller s problemFlorian Berger, Rolf Klein. 176-182 [doi]
• New constructions of SSPDs and their applicationsMohammad Ali Abam, Sariel Har-Peled. 192-200 [doi]
• The complexity of the normal surface solution spaceBenjamin A. Burton. 201-209 [doi]
• Distance ::::k::::-sectors existKeiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama. 210-215 [doi]
• Zone diagrams in Euclidean spaces and in other normed spacesAkitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama. 216-221 [doi]
• Klee s measure problem on fat boxes in time PARTIAL DIFFERENTIAL (::::n:::::::(::::d::::+2)/3:::)Karl Bringmann. 222-229 [doi]
• An improved algorithm for computing the volume of the union of cubesPankaj K. Agarwal. 230-239 [doi]
• Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvementsPeyman Afshani, Lars Arge, Kasper Dalgaard Larsen. 240-246 [doi]
• A dynamic data structure for approximate range searchingDavid M. Mount, Eunhui Park. 247-256 [doi]
• The tidy set: a minimal simplicial set for computing homology of clique complexesAfra Zomorodian. 257-266 [doi]
• A randomized ::::O::::(::::m:::: log ::::m::::) time algorithm for computing Reeb graphs of arbitrary simplicial complexesWilliam Harvey, Yusu Wang, Rephael Wenger. 267-276 [doi]
• Topological inference via meshingBenoît Hudson, Gary L. Miller, Steve Oudot, Donald Sheehy. 277-286 [doi]
• Geometric tomography with topological guaranteesOmid Amini, Jean-Daniel Boissonnat, Pooran Memari. 287-296 [doi]
• On degrees in random triangulations of point setsMicha Sharir, Adam Sheffer, Emo Welzl. 297-306 [doi]
• Acute triangulations of polyhedra and the Euclidean spaceEryk Kopczynski, Igor Pak, Piotr Przytycki. 307-313 [doi]
• Dynamic well-spaced point setsUmut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu. 314-323 [doi]
• Manifold reconstruction using tangential Delaunay complexesJean-Daniel Boissonnat, Arijit Ghosh. 324-333 [doi]
• Optimal reconstruction might be hardDominique Attali, André Lieutier. 334-343 [doi]
• Reconstructing shapes with guarantees by unions of convex setsDominique Attali, André Lieutier. 344-353 [doi]
• Improving the first selection lemma in R:::3:::Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza. 354-357 [doi]
• Points with large quadrant-depthRoel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow. 358-364 [doi]
• Approximating the Fréchet distance for realistic curves in near linear timeAnne Driemel, Sariel Har-Peled, Carola Wenk. 365-374 [doi]
• Computing similarity between piecewise-linear functionsPankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. 375-383 [doi]
• Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualizationCláudio T. Silva. 384-385 [doi]
• Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm designDavid L. Millman, Jack Snoeyink. 386-392 [doi]
• 3D Euler spirals for 3D curve completionGur Harary, Ayellet Tal. 393-402 [doi]
• I/O-efficient computation of water flow across a terrainLars Arge, Morten Revsbæk, Norbert Zeh. 403-412 [doi]
• Incidences in three dimensions and distinct distances in the planeGyörgy Elekes, Micha Sharir. 413-422 [doi]
• Tangencies between families of disjoint regions in the planeJános Pach, Andrew Suk, Miroslav Treml. 423-428 [doi]
• Steinitz theorems for orthogonal polyhedraDavid Eppstein, Elena Mumford. 429-438 [doi]