default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 9
Volume 9, Number 1, 2018
- Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing maxmin edge length triangulations. 1-26 - Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
:
Scalable exact visualization of isocontours in road networks via minimum-link paths. 27-73 - Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat foldings of plane graphs with prescribed angles and edge lengths. 74-93 - Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. 94-130 - Haitao Wang:
On the geodesic centers of polygonal domains. 131-190 - Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Improved time-space trade-offs for computing Voronoi diagrams. 191-212 - Jean Cardinal, Stefan Felsner:
Topological drawings of complete bipartite graphs. 213-246 - Luca Castelli Aleardi, Olivier Devillers:
Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees. 247-289 - Linda Kleist:
Drawing planar graphs with prescribed face areas. 290-311 - Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. 312-327 - Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg:
Planar and poly-arc Lombardi drawings. 328-355 - Vida Dujmovic, David R. Wood:
Thickness and antithickness of graphs. 356-386 - János Pach, Peter Frankl:
A stability theorem on cube tessellations. 387-390 - Luca Castelli Aleardi, Olivier Devillers, Éric Fusy:
Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus. 391-429 - Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen:
Routing on the visibility graph. 430-453
Volume 9, Number 2, 2018
Articles
- Timothy M. Chan:
Applications of Chebyshev polynomials to low-dimensional computational geometry. 3-20 - Mickaël Buchet, Tamal K. Dey, Jiayuan Wang, Yusu Wang:
Declutter and resample: Towards parameter free denoising. 21-46 - Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-grained complexity of coloring unit disks and balls. 47-80 - Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Orthogonal Range Searching on the RAM, Revisited. 45-66 - Herbert Edelsbrunner, Hubert Wagner:
Topological data analysis with Bregman divergences. 67-86
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-10-14 23:18 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:
