Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 31
Volume 31, Number 1-2, May 2005
- David M. Mount:
Editorial. 1 - John Hershberger:
Smooth kinetic maintenance of clusters. 3-30 - Ruth Haas
, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. 31-61 - Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos:
Curve reconstruction from noisy samples. 63-100 - Jeff Erickson:
Local polyhedra and geometric graphs. 101-125 - Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost-driven octree construction schemes: an experimental study. 127-148
Volume 31, Number 3, June 2005
- Jack Snoeyink:
Editorial. 149 - Michael Hoffmann:
A simple linear algorithm for computing rectilinear 3-centers. 150-165 - Christian Sohler:
Fast reconstruction of Delaunay triangulations. 166-178 - Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: a paradigm for efficient and exact geometric programs. 179-194 - Ileana Streinu:
Non-stretchable pseudo-visibility graphs. 195-206 - Therese C. Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron? 207-218 - Godfried T. Toussaint:
The Erdös-Nagy theorem and its ramifications . 219-236 - Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman:
Hinged dissection of polyominoes and polyforms. 237-262
a service of 
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-04-18 20:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
