Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st SoCG 2015: Eindhoven, The Netherlands
- Lars Arge, János Pach:
31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands. LIPIcs 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-83-5 - Front Matter, Table of Contents, Preface, Conference Organization. i-xx
- Jirí Matousek, Aleksandar Nikolov:
Combinatorial Discrepancy for Boxes via the gamma_2 Norm. 1-15 - Aaron T. Becker
, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, Rose Morris-Wright:
Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. 16-18 - Gill Barequet, Mira Shalah:
Automatic Proofs for Formulae Enumerating Proper Polycubes. 19-22 - Nicholas J. Cavanna, Mahmoodreza Jahanseir, Donald R. Sheehy:
Visualizing Sparse Filtrations. 23-25 - Topi Talvitie:
Visualizing Quickest Visibility Maps. 26-28 - Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. 29-43 - Wolfgang Mulzer, Yannik Stein:
Computational Aspects of the Colorful Carathéodory Theorem. 44-58 - Andrew Suk:
Semi-algebraic Ramsey Numbers. 59-73 - Oliver Roche-Newton:
A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set. 74-80 - Menelaos I. Karavelas, Eleni Tzanaki:
A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes. 81-95 - Kunal Dutta, Esther Ezra, Arijit Ghosh:
Two Proofs for Shallow Packings. 96-110 - Sariel Har-Peled:
Shortest Path in a Polygon using Sublinear Space. 111-125 - Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. 126-140 - Therese Biedl, Martin Derka:
1-String B_2-VPG Representation of Planar Graphs. 141-155 - Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners and Reachability Oracles for Directed Transmission Graphs. 156-170 - Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. 171-185 - Mohammad Ali Abam, Marjan Adeli, Hamid Homapour, Pooya Zafar Asadollahpoor:
Geometric Spanners for Points Inside a Polygonal Domain. 186-197 - Mikkel Abrahamsen:
An Optimal Algorithm for the Separating Common Tangents of Two Polygons. 198-208 - Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. 209-223 - Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse:
On the Smoothed Complexity of Convex Hulls. 224-238 - Drago Bokal, Sergio Cabello, David Eppstein:
Finding All Maximal Subsequences with Hereditary Properties. 240-254 - Ramsay Dyer, Gert Vegter, Mathijs Wintraecken:
Riemannian Simplices and Triangulations. 255-269 - Benjamin A. Burton, William Pettersson:
An Edge-Based Framework for Enumerating 3-Manifold Triangulations. 270-284 - Alexander Pilz, Emo Welzl:
Order on Order Types. 285-299 - Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec:
Limits of Order Types. 300-314 - Komei Fukuda, Bernd Gärtner, May Szedlák:
Combinatorial Redundancy Detection. 315-328 - Vincent Cohen-Addad, Claire Mathieu:
Effectiveness of Local Search for Geometric Optimization. 329-343 - Daniel Dadush, Nicolai Hähnle:
On the Shadow Simplex Method for Curved Polyhedra. 345-359 - Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. 360-373 - Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. 374-389 - Stephen Kiazyk, Anna Lubiw:
Star Unfolding from a Geodesic Curve. 390-404 - Ben J. Green:
The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk). 405-405 - Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak:
On the Beer Index of Convexity and Its Variants. 406-420 - Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. 421-435 - Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros:
Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor. 436-450 - Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
Restricted Isometry Property for General p-Norms. 451-460 - Ulrich Bauer, Elizabeth Munch, Yusu Wang:
Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs. 461-475 - Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. 476-490 - Tamal K. Dey, Dayu Shi, Yusu Wang:
Comparing Graphs via Persistence Distortion. 491-506 - Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Bounding Helly Numbers via Betti Numbers. 507-521 - Orit E. Raz, Micha Sharir, Frank de Zeeuw:
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited. 522-536 - Ben Lund, Adam Sheffer, Frank de Zeeuw:
Bisector Energy and Few Distinct Distances. 537-552 - Micha Sharir, Noam Solomon:
Incidences between Points and Lines in Three Dimensions. 553-568 - Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variations. 569-583 - Zeev Dvir, Sivakanth Gopi:
On the Number of Rich Lines in Truly High Dimensional Sets. 584-598 - Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. 599-614 - Mayank Goswami, Xianfeng Gu, Vamsi Pingali, Gaurish Telang:
Computing Teichmüller Maps between Polygons. 615-629 - Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line Coloring between Two Lines. 630-641 - Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas:
Building Efficient and Compact Data Structures for Simplicial Complexes. 642-656 - Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest Path to a Segment and Quickest Visibility Queries. 658-673 - Irina Kostitsyna, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure under Geodesic Distance. 674-688 - Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. 689-703 - Daniel Dadush:
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings. 704-718 - Timothy M. Chan, Konstantinos Tsakalidis:
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings. 719-732 - Timothy M. Chan:
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. 733-738 - Karl Bringmann, Wolfgang Mulzer:
Approximability of the Discrete Fréchet Distance. 739-753 - Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-Means. 754-767 - Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. 768-780 - Sunil Arya, David M. Mount, Eunhui Park:
Approximate Geometric MST Range Queries. 781-795 - Pankaj K. Agarwal, Thomas Mølhave, Morten Revsbæk, Issam Safa, Yusu Wang, Jungwoo Yang:
Maintaining Contour Trees of Dynamic Terrains. 796-811 - Arie Bos, Herman J. Haverkort:
Hyperorthogonal Well-Folded Hilbert Curves. 812-826 - Mickaël Buchet, Frédéric Chazal, Tamal K. Dey, Fengtao Fan, Steve Y. Oudot, Yusu Wang:
Topological Analysis of Scalar Fields with Outliers. 827-841 - Peter Franek, Marek Krcál:
On Computability and Triviality of Well Groups. 842-856 - Jeff M. Phillips, Bei Wang, Yan Zheng:
Geometric Inference on Kernel Density Estimates. 857-871 - Susanne Albers:
Modeling Real-World Data Sets (Invited Talk). 872-872
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
