Table of Contents

• Computational Balloon Twisting: The Theory of Balloon PolyhedraErik D. Demaine, Martin L. Demaine, Vi Hart.
• On distinct distances among points in general position and other related problemsAdrian Dumitrescu.
• Core-Preserving AlgorithmsHamid Zarrabi-Zadeh.
• Partitioning a Polygon into Two Mirror Congruent PiecesDania El-Khechen, John Iacono, Thomas Fevens, Günter Rote.
• Smallest enclosing circle centered on a query line segmentProsenjit Bose, Stefan Langerman, Sasanka Roy.
• Linear-Size MeshesDon Sheehy, Gary L. Miller, Todd Phillips.
• Computing Dehn Twists and Geometric Intersection Numbers in Polynomial TimeMarcus Schaefer, Eric Sedgwick, Daniel Stefankovic.
• Maximal Covering by Two Isothetic Unit SquaresPriya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das.
• An Efficient Query Structure for Mesh RefinementBenoît Hudson, Duru Türkoglu.
• The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner TreesMina Razaghpour, Anna Lubiw.
• Polygons Folding to Plural Incongruent Orthogonal BoxesRyuhei Uehara.
• On the nonexistence of dimension reduction for /ell2_2 metricsMohammad Moharrami, Avner Magen.
• Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic RoadmapHamid Reza Chitsaz, Steven M. LaValle, Jason M. O Kane.
• On the Complexity of Point Recolouring in Geometric GraphsHenk Meijer, Yurai Núñez Rodríguez, David Rappaport.
• A generalization of Apollonian packing of circlesGerhard Guettler, Colin Mallows.
• A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph ModelYurai Núñez Rodríguez, Henry Xiao, Kamrul Islam, Waleed Alsalih.
• Triangulating and Guarding Realistic PolygonsGreg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann.
• Data Structures for Restricted Triangular Range SearchingMashhood Ishaque, Diane L. Souvaine, Nadia Benbernou.
• Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation MetricsChristian Wulff-Nilsen.
• A Pumping Lemma for Homometric RhythmsJoseph O Rourke, Perouz Taslakian, Godfried T. Toussaint.
• Isometric Morphing of Triangular MeshesProsenjit Bose, Joseph O Rourke, Chang Shu, Stefanie Wuhrer.
• Direct Planar Tree Transformation and CounterexampleSelim G. Akl, Kamrul Islam, Henk Meijer.
• A note on alpha-drawable k-treesSvetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath.
• Monochromatic simplices of any volumeAdrian Dumitrescu, Minghui Jiang.
• Data Structures for Range-Aggregate Extent QueriesRavi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid.
• VC-Dimension of Visibility on TerrainsJames King.
• The Solution Path of the Slab Support Vector MachineJoachim Giesen, Madhusudan Manjunath, Michael Eigensatz.
• Adaptive Searching in One and Two DimensionsReza Dorrigiv, Alejandro López-Ortiz.
• Empty Monochromatic TrianglesOswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia.
• Draining a Polygon - or - Rolling a Ball out of a PolygonGreg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O Rourke.
• Polygonal Chain Simplification with Small Angle ConstraintsOvidiu Daescu, Anastasia Kurdia.
• Partial Matching of Planar Polygons Under Translation and RotationEric McCreath.
• Searching for Frequent Colors in RectanglesMarek Karpinski, Yakov Nekrich.
• Guaranteed Voronoi Diagrams of Uncertain SitesJeff Sember, William Evans.
• Polar Diagram of Moving ObjectsMojtaba Nouri Bygi, Mohammad Ghodsi.
• Minimum blocking sets of circles for a set of lines in the planeNatasa Jovanovic, Jan H. M. Korst, Augustus J. E. M. Janssen.
• A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull ProblemStefan Näher, Daniel Schmitt 0002.
• Fault-Tolerant Conflict-Free ColoringMohammad Ali Abam, Mark de Berg, Sheung-Hung Poon.
• The Focus of Attention Problem RevisitedManjish Pal.
• Application of computational geometry to network p-center location problemsQiaosheng Shi, Binay K. Bhattacharya.
• Generalized Ham-Sandwich Cuts for Well Separated Point SetsJihui Zhao, William Steiger.
• Convex Hull of the Union of Convex Objects in the Plane: an Adaptive AnalysisJérémy Barbay, Eric Y. Chen.
• Achieving Spatial Adaptivity while Finding Approximate Nearest NeighborsJonathan Derryberry, Don Sheehy, Maverick Woo, Danny Dominic Sleator.
• Memory Requirements for Local Geometric Routing and Traversal in DigraphsMaia Fraser, Evangelos Kranakis, Jorge Urrutia.
• Recognition of Largest Empty Orthoconvex Polygon in a Point SetSubhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya.
• The Embroidery ProblemEsther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena.
• Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex ObjectKarim Abu Affash, Matthew J. Katz.
• On a Cone Covering ProblemKhaled M. Elbassioni, Hans Raj Tiwary.
• Competitive Search for Longest Empty IntervalsPeter Damaschke.
• Polynomial irreducibility testing through Minkowski summand computationDeepanjan Kesh, Shashank Mehta.
• A Class of Convex Polyhedra with Few Edge UnfoldingsAlex Benton, Joseph O Rourke.
• Inverting Linkages with StretchYouichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara.