default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 35
Volume 35, Numbers 1-2, August 2006
- Jean-Daniel Boissonnat, Jack Snoeyink
:
Editorial. 1 - Jie Gao, Leonidas J. Guibas, An Thai Nguyen:
Deformable spanners and applications. 2-19 - Timothy M. Chan:
Faster core-set constructions and data-stream algorithms in fixed dimensions. 20-35 - Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Exact, efficient, and complete arrangement computation for cubic curves. 36-73 - Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation. 74-99 - Jyh-Ming Lien, Nancy M. Amato:
Approximate convex decomposition of polygons. 100-123 - Tamal K. Dey, Samrat Goswami:
Provable surface reconstruction from noisy samples. 124-141
Volume 35, Number 3, October 2006
- Konstantinos G. Kakoulis, Ioannis G. Tollis:
Algorithms for the multiple label placement problem. 143-161 - Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing homotopic shortest paths efficiently. 162-172 - J. Mark Keil, Tzvetalin S. Vassilev:
Algorithms for optimal area triangulations of a convex polygon. 173-187 - Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe:
The minimum Manhattan network problem: Approximations and exact solutions. 188-208 - Timothy M. Chan:
Three problems about simple polygons. 209-217 - Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The minimum-area spanning tree problem. 218-225
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-22 01:37 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.
