default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 68
Volume 68, March 2018
- Prosenjit Bose, Pedro Ramos:
Editorial: Special issue in memory of Dr. Ferran Hurtado. 1 - János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth:
Note on k-planar crossing numbers. 2-6 - Andrei Asinowski
, Günter Rote:
Point sets with many non-crossing perfect matchings. 7-33 - Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a polygonal terrain with the shortest beacon watchtower. 34-47 - Mirela Damian:
Cone-based spanners of constant degree. 48-61 - Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a set of circles with minimum sum of radii. 62-76 - Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. 77-88 - Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt:
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. 89-100 - Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem illumination of monotone polygons. 101-118 - Herbert Edelsbrunner, Mabel Iglesias Ham:
Multiple covers with balls I: Inclusion-exclusion. 119-133 - Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu:
Forest-like abstract Voronoi diagrams in linear time. 134-145 - Mercè Claverol, Alfredo García Olaverri, Delia Garijo, Carlos Seara, Javier Tejel:
On Hamiltonian alternating cycles and paths. 146-166 - Mikio Kano, Jan Kyncl:
The hamburger theorem. 167-173 - William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table cartogram. 174-185 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. 186-205 - Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. 206-225 - Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch:
Pachinko. 226-242 - Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
The dual diameter of triangulations. 243-252 - Adrian Dumitrescu, Minghui Jiang:
Minimum rectilinear Steiner tree of n points in the unit square. 253-261 - Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored spanning graphs for set visualization. 262-276 - Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
On the 𝒪β of a planar point set. 277-291 - Ruy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia:
Colored ray configurations. 292-308 - Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping edge-labelled triangulations. 309-326 - Suneeta Ramaswami, Marcelo Siqueira:
A fast algorithm for computing irreducible triangulations of closed surfaces in 𝔼d. 327-357
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-24 20: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:
