default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 47
Volume 47, Number 1, January 2014
- Arash Farzan, Travis Gagie
, Gonzalo Navarro:
Entropy-bounded representation of point grids. 1-14 - Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon:
Overlap of convex polytopes under rigid motion. 15-24 - Franz-Josef Brandenburg:
Upward planar drawings on the standing and the rolling cylinders. 25-41 - Gabriel Nivasch, János Pach, Gábor Tardos:
The visible perimeter of an arrangement of disks. 42-51 - Stefan Walzer, Maria Axenovich, Torsten Ueckerdt:
Packing polyominoes clumsily. 52-60 - Alexander Gilbers, Rolf Klein:
A new upper bound for the VC-dimension of visibility regions. 61-74 - Francisco Botana, Miguel A. Abánades:
Automatic deduction in (dynamic) geometry: Loci computation. 75-89 - Prosenjit Bose, Jean-Lou De Carufel:
Minimum-area enclosing triangle with a fixed angle. 90-109
Volume 47, Number 2, Part A, February 2014
- Greg Aloupis, David Bremner:
Editorial. 111 - Timothy M. Chan, Elyot Grant:
Exact algorithms and APX-hardness results for geometric packing and covering problems. 112-124 - Christian Scheffer, Jan Vahrenhold:
Approximating geodesic distances on 2-manifolds in R3. 125-140 - Gruia Calinescu, Howard J. Karloff:
Sequential dependency computation via geometric data structures. 141-148 - Joseph O'Rourke, Costin Vîlcu:
Development of curves on polyhedra via conical existence. 149-163 - Xiaoye Jiang, Jian Sun, Leonidas J. Guibas:
A Fourier-theoretic approach for inferring symmetries. 164-174 - Jürgen Bokowski, Vincent Pilaud:
Enumerating topological (nk)-configurations. 175-186 - Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. 187-197
Volume 47, Number 2, Part B, February 2014
- Frank Dehne, John Iacono:
Foreword. 199 - Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the area requirements of Euclidean minimum spanning trees. 200-213 - Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest pair and the post office problem for stochastic points. 214-223 - Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. 224-239 - Timothy M. Chan, Vinayak Pathak:
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. 240-247 - Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-approximation for strip packing. 248-267 - Meng He, J. Ian Munro:
Space efficient data structures for dynamic orthogonal range counting. 268-281 - Therese Biedl, Lesvia Elena Ruiz Velázquez:
Orthogonal cartograms with at most 12 corners per face. 282-294
Volume 47, Number 2, Part C, February 2014
- Pat Morin:
Guest Editor's Introduction. 295 - Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and guarding realistic polygons. 296-306 - Binay K. Bhattacharya, Qiaosheng Shi:
Improved algorithms to network p-center location problems. 307-315 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a polygon - or - rolling a ball out of a polygon. 316-328 - Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel H. M. Smid:
Data structures for range-aggregate extent queries. 329-347
Volume 47, Number 3, Part A, April 2014
- Lei Xu, Jinhui Xu:
Approximating minimum bending energy path in a simple corridor. 349-366 - Imre Bárány, Edgardo Roldán-Pensado:
Longest convex lattice chains. 367-376 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. 377-380 - Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-regular schematization of embedded paths. 381-406 - Gill Barequet, Alex Goryachev:
Offset polygon and annulus placement problems. 407-434 - Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. 435-446 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck non-crossing matching in the plane. 447-457
Volume 47, Number 3, Part B, April 2014
- Walter Didimo, Giuseppe Liotta:
Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword. 459 - Stefan Felsner, Michael Kaufmann, Pavel Valtr:
Bend-optimal orthogonal graph drawing in the general position model. 460-468 - Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Reprint of: Memory-constrained algorithms for simple polygons. 469-479 - Martin Balko:
Reprint of: Grid representations and the chromatic number. 480-492 - Tamara Mchedlidze:
Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points. 493-498 - Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Reprint of: Optimally solving a transportation problem using Voronoi diagrams. 499-506 - Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Reprint of: Refold rigidity of convex polyhedra. 507-517 - Oswin Aichholzer, Tillmann Miltzow, Alexander Pilz:
Reprint of: Extreme point and halving edge search in abstract order types. 518-526
Volume 47, Number 4, May 2014
- Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman routes for lines and line segments. 527-538 - Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos Chrisochoides:
Guaranteed quality tetrahedral Delaunay meshing for medical images. 539-562
Volume 47, Number 5, July 2014
- Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Javier Tejel:
Compatible spanning trees. 563-584 - Balázs Keszegh, Dömötör Pálvölgyi:
Octants are cover-decomposable into many coverings. 585-588 - Alexander Pilz:
Flip distance between triangulations of a planar point set is APX-hard. 589-604 - Oswin Aichholzer, Ruy Fabila-Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber:
Lower bounds for the number of small convex k-holes. 605-613 - Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar graph drawings with few slopes. 614-624 - Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of polygonal curves in the presence of outliers. 625-641
Volume 47, Number 6, August 2014
- Michael Hoffmann, Emo Welzl:
Editorial. 643 - Oswin Aichholzer, Ruy Fabila-Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Birgit Vogtenhuber:
4-Holes in point sets. 644-650 - Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski:
Minimum-link paths revisited. 651-667 - Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner:
A proof of the Oja depth conjecture in the plane. 668-674 - Kokichi Sugihara:
Design of solids for antigravity motion illusion. 675-682 - Mark de Berg, Bettina Speckmann, Vincent van der Weele:
Treemaps with bounded aspect ratio. 683-693
Volume 47, Number 7, August 2014
- Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest path queries on transportation network. 695-709 - Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. 710-723 - Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. 724-727 - Mohammad Ali Abam, Shervin Daneshpajouh, Lasse Deleuran, Shayan Ehsani, Mohammad Ghodsi:
Computing homotopic line simplification. 728-739 - Jonathan Richard Shewchuk:
Reprint of: Delaunay refinement algorithms for triangular mesh generation. 741-778
Volume 47, Number 8, September 2014
- Sang Won Bae:
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments. 779-788 - Christian Scheffer, Jan Vahrenhold:
Approximating geodesic distances on 2-manifolds in R3: The weighted case. 789-808 - Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On k-convex point sets. 809-832 - Giovanni Viglietta:
Face-guarding polyhedra. 833-846 - Fatemeh Panahi, A. Frank van der Stappen:
Bounding the locus of the center of mass for a part with shape variation. 847-855 - Jean-Paul Bourrières:
The Minkowski sum of simplices in 3-dimensional space: An analytical description. 856-867
Volume 47, Number 9, October 2014
- Christophe Dehlinger, Jean-François Dufourd:
Formal specification and proofs for the topology and classification of combinatorial surfaces. 869-890 - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. 891-898 - Pradeesha Ashok, Umair Azmi, Sathish Govindarajan:
Small strong epsilon nets. 899-909 - Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. 910-917 - Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. 918-926
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 2026-08-09 22:58 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
