Discrete & Computational Geometry

{{Infobox journal

| title = Discrete & Computational Geometry

| cover = DiscreteCG.jpg

| abbreviation = Discrete Comput. Geom.

| discipline = Discrete geometry, computational geometry

| editor = {{nowrap|1=Kenneth L. Clarkson,}} {{nowrap|1=János Pach,}} {{nowrap|1=Csaba D. Tóth.}}

| publisher = Springer

| frequency = Quarterly

| history = 1986–present

| impact = 0.969

| impact-year = 2020

| url = https://www.springer.com/mathematics/numbers/journal/454

| ISSN = 0179-5376

| eISSN = 1432-0444

| CODEN = DCGEER

| LCCN = 90656510

| OCLC =

}}

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

Notable articles

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{{cite journal | last1 = Kalai | first1 = Gil | authorlink = Gil Kalai | year = 1992 | title = Upper bounds for the diameter and height of graphs of the convex polyhedra | url = | journal = Discrete & Computational Geometry | volume = 8 | issue = 4| pages = 363–372 | doi=10.1007/bf02293053| doi-access = free }} and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing,{{cite journal | last1 = Ferguson | first1 = Samuel P. | year = 2006 | title = Sphere Packings, V. Pentahedral Prisms | url = | journal = Discrete & Computational Geometry | volume = 36 | issue = | pages = 167–204 | doi=10.1007/s00454-005-1214-y| doi-access = free }} earned their authors the Fulkerson Prize.{{cite web|url=https://www.mathopt.org/?nav=fulkerson|title=The Fulkerson Prize|publisher=Mathematical Optimization Society|access-date=2023-07-10}}

References

{{Reflist}}