[go: up one dir, main page]
More Web Proxy on the site http://driver.im/Jump to content

Discrete & Computational Geometry

From Wikipedia, the free encyclopedia
Discrete & Computational Geometry
Disciplinediscrete geometry, computational geometry
LanguageEnglish
Edited byKenneth L. Clarkson, János Pach, Csaba D. Tóth.
Publication details
History1986–present
Publisher
FrequencyQuarterly
0.969 (2020)
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]

Two articles published in Discrete & Computational Geometry, one by Gil Kalai in 1992 with a proof of a subexponential upper bound on the diameter of a polytope[1] and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing,[2] earned their authors the Fulkerson Prize.[3]

References

[edit]
  1. ^ Kalai, Gil (1992). "Upper bounds for the diameter and height of graphs of the convex polyhedra". Discrete & Computational Geometry. 8 (4): 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.
  3. ^ "The Fulkerson Prize". Mathematical Optimization Society. Retrieved 2023-07-10.
[edit]