default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 32
Volume 32, Number 1, September 2005
- Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon
:
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. 1-12 - Adrian Dumitrescu:
On some monotone path problems in line arrangements. 13-25 - Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume. 26-58 - Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs. 59-69
Volume 32, Number 2, October 2005
- Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Orthogonal drawings of graphs with vertex and edge labels. 71-114 - Yehuda Koren, David Harel:
One-dimensional layout optimization, with applications to graph drawing by axis separation. 115-138 - Mario Alberto López, Shlomo Reisner:
Hausdorff approximation of convex polygons. 139-158 - Yogish Sabharwal, Sandeep Sen:
A linear time algorithm for approximate 2-means clustering. 159-172
Volume 32, Number 3, November 2005
- Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink:
Polygonal path simplification with angle constraints. 173-187 - Paz Carmi, Sariel Har-Peled, Matthew J. Katz:
On the Fermat-Weber center of a convex object. 188-195 - Esther Ezra, Micha Sharir:
Counting and representing intersections among triangles in three dimensions. 196-215 - Zsolt Fekete, Tibor Jordán:
Rigid realizations of graphs on small grids. 216-222 - Ovidiu Daescu, Robert Serfling:
Extremal point queries with lines and line segments and related problems. 223-237
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-12-05 22:23 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:
