Table of Contents

• Toward the Tight Bound of the Stretch Factor of Delaunay TriangulationsGe Xia, Liang Zhang. [doi]
• Weak Visibility Queries in Simple PolygonsMojtaba Nouri Bygi, Mohammad Ghodsi. [doi]
• An In-Place Priority Search TreeMinati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid. [doi]
• Weak Matching Points with TrianglesFatemeh Panahi, Ali Mohades, Mansoor Davoodi, Marzieh Eskandari. [doi]
• Counting Simple Polygonizations of Planar Point SetsEmo Welzl. [doi]
• Approximating the Obstacle Number for a Graph Drawing EfficientlyDeniz Sariöz. [doi]
• Approximation Algorithms for the Discrete Piercing Set Problem for Unit DisksMinati De, Gautam K. Das, Subhas C. Nandy. [doi]
• Orientations of Simplices Determined by Orderings on the Coordinates of their VerticesEmeric Gioan, Kevin Sol, Gérard Subsol. [doi]
• Approximating a Motorcycle Graph by a Straight SkeletonStefan Huber, Martin Held. [doi]
• Expansive Motions for d-Dimensional Open ChainsSarah Eisenstat, Erik D. Demaine. [doi]
• Isoperimetric Triangular Enclosure with a Fixed AngleProsenjit Bose, Jean-Lou De Carufel. [doi]
• Open Guard Edges and Edge Guards in Simple PolygonsCsaba D. Tóth, Godfried T. Toussaint, Andrew Winslow. [doi]
• Where and How Chew's Second Delaunay Refinement Algorithm WorksAlexander Rand. [doi]
• Rigidity-Theoretic Constructions of Integral Fary EmbeddingsTimothy Sun. [doi]
• Combinatorics of Minkowski decomposition of associahedraCarsten Lange. [doi]
• Minimum Many to Many Matchings for Computing the Distance Between Two SequencesDavid Rappaport, Godfried T. Toussaint, Mustafa Mohamad. [doi]
• A Randomly Embedded Random Graph is Not a SpannerAbbas Mehrabian. [doi]
• Robustness of topology of digital images and point cloudsPeter Saveliev. [doi]
• On the generation of topological (nk)-configurationsJürgen Bokowski, Vincent Pilaud. [doi]
• Approximating the Medial Axis by Shooting Rays: 3D CaseSvetlana Stolpner, Kaleem Siddiqi, Sue Whitesides. [doi]
• Illumination problems on translation surfaces with planar infinitiesNikolay Dimitrov. [doi]
• Edge Unfoldings of Platonic Solids Never OverlapTakashi Horiyama, Wataru Shoji. [doi]
• Edge-Unfolding Orthogonal Polyhedra is Strongly NP-CompleteZachary Abel, Erik D. Demaine. [doi]
• Algorithms for Bivariate Majority DepthDan Chen, Pat Morin. [doi]
• Memory-Constrained Algorithms for Shortest Path ProblemTetsuo Asano, Benjamin Doerr. [doi]
• Finding Maximum Density Axes Parallel Regions for Weighted Point SetsAnanda Swarup Das, Prosenjit Gupta, Kannan Srinathan, Kishore Kothapalli. [doi]
• An Experimental Analysis of Floating-Point Versus Exact ArithmeticMartin Held, Willi Mann. [doi]
• Kinetically-aware Conformational Distances in Molecular DynamicsChen Gu, Xiaoye Jiang, Leonidas J. Guibas. [doi]
• Edge-guarding Orthogonal PolyhedraGiovanni Viglietta, Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia. [doi]
• Bottleneck Steiner Tree with Bounded Number of Steiner VerticesA. Karim Abu-Affash, Paz Carmi, Matthew J. Katz. [doi]
• Pushing the boundaries of polytopal realizabilityDavid Bremner, Antoine Deza, William Hua, Lars Schewe. [doi]
• A Fourier-Theoretic Approach for Inferring SymmetriesXiaoye Jiang, Jian Sun 0002, Leonidas J. Guibas. [doi]
• On covering of any point configuration by disjoint unit disksYosuke Okayama, Masashi Kiyomi, Ryuhei Uehara. [doi]
• Outerplanar graphs and Delaunay triangulationsMd. Ashraful Alam, Igor Rivin, Ileana Streinu. [doi]
• The 2x2 Simple Packing ProblemAndré van Renssen, Bettina Speckmann. [doi]
• Wireless Localization within Orthogonal PolyhedraTobias Christ, Michael Hoffmann. [doi]
• Planar Pixelations, Shape ReconstructionBrandon Rowekamp. [doi]
• A Slow Algorithm for Computing the Gabriel Graph with Double PrecisionDavid L. Millman, Vishal Verma. [doi]
• On Finding Skyline Points for Range Queries in PlaneAnil Kishore Kalavagattu, Ananda Swarup Das, Kishore Kothapalli, Kannan Srinathan. [doi]
• Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-DimensionsEsther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro. [doi]
• Improving Accuracy of GNSS Devices in Urban CanyonsBoaz Ben-Moshe, Elazar Elkin, Harel Levi, Ayal Weissman. [doi]
• List coloring and Euclidean Ramsey TheoryNoga Alon. [doi]
• Drawing some planar graphs with integer edge-lengthsTherese C. Biedl. [doi]
• Optimizing Budget Allocation in GraphsBoaz Ben-Moshe, Eran Omri, Michael Elkin. [doi]
• Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3DMinati De, Subhas C. Nandy. [doi]
• Finding Optimal Geodesic Bridges Between Two Simple PolygonsAmit M. Bhosle, Teofilo F. Gonzalez. [doi]
• A Topologically Convex Vertex-Ununfoldable PolyhedronZachary Abel, Erik D. Demaine, Martin L. Demaine. [doi]
• Geometry-Free Polygon SplittingSherif Ghali. [doi]
• The Possible Hull of Imprecise PointsJeff Sember, William S. Evans. [doi]
• Orthogonal Range Search using a Distributed Computing ModelPouya Bisadi, Bradford G. Nickerson. [doi]
• Staying Close to a CurveAnil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh. [doi]
• Robust approximate assembly partitioningElisha Sacks, Victor Milenkovic, Yujun Wu. [doi]
• Helly Numbers of PolyominoesJean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman. [doi]
• On k-Gons and k-Holes in Point SetsBirgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr. [doi]
• Approximation Algorithms for a Triangle Enclosure ProblemKarim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid. [doi]
• Making triangulations 4-connected using flipsProsenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot. [doi]
• Development of Curves on Polyhedra via Conical ExistenceJoseph O'Rourke, Costin Vîlcu. [doi]
• Sequential Dependency Computation via Geometric Data StructuresGruia Calinescu, Howard J. Karloff. [doi]
• Computing k-Link Visibility Polygons in Environments with a Reflective EdgeSalma Sadat Mahdavi, Ali Mohades, Bahram Kouhestani. [doi]
• Common Developments of Several Different Orthogonal BoxesZachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara. [doi]
• Realizing Site PermutationsStephane Durocher, Saeed Mehrabi 0001, Debajyoti Mondal, Matthew Skala. [doi]
• Collinearities in Kinetic Point SetsBenjamin Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth. [doi]
• A Discrete and Dynamic Version of Klee's Measure ProblemHakan Yildiz, John Hershberger, Subhash Suri. [doi]
• Geometric PartitioningWilliam Steiger. [doi]
• On Inducing n-gonsMarjan Abedin, Ali Mohades, Marzieh Eskandari. [doi]
• Isotopic Fréchet DistanceErin W. Chambers, David Letscher, Tao Ju, Lu Liu. [doi]
• Characterization of Shortest Paths on Directional Frictional Polyhedral SurfacesGutemberg Guerra-Filho, Pedro J. de Rezende. [doi]
• New Lower Bounds for the Three-dimensional Orthogonal Bin Packing ProblemChia-Hong Hsu, Chung-Shou Liao. [doi]
• Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) TimeTimothy M. Chan, Bryan T. Wilkinson. [doi]
• Convexifying Polygons Without Losing VisibilitiesOswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow. [doi]
• Connecting Two Trees with Optimal Routing CostMong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner. [doi]
• Exact Algorithms and APX-Hardness Results for Geometric Set CoverElyot Grant, Timothy M. Chan. [doi]
• Small Octahedral SystemsGrant Custard, Antoine Deza, Tamon Stephen, Feng Xie. [doi]
• Approximating Geodesic Distances on 2-Manifolds in R3Christian Scheffer, Jan Vahrenhold. [doi]
• Finding the Maximum Area Parallelogram in a Convex PolygonKai Jin, Kevin Matulef. [doi]
• Euclidean Movement MinimizationMohammadAmin Fazli, MohammadAli Safari, Nima Anari, Pooya Jalaly Khalilabadi, Mohammad Ghodsi. [doi]
• Point Location in Well-Shaped Meshes Using Jump-and-WalkJean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari. [doi]
• Establishing Strong Connectivity using Optimal Radius Half-Disk AntennasGreg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer. [doi]
• An Incremental Algorithm for High Order Maximum Voronoi Diagram ConstructionKhuong Vu, Rong Zheng. [doi]
• Enumerating Minimal Transversals of Geometric HypergraphsKhaled M. Elbassioni, Imran Rauf, Saurabh Ray. [doi]
• Convex blocking and partial orders on the planeCanek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura. [doi]
• Hardness Results for Two-Dimensional Curvature-Constrained Motion PlanningDavid G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk. [doi]
• Sliding labels for dynamic point labelingAndreas Gemsa, Martin Nöllenburg, Ignaz Rutter. [doi]
• A Note on Minimum-Segment Drawings of Planar GraphsStephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides. [doi]
• Rigid components in fixed-lattice and cone frameworksMatthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran. [doi]
• Detecting VLSI Layout, Connectivity Errors in a Query WindowAnanda Swarup Das, Prosenjit Gupta, Kannan Srinathan. [doi]