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