Discrete & Computational Geometry

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Discrete & Computational Geometry  
DiscreteCG.jpg
Disciplinediscrete geometry, computational geometry
LanguageEnglish
Edited byKenneth L. Clarkson, János Pach.
Publication details
History1986–present
Publisher
FrequencyQuarterly
0.935 (2009)
Standard abbreviations
ISO 4Discrete Comput. Geom.
Indexing
CODENDCGEER
ISSN0179-5376 (print)
1432-0444 (web)
LCCN90656510
Links

Discrete & Computational Geometry is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry.

Abstracting and indexing[edit]

The journal is indexed in:

Notable articles[edit]

The articles by Gil Kalai[1] with a proof of a subexponential upper bound on the diameter of a polyhedron and by Samuel Ferguson[2] on the Kepler conjecture, both published in Discrete & Computational geometry, earned their author the Fulkerson Prize.

References[edit]

  1. ^ Kalai, Gil (1992). "Upper bounds for the diameter and height of graphs of the convex polyhedra". Discrete & Computational Geometry. 8: 363–372. doi:10.1007/bf02293053.
  2. ^ Ferguson, Samuel P. (2006). "Sphere Packings, V. Pentahedral Prisms". Discrete & Computational Geometry. 36: 167–204. doi:10.1007/s00454-005-1214-y.

External links[edit]