Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar30. Symposium on Computational Geometry 2014: Kyoto, Japan
Siu-Wing Cheng, Olivier Devillers:
30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014. ACM 2014, ISBN 978-1-4503-2594-3- Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. 20 - Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. 30 - Timothy M. Chan, Patrick Lee:
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. 40 - Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg:
Progressive Geometric Algorithms. 50 - Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. 60 - Dániel Marx, Anastasios Sidiropoulos:
The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems. 67 - Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. 78 - Mira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Maarten Löffler, Frank Staals:
The Connect-The-Dots Family of Puzzles: The Video. 85 - Sebastian Kürten, Wolfgang Mulzer:
LiveCG: an Interactive Visualization Environment for Computational Geometry. 86 - Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals:
Trajectory Grouping Structure: the Video. 88 - John Hershberger, Valentin Polishchuk, Bettina Speckmann, Topi Talvitie:
Geometric kth Shortest Paths: the Applet. 96 - Sylvester David Eriksson-Bique, Valentin Polishchuk, Mikko Sysikaski:
Optimal Geometric Flows via Dual Programs. 100 - Jeff Erickson, Anastasios Sidiropoulos:
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs. 130 - Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer:
Improved bounds for the conflict-free chromatic art gallery problem. 144 - Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. 154 - Orit E. Raz, Micha Sharir, József Solymosi:
On triple intersections of three families of unit circles. 198 - Tal Kaminker, Micha Sharir:
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. 206 - Alexander Munteanu, Christian Sohler, Dan Feldman:
Smallest enclosing ball for probabilistic data. 214 - Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. 224 - Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. 251 - Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Using Convex Relaxations for Efficiently and Privately Releasing Marginals. 261 - Pankaj K. Agarwal, Jiangwei Pan:
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers. 271 - Arturs Backurs, Piotr Indyk:
Better embeddings for planar Earth-Mover Distance over sparse sets. 280 - Jonathan Richard Shewchuk, Hang Si:
Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement. 290 - Hiba Abdallah, Quentin Mérigot:
On the reconstruction of convex sets from random normal measurements. 300 - Pedro Machado Manhães de Castro, Quentin Mérigot, Boris Thibert:
Intersection of paraboloids and application to Minkowski-type problems. 308 - Ioannis Z. Emiris, Vissarion Fisikopoulos:
Efficient Random-Walk Methods for Approximating Polytope Volume. 318 - Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. 335 - Ulrich Bauer, Michael Lesnick:
Induced Matchings of Barcodes and the Algebraic Stability of Persistence. 355 - Maike Buchin, Anne Driemel, Bettina Speckmann:
Computing the Fréchet distance with shortcuts is NP-hard. 367 - Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. 377 - Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Continuously Flattening Polyhedra Using Straight Skeletons. 396 - Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-Point L1 Shortest Path Queries in the Plane. 406-416 - Sunil Arya, Timothy M. Chan:
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. 416 - Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth:
Free Edge Lengths in Plane Graphs. 426 - Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. 436 - Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. 444 - Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Larry A. Wasserman:
Stochastic Convergence of Persistence Landscapes and Silhouettes. 474 - Frédéric Chazal, Jian Sun:
Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph. 491 - Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová:
Lower bounds on geometric Ramsey functions. 558 - Imre Bárány, Jirí Matousek, Attila Pór:
Curves in Rd intersecting every hyperplane at most d + 1 times. 565
maintained by 
, founded at 
, founded at 
last updated on 2019-02-21 20:44 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
