default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 13
Volume 13, Number 1, 2022
- Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. 1-12 - Thomas C. Shermer:
A combinatorial bound for beacon-based routing in orthogonal polygons. 13-51 - Frédéric Cazals, Augustin Chevallier, Sylvain Pion:
Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics. 52-88 - Elena Farahbakhsh Touli, Yusu Wang:
FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees. 89-124 - Matthijs Ebbens, Iordan Iordanov, Monique Teillaud, Gert Vegter:
Delaunay triangulations of generalized Bolza surfaces. 125-177 - Kevin Buchin, Sariel Har-Peled
, Dániel Oláh:
Sometimes reliable spanners of almost linear size. 178-196 - Yufei Zheng, Kritkorn Karntikoon, Bernard Chazelle:
A Geometric Approach to Inelastic Collapse. 197-203 - Kyle Fox, Jiashuai Lu:
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread. 204-225 - Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-optimal algorithms for point-line fitting problems. 226-243 - Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On morphs of 1-plane graphs. 244-262 - Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal morphs of planar orthogonal drawings. 263-297 - Mickaël Buchet, Emerson G. Escolar:
Realizations of indecomposable persistence modules of arbitrarily large dimensions. 298-326 - Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing weighted and seeded disk graphs. 327-376 - Jean Cardinal, Aurélien Ooms:
Algorithms for approximate sparse regression and nearest induced hulls. 377-398 - Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal point location and rectangle stabbing queries in 3-d. 399-428 - Lucas Magee, Yusu Wang:
Graph skeletonization of high-dimensional point cloud data via topological method. 429-470 - Márton Naszódi, Konrad J. Swanepoel:
Contacts in totally separable packings in the plane and in high dimensions. 471-483
Volume 13, Number 2, 2022
Special Issue of Selected Papers from SoCG 2021
- Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-case optimal squares packing into disks. 3-29 - Karl Bringmann, André Nusser:
Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation. 30-50 - Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. 51-72 - Imre Bárány, Attila Pór, Pavel Valtr:
Orientation preserving maps of the n × n grid. 73-89 - Timothy M. Chan, Qizheng He:
More dynamic data structures for geometric set cover with sublinear update time. 90-114 - Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. 115-150
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-12-27 21:30 CET 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:
