@Proceedings{arge_et_al:LIPIcs.SOCG.2015,
  title =	{{LIPIcs, Volume 34, SoCG'15, Complete Volume}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015},
  URN =		{urn:nbn:de:0030-drops-52479},
  doi =		{10.4230/LIPIcs.SOCG.2015},
  annote =	{Keywords: Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics}
}
@InProceedings{arge_et_al:LIPIcs.SOCG.2015.i,
  author =	{Arge, Lars and Pach, J\'{a}nos},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{i--xx},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.i},
  URN =		{urn:nbn:de:0030-drops-50844},
  doi =		{10.4230/LIPIcs.SOCG.2015.i},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{matousek_et_al:LIPIcs.SOCG.2015.1,
  author =	{Matou\v{s}ek, Jir{\'\i} and Nikolov, Aleksandar},
  title =	{{Combinatorial Discrepancy for Boxes via the gamma\underline2 Norm}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{1--15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.1},
  URN =		{urn:nbn:de:0030-drops-51091},
  doi =		{10.4230/LIPIcs.SOCG.2015.1},
  annote =	{Keywords: discrepancy theory, range counting, factorization norms}
}
@InProceedings{becker_et_al:LIPIcs.SOCG.2015.16,
  author =	{Becker, Aaron T. and Demaine, Erik D. and Fekete, S\'{a}ndor P. and Shad, Hamed Mohtasham and Morris-Wright, Rose},
  title =	{{Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{16--18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.16},
  URN =		{urn:nbn:de:0030-drops-50870},
  doi =		{10.4230/LIPIcs.SOCG.2015.16},
  annote =	{Keywords: Particle swarms, global control, complexity, geometric computation}
}
@InProceedings{barequet_et_al:LIPIcs.SOCG.2015.19,
  author =	{Barequet, Gill and Shalah, Mira},
  title =	{{Automatic Proofs for Formulae Enumerating Proper Polycubes}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{19--22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.19},
  URN =		{urn:nbn:de:0030-drops-50889},
  doi =		{10.4230/LIPIcs.SOCG.2015.19},
  annote =	{Keywords: Polycubes, inclusion-exclusion}
}
@InProceedings{cavanna_et_al:LIPIcs.SOCG.2015.23,
  author =	{Cavanna, Nicholas J. and Jahanseir, Mahmoodreza and Sheehy, Donald R.},
  title =	{{Visualizing Sparse Filtrations}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{23--25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.23},
  URN =		{urn:nbn:de:0030-drops-50893},
  doi =		{10.4230/LIPIcs.SOCG.2015.23},
  annote =	{Keywords: Topological Data Analysis, Simplicial Complexes, Persistent Homology}
}
@InProceedings{talvitie:LIPIcs.SOCG.2015.26,
  author =	{Talvitie, Topi},
  title =	{{Visualizing Quickest Visibility Maps}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{26--28},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.26},
  URN =		{urn:nbn:de:0030-drops-50906},
  doi =		{10.4230/LIPIcs.SOCG.2015.26},
  annote =	{Keywords: path planning, visibility}
}
@InProceedings{dvir_et_al:LIPIcs.SOCG.2015.29,
  author =	{Dvir, Zeev and Hu, Guangda},
  title =	{{Sylvester-Gallai for Arrangements of Subspaces}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{29--43},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.29},
  URN =		{urn:nbn:de:0030-drops-51303},
  doi =		{10.4230/LIPIcs.SOCG.2015.29},
  annote =	{Keywords: Sylvester-Gallai, Locally Correctable Codes}
}
@InProceedings{mulzer_et_al:LIPIcs.SOCG.2015.44,
  author =	{Mulzer, Wolfgang and Stein, Yannik},
  title =	{{Computational Aspects of the Colorful Carath\'{e}odory Theorem}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{44--58},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.44},
  URN =		{urn:nbn:de:0030-drops-51019},
  doi =		{10.4230/LIPIcs.SOCG.2015.44},
  annote =	{Keywords: colorful Carath\'{e}odory theorem, high-dimensional approximation, PLS}
}
@InProceedings{suk:LIPIcs.SOCG.2015.59,
  author =	{Suk, Andrew},
  title =	{{Semi-algebraic Ramsey Numbers}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{59--73},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.59},
  URN =		{urn:nbn:de:0030-drops-50955},
  doi =		{10.4230/LIPIcs.SOCG.2015.59},
  annote =	{Keywords: Ramsey theory, semi-algebraic relation, one-sided hyperplanes, Schur numbers}
}
@InProceedings{rochenewton:LIPIcs.SOCG.2015.74,
  author =	{Roche-Newton, Oliver},
  title =	{{A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{74--80},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.74},
  URN =		{urn:nbn:de:0030-drops-51200},
  doi =		{10.4230/LIPIcs.SOCG.2015.74},
  annote =	{Keywords: Szemer\'{e}di-Trotter Theorem, pinned distances, sum-product estimates}
}
@InProceedings{karavelas_et_al:LIPIcs.SOCG.2015.81,
  author =	{Karavelas, Menelaos I. and Tzanaki, Eleni},
  title =	{{A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{81--95},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.81},
  URN =		{urn:nbn:de:0030-drops-51428},
  doi =		{10.4230/LIPIcs.SOCG.2015.81},
  annote =	{Keywords: Convex polytopes, Minkowski sum, upper bound}
}
@InProceedings{dutta_et_al:LIPIcs.SOCG.2015.96,
  author =	{Dutta, Kunal and Ezra, Esther and Ghosh, Arijit},
  title =	{{Two Proofs for Shallow Packings}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{96--110},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.96},
  URN =		{urn:nbn:de:0030-drops-51493},
  doi =		{10.4230/LIPIcs.SOCG.2015.96},
  annote =	{Keywords: Set systems of bounded primal shatter dimension, delta-packing \& Haussler’s approach, relative approximations, Clarkson-Shor random sampling approach}
}
@InProceedings{harpeled:LIPIcs.SOCG.2015.111,
  author =	{Har-Peled, Sariel},
  title =	{{Shortest Path in a Polygon using Sublinear Space}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{111--125},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.111},
  URN =		{urn:nbn:de:0030-drops-50941},
  doi =		{10.4230/LIPIcs.SOCG.2015.111},
  annote =	{Keywords: Shortest path, violator spaces, limited space}
}
@InProceedings{angelini_et_al:LIPIcs.SOCG.2015.126,
  author =	{Angelini, Patrizio and Da Lozzo, Giordano and Frati, Fabrizio and Lubiw, Anna and Patrignani, Maurizio and Roselli, Vincenzo},
  title =	{{Optimal Morphs of Convex Drawings}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{126--140},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.126},
  URN =		{urn:nbn:de:0030-drops-51333},
  doi =		{10.4230/LIPIcs.SOCG.2015.126},
  annote =	{Keywords: Convex Drawings, Planar Graphs, Morphing, Geometric Representations}
}
@InProceedings{biedl_et_al:LIPIcs.SOCG.2015.141,
  author =	{Biedl, Therese and Derka, Martin},
  title =	{{1-String B\underline2-VPG Representation of Planar Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{141--155},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.141},
  URN =		{urn:nbn:de:0030-drops-51323},
  doi =		{10.4230/LIPIcs.SOCG.2015.141},
  annote =	{Keywords: Graph drawing, string graphs, VPG graphs, planar graphs}
}
@InProceedings{kaplan_et_al:LIPIcs.SOCG.2015.156,
  author =	{Kaplan, Haim and Mulzer, Wolfgang and Roditty, Liam and Seiferth, Paul},
  title =	{{Spanners and Reachability Oracles for Directed Transmission Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{156--170},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.156},
  URN =		{urn:nbn:de:0030-drops-51062},
  doi =		{10.4230/LIPIcs.SOCG.2015.156},
  annote =	{Keywords: Transmission Graphs, Reachability Oracles, Spanner, Intersection Graph}
}
@InProceedings{cardinal_et_al:LIPIcs.SOCG.2015.171,
  author =	{Cardinal, Jean and Hoffmann, Udo},
  title =	{{Recognition and Complexity of Point Visibility Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{171--185},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.171},
  URN =		{urn:nbn:de:0030-drops-51390},
  doi =		{10.4230/LIPIcs.SOCG.2015.171},
  annote =	{Keywords: point visibility graphs, recognition, existential theory of the reals}
}
@InProceedings{abam_et_al:LIPIcs.SOCG.2015.186,
  author =	{Abam, Mohammad Ali and Adeli, Marjan and Homapour, Hamid and Asadollahpoor, Pooya Zafar},
  title =	{{Geometric Spanners for Points Inside a Polygonal Domain}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{186--197},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.186},
  URN =		{urn:nbn:de:0030-drops-51378},
  doi =		{10.4230/LIPIcs.SOCG.2015.186},
  annote =	{Keywords: Geometric Spanners, Polygonal Domain, Visibility Graph}
}
@InProceedings{abrahamsen:LIPIcs.SOCG.2015.198,
  author =	{Abrahamsen, Mikkel},
  title =	{{An Optimal Algorithm for the Separating Common Tangents of Two Polygons}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{198--208},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.198},
  URN =		{urn:nbn:de:0030-drops-51313},
  doi =		{10.4230/LIPIcs.SOCG.2015.198},
  annote =	{Keywords: planar computational geometry, simple polygon, common tangent, optimal algorithm, constant workspace}
}
@InProceedings{ahn_et_al:LIPIcs.SOCG.2015.209,
  author =	{Ahn, Hee Kap and Barba, Luis and Bose, Prosenjit and De Carufel, Jean-Lou and Korman, Matias and Oh, Eunjin},
  title =	{{A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{209--223},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.209},
  URN =		{urn:nbn:de:0030-drops-51448},
  doi =		{10.4230/LIPIcs.SOCG.2015.209},
  annote =	{Keywords: Geodesic distance, facility location, 1-center problem, simple polygons}
}
@InProceedings{devillers_et_al:LIPIcs.SOCG.2015.224,
  author =	{Devillers, Olivier and Glisse, Marc and Goaoc, Xavier and Thomasse, R\'{e}my},
  title =	{{On the Smoothed Complexity of Convex Hulls}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{224--239},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.224},
  URN =		{urn:nbn:de:0030-drops-51451},
  doi =		{10.4230/LIPIcs.SOCG.2015.224},
  annote =	{Keywords: Probabilistic analysis, Worst-case analysis, Gaussian noise}
}
@InProceedings{bokal_et_al:LIPIcs.SOCG.2015.240,
  author =	{Bokal, Drago and Cabello, Sergio and Eppstein, David},
  title =	{{Finding All Maximal Subsequences with Hereditary Properties}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{240--254},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.240},
  URN =		{urn:nbn:de:0030-drops-51132},
  doi =		{10.4230/LIPIcs.SOCG.2015.240},
  annote =	{Keywords: convex hull, diameter, monotone path, sequence of points, trajectory}
}
@InProceedings{dyer_et_al:LIPIcs.SOCG.2015.255,
  author =	{Dyer, Ramsay and Vegter, Gert and Wintraecken, Mathijs},
  title =	{{Riemannian Simplices and Triangulations}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{255--269},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.255},
  URN =		{urn:nbn:de:0030-drops-51361},
  doi =		{10.4230/LIPIcs.SOCG.2015.255},
  annote =	{Keywords: Karcher means, barycentric coordinates, triangulation, Riemannian manifold, Riemannian simplices}
}
@InProceedings{burton_et_al:LIPIcs.SOCG.2015.270,
  author =	{Burton, Benjamin A. and Pettersson, William},
  title =	{{An Edge-Based Framework for Enumerating 3-Manifold Triangulations}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{270--284},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.270},
  URN =		{urn:nbn:de:0030-drops-51485},
  doi =		{10.4230/LIPIcs.SOCG.2015.270},
  annote =	{Keywords: triangulations, enumeration, graph theory}
}
@InProceedings{pilz_et_al:LIPIcs.SOCG.2015.285,
  author =	{Pilz, Alexander and Welzl, Emo},
  title =	{{Order on Order Types}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{285--299},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.285},
  URN =		{urn:nbn:de:0030-drops-51194},
  doi =		{10.4230/LIPIcs.SOCG.2015.285},
  annote =	{Keywords: point set, order type, planar graph, crossing-free geometric graph}
}
@InProceedings{goaoc_et_al:LIPIcs.SOCG.2015.300,
  author =	{Goaoc, Xavier and Hubard, Alfredo and de Joannis de Verclos, R\'{e}mi and Sereni, Jean-S\'{e}bastien and Volec, Jan},
  title =	{{Limits of Order Types}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{300--314},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.300},
  URN =		{urn:nbn:de:0030-drops-51264},
  doi =		{10.4230/LIPIcs.SOCG.2015.300},
  annote =	{Keywords: order types, Limits of discrete structures, Flag algebras, Erdos-Szekeres, Sylvester’s problem}
}
@InProceedings{fukuda_et_al:LIPIcs.SOCG.2015.315,
  author =	{Fukuda, Komei and G\"{a}rtner, Bernd and Szedl\'{a}k, May},
  title =	{{Combinatorial Redundancy Detection}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{315--328},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.315},
  URN =		{urn:nbn:de:0030-drops-51434},
  doi =		{10.4230/LIPIcs.SOCG.2015.315},
  annote =	{Keywords: system of linear inequalities, redundancy removal, linear programming, output sensitive algorithm, Clarkson’s method}
}
@InProceedings{cohenaddad_et_al:LIPIcs.SOCG.2015.329,
  author =	{Cohen-Addad, Vincent and Mathieu, Claire},
  title =	{{Effectiveness of Local Search for Geometric Optimization}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{329--344},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.329},
  URN =		{urn:nbn:de:0030-drops-51241},
  doi =		{10.4230/LIPIcs.SOCG.2015.329},
  annote =	{Keywords: Local Search, PTAS, Facility Location, k-Median, TSP, Steiner Tree}
}
@InProceedings{dadush_et_al:LIPIcs.SOCG.2015.345,
  author =	{Dadush, Daniel and H\"{a}hnle, Nicolai},
  title =	{{On the Shadow Simplex Method for Curved Polyhedra}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{345--359},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.345},
  URN =		{urn:nbn:de:0030-drops-51142},
  doi =		{10.4230/LIPIcs.SOCG.2015.345},
  annote =	{Keywords: Optimization, Linear Programming, Simplex Method, Diameter of Polyhedra}
}
@InProceedings{chen_et_al:LIPIcs.SOCG.2015.360,
  author =	{Chen, Ho-Lin and Doty, David and Manuch, J\'{a}n and Rafiey, Arash and Stacho, Ladislav},
  title =	{{Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{360--373},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.360},
  URN =		{urn:nbn:de:0030-drops-50935},
  doi =		{10.4230/LIPIcs.SOCG.2015.360},
  annote =	{Keywords: self-assembly, hierarchical, pumping}
}
@InProceedings{harpeled_et_al:LIPIcs.SOCG.2015.374,
  author =	{Har-Peled, Sariel and Kumar, Nirman and Mount, David M. and Raichel, Benjamin},
  title =	{{Space Exploration via Proximity Search}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{374--389},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.374},
  URN =		{urn:nbn:de:0030-drops-51004},
  doi =		{10.4230/LIPIcs.SOCG.2015.374},
  annote =	{Keywords: Proximity search, implicit point set, probing}
}
@InProceedings{kiazyk_et_al:LIPIcs.SOCG.2015.390,
  author =	{Kiazyk, Stephen and Lubiw, Anna},
  title =	{{Star Unfolding from a Geodesic Curve}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{390--404},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.390},
  URN =		{urn:nbn:de:0030-drops-51380},
  doi =		{10.4230/LIPIcs.SOCG.2015.390},
  annote =	{Keywords: unfolding, convex polyhedra, geodesic curve}
}
@InProceedings{green:LIPIcs.SOCG.2015.405,
  author =	{Green, Ben J.},
  title =	{{The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{405--405},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.405},
  URN =		{urn:nbn:de:0030-drops-50852},
  doi =		{10.4230/LIPIcs.SOCG.2015.405},
  annote =	{Keywords: combinatorial geometry, incidences}
}
@InProceedings{balko_et_al:LIPIcs.SOCG.2015.406,
  author =	{Balko, Martin and Jel{\'\i}nek, V{\'\i}t and Valtr, Pavel and Walczak, Bartosz},
  title =	{{On the Beer Index of Convexity and Its Variants}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{406--420},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.406},
  URN =		{urn:nbn:de:0030-drops-51229},
  doi =		{10.4230/LIPIcs.SOCG.2015.406},
  annote =	{Keywords: Beer index of convexity, convexity ratio, convexity measure, visibility}
}
@InProceedings{hoffmann_et_al:LIPIcs.SOCG.2015.421,
  author =	{Hoffmann, Frank and Kriegel, Klaus and Suri, Subhash and Verbeek, Kevin and Willert, Max},
  title =	{{Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{421--435},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.421},
  URN =		{urn:nbn:de:0030-drops-50970},
  doi =		{10.4230/LIPIcs.SOCG.2015.421},
  annote =	{Keywords: Orthogonal polygons, art gallery problem, hypergraph coloring}
}
@InProceedings{anagnostopoulos_et_al:LIPIcs.SOCG.2015.436,
  author =	{Anagnostopoulos, Evangelos and Emiris, Ioannis Z. and Psarros, Ioannis},
  title =	{{Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{436--450},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.436},
  URN =		{urn:nbn:de:0030-drops-51181},
  doi =		{10.4230/LIPIcs.SOCG.2015.436},
  annote =	{Keywords: Approximate nearest neighbor, Randomized embeddings, Curse of dimensionality, Johnson-Lindenstrauss Lemma, Bounded expansion rate, Experimental study}
}
@InProceedings{allenzhu_et_al:LIPIcs.SOCG.2015.451,
  author =	{Allen-Zhu, Zeyuan and Gelashvili, Rati and Razenshteyn, Ilya},
  title =	{{Restricted Isometry Property for General p-Norms}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{451--460},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.451},
  URN =		{urn:nbn:de:0030-drops-51273},
  doi =		{10.4230/LIPIcs.SOCG.2015.451},
  annote =	{Keywords: compressive sensing, dimension reduction, linear algebra, high-dimensional geometry}
}
@InProceedings{bauer_et_al:LIPIcs.SOCG.2015.461,
  author =	{Bauer, Ulrich and Munch, Elizabeth and Wang, Yusu},
  title =	{{Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{461--475},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.461},
  URN =		{urn:nbn:de:0030-drops-51467},
  doi =		{10.4230/LIPIcs.SOCG.2015.461},
  annote =	{Keywords: Reeb graph, interleaving distance, functional distortion distance}
}
@InProceedings{goaoc_et_al:LIPIcs.SOCG.2015.476,
  author =	{Goaoc, Xavier and Mabillard, Isaac and Pat\'{a}k, Pavel and Pat\'{a}kov\'{a}, Zuzana and Tancer, Martin and Wagner, Uli},
  title =	{{On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{476--490},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.476},
  URN =		{urn:nbn:de:0030-drops-51256},
  doi =		{10.4230/LIPIcs.SOCG.2015.476},
  annote =	{Keywords: Heawood Inequality, Embeddings, Van Kampen–Flores, Manifolds}
}
@InProceedings{dey_et_al:LIPIcs.SOCG.2015.491,
  author =	{Dey, Tamal K. and Shi, Dayu and Wang, Yusu},
  title =	{{Comparing Graphs via Persistence Distortion}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{491--506},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.491},
  URN =		{urn:nbn:de:0030-drops-51285},
  doi =		{10.4230/LIPIcs.SOCG.2015.491},
  annote =	{Keywords: Graph matching, metric graphs, persistence distortion, topological method}
}
@InProceedings{goaoc_et_al:LIPIcs.SOCG.2015.507,
  author =	{Goaoc, Xavier and Pat\'{a}k, Pavel and Pat\'{a}kov\'{a}, Zuzana and Tancer, Martin and Wagner, Uli},
  title =	{{Bounding Helly Numbers via Betti Numbers}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{507--521},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.507},
  URN =		{urn:nbn:de:0030-drops-51297},
  doi =		{10.4230/LIPIcs.SOCG.2015.507},
  annote =	{Keywords: Helly-type theorem, Ramsey’s theorem, Embedding of simplicial complexes, Homological almost-embedding, Betti numbers}
}
@InProceedings{raz_et_al:LIPIcs.SOCG.2015.522,
  author =	{Raz, Orit E. and Sharir, Micha and de Zeeuw, Frank},
  title =	{{Polynomials Vanishing on Cartesian Products: The Elekes-Szab\'{o} Theorem Revisited}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{522--536},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.522},
  URN =		{urn:nbn:de:0030-drops-51031},
  doi =		{10.4230/LIPIcs.SOCG.2015.522},
  annote =	{Keywords: Combinatorial geometry, incidences, polynomials}
}
@InProceedings{lund_et_al:LIPIcs.SOCG.2015.537,
  author =	{Lund, Ben and Sheffer, Adam and de Zeeuw, Frank},
  title =	{{Bisector Energy and Few Distinct Distances}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{537--552},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.537},
  URN =		{urn:nbn:de:0030-drops-51086},
  doi =		{10.4230/LIPIcs.SOCG.2015.537},
  annote =	{Keywords: Combinatorial geometry, distinct distances, incidence geometry}
}
@InProceedings{sharir_et_al:LIPIcs.SOCG.2015.553,
  author =	{Sharir, Micha and Solomon, Noam},
  title =	{{Incidences between Points and Lines in Three Dimensions}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{553--568},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.553},
  URN =		{urn:nbn:de:0030-drops-51107},
  doi =		{10.4230/LIPIcs.SOCG.2015.553},
  annote =	{Keywords: Combinatorial Geometry, Algebraic Geometry, Incidences, The Polynomial Method}
}
@InProceedings{raz_et_al:LIPIcs.SOCG.2015.569,
  author =	{Raz, Orit E. and Sharir, Micha},
  title =	{{The Number of Unit-Area Triangles in the Plane: Theme and Variations}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{569--583},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.569},
  URN =		{urn:nbn:de:0030-drops-51125},
  doi =		{10.4230/LIPIcs.SOCG.2015.569},
  annote =	{Keywords: Combinatorial geometry, incidences, repeated configurations}
}
@InProceedings{dvir_et_al:LIPIcs.SOCG.2015.584,
  author =	{Dvir, Zeev and Gopi, Sivakanth},
  title =	{{On the Number of Rich Lines in Truly High Dimensional Sets}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{584--598},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.584},
  URN =		{urn:nbn:de:0030-drops-51110},
  doi =		{10.4230/LIPIcs.SOCG.2015.584},
  annote =	{Keywords: Incidences, Combinatorial Geometry, Designs, Polynomial Method, Additive Combinatorics}
}
@InProceedings{dobbins_et_al:LIPIcs.SOCG.2015.599,
  author =	{Dobbins, Michael Gene and Holmsen, Andreas and Hubard, Alfredo},
  title =	{{Realization Spaces of Arrangements of Convex Bodies}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{599--614},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.599},
  URN =		{urn:nbn:de:0030-drops-51020},
  doi =		{10.4230/LIPIcs.SOCG.2015.599},
  annote =	{Keywords: Oriented matroids, Convex sets, Realization spaces, Mnev’s universality theorem}
}
@InProceedings{goswami_et_al:LIPIcs.SOCG.2015.615,
  author =	{Goswami, Mayank and Gu, Xianfeng and Pingali, Vamsi P. and Telang, Gaurish},
  title =	{{Computing Teichm\"{u}ller Maps between Polygons}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{615--629},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.615},
  URN =		{urn:nbn:de:0030-drops-50997},
  doi =		{10.4230/LIPIcs.SOCG.2015.615},
  annote =	{Keywords: Teichm\"{u}ller maps, Surface registration, Extremal Quasiconformal maps, Computer vision}
}
@InProceedings{felsner_et_al:LIPIcs.SOCG.2015.630,
  author =	{Felsner, Stefan and Micek, Piotr and Ueckerdt, Torsten},
  title =	{{On-line Coloring between Two Lines}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{630--641},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.630},
  URN =		{urn:nbn:de:0030-drops-50915},
  doi =		{10.4230/LIPIcs.SOCG.2015.630},
  annote =	{Keywords: intersection graphs, cocomparability graphs, on-line coloring}
}
@InProceedings{boissonnat_et_al:LIPIcs.SOCG.2015.642,
  author =	{Boissonnat, Jean-Daniel and S., Karthik C. and Tavenas, S\'{e}bastien},
  title =	{{Building Efficient and Compact Data Structures for Simplicial Complexes}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{642--657},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.642},
  URN =		{urn:nbn:de:0030-drops-50981},
  doi =		{10.4230/LIPIcs.SOCG.2015.642},
  annote =	{Keywords: Simplicial complex, Compact data structures, Automaton, NP-hard}
}
@InProceedings{arkin_et_al:LIPIcs.SOCG.2015.658,
  author =	{Arkin, Esther M. and Efrat, Alon and Knauer, Christian and Mitchell, Joseph S. B. and Polishchuk, Valentin and Rote, G\"{u}nter and Schlipf, Lena and Talvitie, Topi},
  title =	{{Shortest Path to a Segment and Quickest Visibility Queries}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{658--673},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.658},
  URN =		{urn:nbn:de:0030-drops-51474},
  doi =		{10.4230/LIPIcs.SOCG.2015.658},
  annote =	{Keywords: path planning, visibility, query structures and complexity, persistent data structures, continuous Dijkstra}
}
@InProceedings{kostitsyna_et_al:LIPIcs.SOCG.2015.674,
  author =	{Kostitsyna, Irina and van Kreveld, Marc and L\"{o}ffler, Maarten and Speckmann, Bettina and Staals, Frank},
  title =	{{Trajectory Grouping Structure under Geodesic Distance}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{674--688},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.674},
  URN =		{urn:nbn:de:0030-drops-51212},
  doi =		{10.4230/LIPIcs.SOCG.2015.674},
  annote =	{Keywords: moving entities, trajectories, grouping, computational geometry}
}
@InProceedings{chang_et_al:LIPIcs.SOCG.2015.689,
  author =	{Chang, Hsien-Chih and Har-Peled, Sariel and Raichel, Benjamin},
  title =	{{From Proximity to Utility: A Voronoi Partition of Pareto Optima}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{689--703},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.689},
  URN =		{urn:nbn:de:0030-drops-50925},
  doi =		{10.4230/LIPIcs.SOCG.2015.689},
  annote =	{Keywords: Voronoi diagrams, expected complexity, backward analysis, Pareto optima, candidate diagram, Clarkson-Shor technique}
}
@InProceedings{dadush:LIPIcs.SOCG.2015.704,
  author =	{Dadush, Daniel},
  title =	{{Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{704--718},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.704},
  URN =		{urn:nbn:de:0030-drops-51168},
  doi =		{10.4230/LIPIcs.SOCG.2015.704},
  annote =	{Keywords: Deterministic Volume Estimation, Convex Geometry, Lattice Coverings of Space, Lattice Point Enumeration}
}
@InProceedings{chan_et_al:LIPIcs.SOCG.2015.719,
  author =	{Chan, Timothy M. and Tsakalidis, Konstantinos},
  title =	{{Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{719--732},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.719},
  URN =		{urn:nbn:de:0030-drops-51353},
  doi =		{10.4230/LIPIcs.SOCG.2015.719},
  annote =	{Keywords: shallow cuttings, derandomization, halfspace range reporting, geometric data structures}
}
@InProceedings{chan:LIPIcs.SOCG.2015.733,
  author =	{Chan, Timothy M.},
  title =	{{A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{733--738},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.733},
  URN =		{urn:nbn:de:0030-drops-51415},
  doi =		{10.4230/LIPIcs.SOCG.2015.733},
  annote =	{Keywords: convex polyhedra, intersection, Dobkin–Kirkpatrick hierarchy}
}
@InProceedings{bringmann_et_al:LIPIcs.SOCG.2015.739,
  author =	{Bringmann, Karl and Mulzer, Wolfgang},
  title =	{{Approximability of the Discrete Fr\'{e}chet Distance}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{739--753},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.739},
  URN =		{urn:nbn:de:0030-drops-51072},
  doi =		{10.4230/LIPIcs.SOCG.2015.739},
  annote =	{Keywords: Fr\'{e}chet distance, approximation, lower bounds, Strong Exponential Time Hypothesis}
}
@InProceedings{awasthi_et_al:LIPIcs.SOCG.2015.754,
  author =	{Awasthi, Pranjal and Charikar, Moses and Krishnaswamy, Ravishankar and Sinop, Ali Kemal},
  title =	{{The Hardness of Approximation of Euclidean k-Means}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{754--767},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.754},
  URN =		{urn:nbn:de:0030-drops-51178},
  doi =		{10.4230/LIPIcs.SOCG.2015.754},
  annote =	{Keywords: Euclidean k-means, Hardness of Approximation, Vertex Cover}
}
@InProceedings{klein_et_al:LIPIcs.SOCG.2015.768,
  author =	{Klein, Rolf and Langetepe, Elmar and Levcopoulos, Christos},
  title =	{{A Fire Fighter’s Problem}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{768--780},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.768},
  URN =		{urn:nbn:de:0030-drops-51044},
  doi =		{10.4230/LIPIcs.SOCG.2015.768},
  annote =	{Keywords: Motion Planning, Dynamic Environments, Spiralling strategies, Lower and upper bounds}
}
@InProceedings{arya_et_al:LIPIcs.SOCG.2015.781,
  author =	{Arya, Sunil and Mount, David M. and Park, Eunhui},
  title =	{{Approximate Geometric MST Range Queries}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{781--795},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.781},
  URN =		{urn:nbn:de:0030-drops-51233},
  doi =		{10.4230/LIPIcs.SOCG.2015.781},
  annote =	{Keywords: Geometric data structures, Minimum spanning trees, Range searching, Approximation algorithms}
}
@InProceedings{agarwal_et_al:LIPIcs.SOCG.2015.796,
  author =	{Agarwal, Pankaj K. and M{\o}lhave, Thomas and Revsb{\ae}k, Morten and Safa, Issam and Wang, Yusu and Yang, Jungwoo},
  title =	{{Maintaining Contour Trees of Dynamic Terrains}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{796--811},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.796},
  URN =		{urn:nbn:de:0030-drops-51406},
  doi =		{10.4230/LIPIcs.SOCG.2015.796},
  annote =	{Keywords: Contour tree, dynamic terrain, kinetic data structure}
}
@InProceedings{bos_et_al:LIPIcs.SOCG.2015.812,
  author =	{Bos, Arie and Haverkort, Herman J.},
  title =	{{Hyperorthogonal Well-Folded Hilbert Curves}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{812--826},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.812},
  URN =		{urn:nbn:de:0030-drops-50962},
  doi =		{10.4230/LIPIcs.SOCG.2015.812},
  annote =	{Keywords: space-filling curve, Hilbert curve, multi-dimensional, range query, R-tree}
}
@InProceedings{buchet_et_al:LIPIcs.SOCG.2015.827,
  author =	{Buchet, Micka\"{e}l and Chazal, Fr\'{e}d\'{e}ric and Dey, Tamal K. and Fan, Fengtao and Oudot, Steve Y. and Wang, Yusu},
  title =	{{Topological Analysis of Scalar Fields with Outliers}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{827--841},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.827},
  URN =		{urn:nbn:de:0030-drops-51052},
  doi =		{10.4230/LIPIcs.SOCG.2015.827},
  annote =	{Keywords: Persistent Homology, Topological Data Analysis, Scalar Field Analysis, Nested Rips Filtration, Distance to a Measure}
}
@InProceedings{franek_et_al:LIPIcs.SOCG.2015.842,
  author =	{Franek, Peter and Krc\'{a}l, Marek},
  title =	{{On Computability and Triviality of Well Groups}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{842--856},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.842},
  URN =		{urn:nbn:de:0030-drops-51159},
  doi =		{10.4230/LIPIcs.SOCG.2015.842},
  annote =	{Keywords: nonlinear equations, robustness, well groups, computation, homotopy theory}
}
@InProceedings{phillips_et_al:LIPIcs.SOCG.2015.857,
  author =	{Phillips, Jeff M. and Wang, Bei and Zheng, Yan},
  title =	{{Geometric Inference on Kernel Density Estimates}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{857--871},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.857},
  URN =		{urn:nbn:de:0030-drops-51349},
  doi =		{10.4230/LIPIcs.SOCG.2015.857},
  annote =	{Keywords: topological data analysis, kernel density estimate, kernel distance}
}
@InProceedings{albers:LIPIcs.SOCG.2015.872,
  author =	{Albers, Susanne},
  title =	{{Modeling Real-World Data Sets}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{872--872},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.872},
  URN =		{urn:nbn:de:0030-drops-50865},
  doi =		{10.4230/LIPIcs.SOCG.2015.872},
  annote =	{Keywords: Worst-case analysis, real data sets, locality of reference, paging, self-organizing lists}
}