default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 7
Volume 7, Number 1, 2016
- Maria Axenovich, Torsten Ueckerdt:
Density of range capturing hypergraphs. 1-21 - David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann
, Kevin Verbeek:
Strict confluent drawing. 22-46 - Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On self-approaching and increasing-chord drawings of 3-connected planar graphs. 47-69 - Benjamin A. Burton, Murray Elder, Arkadius G. Kalka, Stephan Tillmann:
2-manifold recognition is in logspace. 70-85 - Marc Glisse, Sylvain Lazard, Julien Michel, Marc Pouget:
Silhouette of a random polytope. 86-99 - Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-preserving spatial treemaps. 100-122 - Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. 123-148 - Romanos-Diogenes Malikiosis, Sinai Robins, Yichi Zhang:
Polyhedral Gauss sums, and polytopes with symmetry. 149-170 - Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi:
Rigid origami vertices: conditions and forcing sets. 171-184 - Rafel Jaume, Günter Rote:
Recursively-regular subdivisions and applications. 185-220 - Nikhil Bansal, Kirk Pruhs:
Weighted geometric set multi-cover via quasi-uniform sampling. 221-236 - Stephan Tillmann, Sampson Wong:
An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface. 237-255 - Stephan Friedrichs, Michael Hemmer, James King, Christiane Schmidt:
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS. 256-284 - Sharif Ibrahim, Bala Krishnamoorthy, Kevin R. Vixie:
Flat norm decomposition of integral currents. 285-307 - Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent labeling of rotating maps. 308-331 - Olivier Devillers, Ross Hemsley:
The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$. 332-359 - Christian Scheffer:
Near-linear time medial axis approximation of smooth curves in $\mathbb{R}^3$. 360-429 - Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing shrinkable complexes is NP-complete. 430-443 - Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. 444-472 - Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-point L1 shortest path queries in the plane. 473-519 - Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. 520-539 - Matt Gibson, Gaurav Kanade, Rainer Penninger, Kasturi R. Varadarajan, Ivo Vigan:
On isolating points using unit disks. 540-557
Volume 7, Number 2, 2016
Articles
- David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. 3-18 - Sariel Har-Peled:
Shortest path in a polygon using sublinear space. 19-45 - Karl Bringmann, Wolfgang Mulzer:
Approximability of the discrete Fréchet distance. 46-76 - Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. 77-100 - Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse:
Smoothed complexity of convex hulls by witnesses and collectors. 101-144 - Arie Bos, Herman J. Haverkort:
Hyperorthogonal well-folded Hilbert curves. 145-190 - Therese Biedl, Martin Derka:
1-string B2-VPG representation of planar graphs. 191-215
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 2025-01-20 23:01 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:
