default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 1
Volume 1, Number 1, 2010
- Kenneth L. Clarkson, Günter Rote:
Welcome from the Editors-in-Chief. 1-2 - David Eppstein:
Happy Endings for Flip Graphs. 3-28 - Attila Pór, David R. Wood:
On Visibility and Blockers. 29-40 - Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. 41-56 - Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. 57-71 - Gunnar E. Carlsson, Gurjeet Singh, Afra Zomorodian:
Computing Multidimensional Persistence. 72-100 - Christian Wulff-Nilsen:
Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time. 101-122
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-07 23:56 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:
