default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 2
Volume 2, Number 1, 2011
- Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets. 1-15 - Adrian Dumitrescu:
Approximate Euclidean Ramsey Theorems. 16-29 - Olivier Devillers
:
Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time. 30-45 - Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang:
Constant-Work-Space Algorithms for Geometric Problems. 46-68 - Sriram V. Pemmaraju, Imran A. Pirwani:
Good Quality Virtual Realization of Unit Disk Graphs. 69-91 - Herman J. Haverkort:
Recursive tilings and space-filling curves with little fragmentation. 92-127 - Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv:
Points with Large Quadrant Depth. 128-143 - David Eppstein:
Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. 144-182 - Martin Tancer:
d-representability of simplicial complexes of fixed dimension. 183-188 - Christian Knauer, Andreas Spillner:
A fixed-parameter algorithm for the minimum Manhattan network problem. 189-204
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-12-23 19:37 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:
