default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 8
Volume 8, Number 1, 2017
- Helmut Alt, Mark de Berg
, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. 1-10 - Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. 11-31 - Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On interference among moving sensors and related problems. 32-46 - Manuel Wettstein:
Counting and enumerating crossing-free geometric graphs. 47-77 - Stephane Durocher, Alexandre Leblanc, Matthew Skala:
The projection median as a weighted average. 78-104 - Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-space trade-offs for triangulating a simple polygon. 105-124 - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive local routing with constraints. 125-152 - Arnaud Bannier, Nicolas Bodin:
A new drawing for simple Venn diagrams based on algebraic construction. 153-173 - Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. 174-205 - Herman J. Haverkort:
How many three-dimensional Hilbert curves are there? 206-281 - Olivier Devillers, Menelaos Karavelas, Monique Teillaud:
Qualitative symbolic perturbation: two applications of a new geometry-based perturbation framework. 282-315 - David Eppstein:
Maximizing the sum of radii of disjoint balls or disks. 316-339 - Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing nonsimple polygons of minimum perimeter. 340-365 - Marc J. van Kreveld, Maarten Löffler, Frank Staals:
Central trajectories. 366-386
Volume 8, Number 2, 2017
Articles
- Sándor P. Fekete, Anna Lubiw:
Guest editors' foreword. 1 - Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree four plane spanners: Simpler and better. 3-31 - Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane separability and convexity of probabilistic point sets. 32-57 - Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface-embedded graphs. 58-79 - Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the complexity of minimum-link path problems. 80-108 - Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. 109-177
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-02-05 20:21 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:
