LIPIcs, Volume 51, SoCG 2016

• Sándor Fekete and Anna Lubiw LIPIcs, Volume 51, SoCG'16, Complete Volume 10.4230/LIPIcs.SoCG.2016
• Sándor Fekete and Anna Lubiw Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors 10.4230/LIPIcs.SoCG.2016.0
• Daniela Rus Toward Pervasive Robots (Invited Talk) 10.4230/LIPIcs.SoCG.2016.1
• Jacob Fox Discrete Geometry, Algebra, and Combinatorics (Invited Talk) 10.4230/LIPIcs.SoCG.2016.2
• Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, and Tao B. Schardl Who Needs Crossings? Hardness of Plane Graph Rigidity 10.4230/LIPIcs.SoCG.2016.3
• Mikkel Abrahamsen and Mikkel Thorup Finding the Maximum Subset with Bounded Convex Curvature 10.4230/LIPIcs.SoCG.2016.4
• Eyal Ackerman, Balázs Keszegh, and Máté Vizer Coloring Points with Respect to Squares 10.4230/LIPIcs.SoCG.2016.5
• Pankaj K. Agarwal, Kyle Fox, Jiangwei Pan, and Rex Ying Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences 10.4230/LIPIcs.SoCG.2016.6
• Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, and Birgit Vogtenhuber An Improved Lower Bound on the Minimum Number of Triangulations 10.4230/LIPIcs.SoCG.2016.7
• Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, and Csaba Tóth Recognizing Weakly Simple Polygons 10.4230/LIPIcs.SoCG.2016.8
• Alexandr Andoni and Ilya Razensteyn Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing 10.4230/LIPIcs.SoCG.2016.9
• Boris Aronov, Otfried Cheong, Michael Gene Dobbins, and Xavier Goaoc The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions 10.4230/LIPIcs.SoCG.2016.10
• Sunil Arya, Guilherme D. da Fonseca, and David M. Mount On the Combinatorial Complexity of Approximating Polytopes 10.4230/LIPIcs.SoCG.2016.11
• Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, and Jonathan Spreer Efficient Algorithms to Decide Tightness 10.4230/LIPIcs.SoCG.2016.12
• Kevin Balas, Adrian Dumitrescu, and Csaba Tóth Anchored Rectangle and Square Packings 10.4230/LIPIcs.SoCG.2016.13
• Sayan Bandyapadhyay and Kasturi Varadarajan On Variants of k-means Clustering 10.4230/LIPIcs.SoCG.2016.14
• Sarah R. Allen, Luis Barba, John Iacono, and Stefan Langerman Incremental Voronoi diagrams 10.4230/LIPIcs.SoCG.2016.15
• Yair Bartal and Lee-Ad Gottlieb Dimension Reduction Techniques for l_p (1<p<2), with Applications 10.4230/LIPIcs.SoCG.2016.16
• Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova Testing Convexity of Figures Under the Uniform Distribution 10.4230/LIPIcs.SoCG.2016.17
• Vijay V. S. P. Bhattiprolu and Sariel Har-Peled Separating a Voronoi Diagram via Local Search 10.4230/LIPIcs.SoCG.2016.18
• Therese Biedl, Giuseppe Liotta, and Fabrizio Montecchiani On Visibility Representations of Non-Planar Graphs 10.4230/LIPIcs.SoCG.2016.19
• Mikhail Bogdanov, Monique Teillaud, and Gert Vegter Delaunay Triangulations on Orientable Surfaces of Low Genus 10.4230/LIPIcs.SoCG.2016.20
• Cecilia Bohler, Rolf Klein, and Chih-Hung Liu An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams 10.4230/LIPIcs.SoCG.2016.21
• Glencora Borradaile, David Eppstein, Amir Nayyeri, and Christian Wulff-Nilsen All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs 10.4230/LIPIcs.SoCG.2016.22
• Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, and Amir Nayyeri Minimum Cycle and Homology Bases of Surface Embedded Graphs 10.4230/LIPIcs.SoCG.2016.23
• Benjamin A. Burton, Arnaud de Mesmay, and Uli Wagner Finding Non-Orientable Surfaces in 3-Manifolds 10.4230/LIPIcs.SoCG.2016.24
• Mathieu Carrière and Steve Oudot Structure and Stability of the 1-Dimensional Mapper 10.4230/LIPIcs.SoCG.2016.25
• Alfonso Cevallos, Friedrich Eisenbrand, and Rico Zenklusen Max-Sum Diversity Via Convex Programming 10.4230/LIPIcs.SoCG.2016.26
• Timothy M. Chan Dynamic Streaming Algorithms for Epsilon-Kernels 10.4230/LIPIcs.SoCG.2016.27
• Timothy M. Chan and Simon Pratt Two Approaches to Building Time-Windowed Geometric Data Structures 10.4230/LIPIcs.SoCG.2016.28
• Hsien-Chih Chang and Jeff Erickson Untangling Planar Curves 10.4230/LIPIcs.SoCG.2016.29
• Markus Chimani and Petr Hlinený Inserting Multiple Edges into a Planar Graph 10.4230/LIPIcs.SoCG.2016.30
• Aruni Choudhary, Michael Kerber, and Sharath Raghvendra Polynomial-Sized Topological Approximations Using the Permutahedron 10.4230/LIPIcs.SoCG.2016.31
• Mark de Berg, Joachim Gudmundsson, and Mehran Mehr Faster Algorithms for Computing Plurality Points 10.4230/LIPIcs.SoCG.2016.32
• Olivier Devillers, Menelaos Karavelas, and Monique Teillaud Qualitative Symbolic Perturbation 10.4230/LIPIcs.SoCG.2016.33
• Hu Ding, Jing Gao, and Jinhui Xu Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance 10.4230/LIPIcs.SoCG.2016.34
• Dominic Dotterrer, Tali Kaufman, and Uli Wagner On Expansion and Topological Overlap 10.4230/LIPIcs.SoCG.2016.35
• Adrian Dumitrescu and Minghui Jiang On the Number of Maximum Empty Boxes Amidst n Points 10.4230/LIPIcs.SoCG.2016.36
• Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, and Manfred Scheucher Strongly Monotone Drawings of Planar Graphs 10.4230/LIPIcs.SoCG.2016.37
• Martin Fink, John Hershberger, Nirman Kumar, and Subhash Suri Hyperplane Separability and Convexity of Probabilistic Point Sets 10.4230/LIPIcs.SoCG.2016.38
• Fedor Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems 10.4230/LIPIcs.SoCG.2016.39
• Bernd Gärtner, Johannes Lengler, and May Szedlák Random Sampling with Removal 10.4230/LIPIcs.SoCG.2016.40
• Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba Tóth The Planar Tree Packing Theorem 10.4230/LIPIcs.SoCG.2016.41
• Petr Hlinený and Marek Dernár Crossing Number is Hard for Kernelization 10.4230/LIPIcs.SoCG.2016.42
• Alfredo Hubard, Vojtech Kaluža, Arnaud de Mesmay, and Martin Tancer Shortest Path Embeddings of Graphs on Surfaces 10.4230/LIPIcs.SoCG.2016.43
• Piotr Indyk, Robert Kleinberg, Sepideh Mahabadi, and Yang Yuan Simultaneous Nearest Neighbor Search 10.4230/LIPIcs.SoCG.2016.44
• Iyad Kanj, Ljubomir Perkovic, and Duru Türkoglu Degree Four Plane Spanners: Simpler and Better 10.4230/LIPIcs.SoCG.2016.45
• Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, and János Pach A Lower Bound on Opaque Sets 10.4230/LIPIcs.SoCG.2016.46
• Marc Khoury and Jonathan Richard Shewchuk Fixed Points of the Restricted Delaunay Triangulation Operator 10.4230/LIPIcs.SoCG.2016.47
• Heuna Kim and Günter Rote Congruence Testing of Point Sets in 4-Space 10.4230/LIPIcs.SoCG.2016.48
• Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, and Frank Staals On the Complexity of Minimum-Link Path Problems 10.4230/LIPIcs.SoCG.2016.49
• Stefan Langerman and Andrew Winslow A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino 10.4230/LIPIcs.SoCG.2016.50
• Isaac Mabillard and Uli Wagner Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range 10.4230/LIPIcs.SoCG.2016.51
• Dániel Marx and Tillmann Miltzow Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems 10.4230/LIPIcs.SoCG.2016.52
• Elizabeth Munch and Bei Wang Convergence between Categorical Representations of Reeb Space and Mapper 10.4230/LIPIcs.SoCG.2016.53
• Andrey Kupavskii, Nabil Mustafa, and János Pach New Lower Bounds for epsilon-Nets 10.4230/LIPIcs.SoCG.2016.54
• Amir Nayyeri and Hanzhong Xu On Computing the Fréchet Distance Between Surfaces 10.4230/LIPIcs.SoCG.2016.55
• Eunjin Oh, Luis Barba, and Hee-Kap Ahn The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon 10.4230/LIPIcs.SoCG.2016.56
• Benjamin Raichel and C. Seshadhri Avoiding the Global Sort: A Faster Contour Tree Algorithm 10.4230/LIPIcs.SoCG.2016.57
• Orit E. Raz Configurations of Lines in 3-Space and Rigidity of Planar Structures 10.4230/LIPIcs.SoCG.2016.58
• Alexandre Rok and Shakhar Smorodinsky Weak 1/r-Nets for Moving Points 10.4230/LIPIcs.SoCG.2016.59
• Peyman Afshani, Edvin Berglin, Ingo van Duijn, and Jesper Sindahl Nielsen Applications of Incidence Bounds in Point Covering Problems 10.4230/LIPIcs.SoCG.2016.60
• Arthur van Goethem, Marc van Kreveld, Maarten Löffler, Bettina Speckmann, and Frank Staals Grouping Time-Varying Data for Interactive Exploration 10.4230/LIPIcs.SoCG.2016.61
• Jie Xue, Yuan Li, and Ravi Janardan On the Separability of Stochastic Geometric Objects, with Applications 10.4230/LIPIcs.SoCG.2016.62
• Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, and Bryan T. Wilkinson Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties 10.4230/LIPIcs.SoCG.2016.63
• Kirk Gardner, Lynn Asselin, and Donald Sheehy Interactive Geometric Algorithm Visualization in a Browser 10.4230/LIPIcs.SoCG.2016.64
• Paul Bendich, Ellen Gasparovic, John Harer, and Christopher Tralie Geometric Models for Musical Audio Data 10.4230/LIPIcs.SoCG.2016.65
• Satyan Devadoss, Ziv Epstein, and Dmitriy Smirnov Visualizing Scissors Congruence 10.4230/LIPIcs.SoCG.2016.66
• Mohammad Farshi and Seyed Hossein Hosseini Visualization of Geometric Spanner Algorithms 10.4230/LIPIcs.SoCG.2016.67
• Ching-Hsiang Hsu, John Paul Ryan, and Chee Yap Path Planning for Simple Robots using Soft Subdivision Search 10.4230/LIPIcs.SoCG.2016.68
• Kevin Pratt, Connor Riley, and Donald Sheehy Exploring Circle Packing Algorithms 10.4230/LIPIcs.SoCG.2016.69
• Wouter van Toll, Atlas F. Cook IV, Marc van Kreveld, and Roland Geraerts The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation 10.4230/LIPIcs.SoCG.2016.70
• Christopher Tralie High-Dimensional Geometry of Sliding Window Embeddings of Periodic Videos 10.4230/LIPIcs.SoCG.2016.71
• Matthew L. Wright Introduction to Persistent Homology 10.4230/LIPIcs.SoCG.2016.72