<h2>LIPIcs, Volume 164, SoCG 2020</h2>
<ul>
<li>
<span class="authors">Sergio Cabello and Danny Z. Chen</span>
<span class="title">LIPIcs, Volume 164, SoCG 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020">10.4230/LIPIcs.SoCG.2020</a>
</li>
<li>
<span class="authors">Sergio Cabello and Danny Z. Chen</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.0">10.4230/LIPIcs.SoCG.2020.0</a>
</li>
<li>
<span class="authors">Eyal Ackerman, Balázs Keszegh, and Günter Rote</span>
<span class="title">An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.1">10.4230/LIPIcs.SoCG.2020.1</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, and Jie Xue</span>
<span class="title">Dynamic Geometric Set Cover and Hitting Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.2">10.4230/LIPIcs.SoCG.2020.2</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">The Parameterized Complexity of Guarding Almost Convex Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.3">10.4230/LIPIcs.SoCG.2020.3</a>
</li>
<li>
<span class="authors">Henk Alkema, Mark de Berg, and Sándor Kisfaludi-Bak</span>
<span class="title">Euclidean TSP in Narrow Strips</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.4">10.4230/LIPIcs.SoCG.2020.4</a>
</li>
<li>
<span class="authors">Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, and Yelena Yuditsky</span>
<span class="title">The ε-t-Net Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.5">10.4230/LIPIcs.SoCG.2020.5</a>
</li>
<li>
<span class="authors">Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, and Qing Wang</span>
<span class="title">Terrain Visibility Graphs: Persistence Is Not Enough</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.6">10.4230/LIPIcs.SoCG.2020.6</a>
</li>
<li>
<span class="authors">Boris Aronov, Mark de Berg, Joachim Gudmundsson, and Michael Horton</span>
<span class="title">On β-Plurality Points in Spatial Voting Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.7">10.4230/LIPIcs.SoCG.2020.7</a>
</li>
<li>
<span class="authors">Boris Aronov, Esther Ezra, and Micha Sharir</span>
<span class="title">Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.8">10.4230/LIPIcs.SoCG.2020.8</a>
</li>
<li>
<span class="authors">Alan Arroyo, Julien Bensmail, and R. Bruce Richter</span>
<span class="title">Extending Drawings of Graphs to Arrangements of Pseudolines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.9">10.4230/LIPIcs.SoCG.2020.9</a>
</li>
<li>
<span class="authors">Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, and Martin Lotz</span>
<span class="title">Dimensionality Reduction for k-Distance Applied to Persistent Homology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.10">10.4230/LIPIcs.SoCG.2020.10</a>
</li>
<li>
<span class="authors">Andrew Aukerman, Mathieu Carrière, Chao Chen, Kevin Gardner, Raúl Rabadán, and Rami Vanguri</span>
<span class="title">Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.11">10.4230/LIPIcs.SoCG.2020.11</a>
</li>
<li>
<span class="authors">Sergey Avvakumov and Gabriel Nivasch</span>
<span class="title">Homotopic Curve Shortening and the Affine Curve-Shortening Flow</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.12">10.4230/LIPIcs.SoCG.2020.12</a>
</li>
<li>
<span class="authors">Sang Won Bae and Sang Duk Yoon</span>
<span class="title">Empty Squares in Arbitrary Orientation Among Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.13">10.4230/LIPIcs.SoCG.2020.13</a>
</li>
<li>
<span class="authors">Martin Balko, Manfred Scheucher, and Pavel Valtr</span>
<span class="title">Holes and Islands in Random Point Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.14">10.4230/LIPIcs.SoCG.2020.14</a>
</li>
<li>
<span class="authors">Ulrich Bauer, Claudia Landi, and Facundo Mémoli</span>
<span class="title">The Reeb Graph Edit Distance Is Universal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.15">10.4230/LIPIcs.SoCG.2020.15</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, and Chrysanthi Raftopoulou</span>
<span class="title">Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.16">10.4230/LIPIcs.SoCG.2020.16</a>
</li>
<li>
<span class="authors">Talha Bin Masood, Tathagata Ray, and Vijay Natarajan</span>
<span class="title">Parallel Computation of Alpha Complexes for Biomolecules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.17">10.4230/LIPIcs.SoCG.2020.17</a>
</li>
<li>
<span class="authors">Nello Blaser and Morten Brun</span>
<span class="title">Relative Persistent Homology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.18">10.4230/LIPIcs.SoCG.2020.18</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat and Siddharth Pritam</span>
<span class="title">Edge Collapse and Persistence of Flag Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.19">10.4230/LIPIcs.SoCG.2020.19</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat and Mathijs Wintraecken</span>
<span class="title">The Topological Correctness of PL-Approximations of Isomanifolds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.20">10.4230/LIPIcs.SoCG.2020.20</a>
</li>
<li>
<span class="authors">Glencora Borradaile, William Maxwell, and Amir Nayyeri</span>
<span class="title">Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.21">10.4230/LIPIcs.SoCG.2020.21</a>
</li>
<li>
<span class="authors">Magnus Bakke Botnan, Vadim Lebovici, and Steve Oudot</span>
<span class="title">On Rectangle-Decomposable 2-Parameter Persistence Modules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.22">10.4230/LIPIcs.SoCG.2020.22</a>
</li>
<li>
<span class="authors">Claire Brécheteau</span>
<span class="title">Robust Anisotropic Power-Functions-Based Filtrations for Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.23">10.4230/LIPIcs.SoCG.2020.23</a>
</li>
<li>
<span class="authors">Kevin Buchin, Valentin Polishchuk, Leonid Sedov, and Roman Voronov</span>
<span class="title">Geometric Secluded Paths and Planar Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.24">10.4230/LIPIcs.SoCG.2020.24</a>
</li>
<li>
<span class="authors">Benjamin A. Burton</span>
<span class="title">The Next 350 Million Knots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.25">10.4230/LIPIcs.SoCG.2020.25</a>
</li>
<li>
<span class="authors">Chen Cai, Woojin Kim, Facundo Mémoli, and Yusu Wang</span>
<span class="title">Elder-Rule-Staircodes for Augmented Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.26">10.4230/LIPIcs.SoCG.2020.26</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Qizheng He</span>
<span class="title">Faster Approximation Algorithms for Geometric Set Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.27">10.4230/LIPIcs.SoCG.2020.27</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Qizheng He, and Yakov Nekrich</span>
<span class="title">Further Results on Colored Range Searching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.28">10.4230/LIPIcs.SoCG.2020.28</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin, and Man Ting Wong</span>
<span class="title">A Generalization of Self-Improving Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.29">10.4230/LIPIcs.SoCG.2020.29</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Man-Kit Lau</span>
<span class="title">Dynamic Distribution-Sensitive Point Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.30">10.4230/LIPIcs.SoCG.2020.30</a>
</li>
<li>
<span class="authors">Aruni Choudhary and Wolfgang Mulzer</span>
<span class="title">No-Dimensional Tverberg Theorems and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.31">10.4230/LIPIcs.SoCG.2020.31</a>
</li>
<li>
<span class="authors">David Cohen-Steiner, André Lieutier, and Julien Vuillamy</span>
<span class="title">Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.32">10.4230/LIPIcs.SoCG.2020.32</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Adam C. Hesterberg, and Jason S. Ku</span>
<span class="title">Finding Closed Quasigeodesics on Convex Polyhedra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.33">10.4230/LIPIcs.SoCG.2020.33</a>
</li>
<li>
<span class="authors">Michael Dennis, Ljubomir Perković, and Duru Türkoğlu</span>
<span class="title">The Stretch Factor of Hexagon-Delaunay Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.34">10.4230/LIPIcs.SoCG.2020.34</a>
</li>
<li>
<span class="authors">Vincent Despré, Jean-Marc Schlenker, and Monique Teillaud</span>
<span class="title">Flipping Geometric Triangulations on Hyperbolic Surfaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.35">10.4230/LIPIcs.SoCG.2020.35</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Tianqi Li, and Yusu Wang</span>
<span class="title">An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.36">10.4230/LIPIcs.SoCG.2020.36</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Marian Mrozek, and Ryan Slechta</span>
<span class="title">Persistence of the Conley Index in Combinatorial Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.37">10.4230/LIPIcs.SoCG.2020.37</a>
</li>
<li>
<span class="authors">Günther Eder, Martin Held, and Peter Palfrader</span>
<span class="title">On Implementing Straight Skeletons: Challenges and Experiences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.38">10.4230/LIPIcs.SoCG.2020.38</a>
</li>
<li>
<span class="authors">Eduard Eiben and Daniel Lokshtanov</span>
<span class="title">Removing Connected Obstacles in the Plane Is FPT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.39">10.4230/LIPIcs.SoCG.2020.39</a>
</li>
<li>
<span class="authors">Jeff Erickson and Patrick Lin</span>
<span class="title">A Toroidal Maxwell-Cremona-Delaunay Correspondence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.40">10.4230/LIPIcs.SoCG.2020.40</a>
</li>
<li>
<span class="authors">Parker Evans, Brittany Terese Fasy, and Carola Wenk</span>
<span class="title">Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.41">10.4230/LIPIcs.SoCG.2020.41</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, and Sahil Shah</span>
<span class="title">Worst-Case Optimal Covering of Rectangles by Disks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.42">10.4230/LIPIcs.SoCG.2020.42</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Linda Kleist, and Dominik Krupke</span>
<span class="title">Minimum Scan Cover with Angular Transition Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.43">10.4230/LIPIcs.SoCG.2020.43</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.44">10.4230/LIPIcs.SoCG.2020.44</a>
</li>
<li>
<span class="authors">Kyle Fox and Jiashuai Lu</span>
<span class="title">A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.45">10.4230/LIPIcs.SoCG.2020.45</a>
</li>
<li>
<span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
<span class="title">Bounded VC-Dimension Implies the Schur-Erdős Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.46">10.4230/LIPIcs.SoCG.2020.46</a>
</li>
<li>
<span class="authors">Nóra Frankl, Tamás Hubai, and Dömötör Pálvölgyi</span>
<span class="title">Almost-Monochromatic Sets and the Chromatic Number of the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.47">10.4230/LIPIcs.SoCG.2020.47</a>
</li>
<li>
<span class="authors">Nóra Frankl and Andrey Kupavskii</span>
<span class="title">Almost Sharp Bounds on the Number of Discrete Chains in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.48">10.4230/LIPIcs.SoCG.2020.48</a>
</li>
<li>
<span class="authors">Xavier Goaoc and Emo Welzl</span>
<span class="title">Convex Hulls of Random Order Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.49">10.4230/LIPIcs.SoCG.2020.49</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Mitchell Jones</span>
<span class="title">Fast Algorithms for Geometric Consensuses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.50">10.4230/LIPIcs.SoCG.2020.50</a>
</li>
<li>
<span class="authors">Monika Henzinger, Stefan Neumann, and Andreas Wiese</span>
<span class="title">Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.51">10.4230/LIPIcs.SoCG.2020.51</a>
</li>
<li>
<span class="authors">Haim Kaplan, Micha Sharir, and Uri Stemmer</span>
<span class="title">How to Find a Point in the Convex Hull Privately</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.52">10.4230/LIPIcs.SoCG.2020.52</a>
</li>
<li>
<span class="authors">Michael Kerber and Arnur Nigmetov</span>
<span class="title">Efficient Approximation of the Matching Distance for 2-Parameter Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.53">10.4230/LIPIcs.SoCG.2020.53</a>
</li>
<li>
<span class="authors">Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, and Larry Wasserman</span>
<span class="title">Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.54">10.4230/LIPIcs.SoCG.2020.54</a>
</li>
<li>
<span class="authors">Sándor Kisfaludi-Bak</span>
<span class="title">A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.55">10.4230/LIPIcs.SoCG.2020.55</a>
</li>
<li>
<span class="authors">Clément Maria, Steve Oudot, and Elchanan Solomon</span>
<span class="title">Intrinsic Topological Transforms via the Distance Kernel Embedding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.56">10.4230/LIPIcs.SoCG.2020.56</a>
</li>
<li>
<span class="authors">Wolfgang Mulzer and Pavel Valtr</span>
<span class="title">Long Alternating Paths Exist</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.57">10.4230/LIPIcs.SoCG.2020.57</a>
</li>
<li>
<span class="authors">Abhinandan Nath and Erin Taylor</span>
<span class="title">k-Median Clustering Under Discrete Fréchet and Hausdorff Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.58">10.4230/LIPIcs.SoCG.2020.58</a>
</li>
<li>
<span class="authors">Yakov Nekrich</span>
<span class="title">Four-Dimensional Dominance Range Reporting in Linear Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.59">10.4230/LIPIcs.SoCG.2020.59</a>
</li>
<li>
<span class="authors">Dömötör Pálvölgyi</span>
<span class="title">Radon Numbers Grow Linearly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.60">10.4230/LIPIcs.SoCG.2020.60</a>
</li>
<li>
<span class="authors">Zuzana Patáková</span>
<span class="title">Bounding Radon Number via Betti Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.61">10.4230/LIPIcs.SoCG.2020.61</a>
</li>
<li>
<span class="authors">Zuzana Patáková, Martin Tancer, and Uli Wagner</span>
<span class="title">Barycentric Cuts Through a Convex Body</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.62">10.4230/LIPIcs.SoCG.2020.62</a>
</li>
<li>
<span class="authors">Jeff M. Phillips and Pingfan Tang</span>
<span class="title">Sketched MinDist</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.63">10.4230/LIPIcs.SoCG.2020.63</a>
</li>
<li>
<span class="authors">Abhishek Rathod</span>
<span class="title">Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.64">10.4230/LIPIcs.SoCG.2020.64</a>
</li>
<li>
<span class="authors">Orit E. Raz and József Solymosi</span>
<span class="title">Dense Graphs Have Rigid Parts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.65">10.4230/LIPIcs.SoCG.2020.65</a>
</li>
<li>
<span class="authors">Micha Sharir and Oleg Zlydenko</span>
<span class="title">Incidences Between Points and Curves with Almost Two Degrees of Freedom</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.66">10.4230/LIPIcs.SoCG.2020.66</a>
</li>
<li>
<span class="authors">Uli Wagner and Emo Welzl</span>
<span class="title">Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.67">10.4230/LIPIcs.SoCG.2020.67</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">On the Planar Two-Center Problem and Circular Hulls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.68">10.4230/LIPIcs.SoCG.2020.68</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.69">10.4230/LIPIcs.SoCG.2020.69</a>
</li>
<li>
<span class="authors">Simon Zhang, Mengbai Xiao, and Hao Wang</span>
<span class="title">GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.70">10.4230/LIPIcs.SoCG.2020.70</a>
</li>
<li>
<span class="authors">Casper van Dommelen, Marc van Kreveld, and Jérôme Urhausen</span>
<span class="title">The Spiroplot App (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.71">10.4230/LIPIcs.SoCG.2020.71</a>
</li>
<li>
<span class="authors">Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, and Arne Schmidt</span>
<span class="title">Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.72">10.4230/LIPIcs.SoCG.2020.72</a>
</li>
<li>
<span class="authors">Amira Abdel-Rahman, Aaron T. Becker, Daniel E. Biediger, Kenneth C. Cheung, Sándor P. Fekete, Neil A. Gershenfeld, Sabrina Hugo, Benjamin Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt, Christian Scheffer, and Michael Yannuzzi</span>
<span class="title">Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.73">10.4230/LIPIcs.SoCG.2020.73</a>
</li>
<li>
<span class="authors">Aaron T. Becker and Sándor P. Fekete</span>
<span class="title">How to Make a CG Video (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.74">10.4230/LIPIcs.SoCG.2020.74</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer</span>
<span class="title">Covering Rectangles by Disks: The Video (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.75">10.4230/LIPIcs.SoCG.2020.75</a>
</li>
<li>
<span class="authors">Günther Eder, Martin Held, and Peter Palfrader</span>
<span class="title">Step-By-Step Straight Skeletons (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.76">10.4230/LIPIcs.SoCG.2020.76</a>
</li>
<li>
<span class="authors">Sean Dewar, Georg Grasegger, and Jan Legerský</span>
<span class="title">Computing Animations of Linkages with Rotational Symmetry (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.77">10.4230/LIPIcs.SoCG.2020.77</a>
</li>
<li>
<span class="authors">Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, and Jules Wulms</span>
<span class="title">Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.78">10.4230/LIPIcs.SoCG.2020.78</a>
</li>
<li>
<span class="authors">Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken, Jolan Rensen, and Leo van Schooten</span>
<span class="title">Dots & Polygons (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.79">10.4230/LIPIcs.SoCG.2020.79</a>
</li>
<li>
<span class="authors">Toon van Benthem, Kevin Buchin, Irina Kostitsyna, and Stijn Slot</span>
<span class="title">Designing Art Galleries (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.80">10.4230/LIPIcs.SoCG.2020.80</a>
</li>
<li>
<span class="authors">Herman Haverkort</span>
<span class="title">Plane-Filling Trails (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.81">10.4230/LIPIcs.SoCG.2020.81</a>
</li>
<li>
<span class="authors">Youjia Zhou, Kevin Knudson, and Bei Wang</span>
<span class="title">Visual Demo of Discrete Stratified Morse Theory (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.82">10.4230/LIPIcs.SoCG.2020.82</a>
</li>
<li>
<span class="authors">Da Wei Zheng, Jack Spalding-Jamieson, and Brandon Zhang</span>
<span class="title">Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.83">10.4230/LIPIcs.SoCG.2020.83</a>
</li>
<li>
<span class="authors">Laurent Moalic, Dominique Schmitt, Julien Lepagnot, and Julien Kritter</span>
<span class="title">Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.84">10.4230/LIPIcs.SoCG.2020.84</a>
</li>
<li>
<span class="authors">Günther Eder, Martin Held, Stefan de Lorenzo, and Peter Palfrader</span>
<span class="title">Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2020.85">10.4230/LIPIcs.SoCG.2020.85</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