Discrete and Computational Geometry

Aims & Scope

Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role.

It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.6
2024	0.60

SJR (SCImago Journal Rank)

Year	Value
2024	0.600

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	75

Journal Rank

Year	Value
2024	9671

Journal Citation Indicator

Year	Value
2024	298

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Topological Persistence and Simplification

  Citation: 1143

  Authors:

• Computing Persistent Homology

  Citation: 1041

  Authors: Afra, Gunnar

• Stability of Persistence Diagrams

  Citation: 755

  Authors: David, Herbert, John

• Applications of random sampling in computational geometry, II

  Citation: 595

  Authors: Kenneth L., Peter W.

• Surface Reconstruction by Voronoi Filtering

  Citation: 472

  Authors: N., M.

• É›-nets and simplex range queries

  Citation: 450

  Authors: David, Emo

• Triangulating a simple polygon in linear time

  Citation: 370

  Authors: Bernard

• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

  Citation: 368

  Authors: David, Komei

• The Honeycomb Conjecture

  Citation: 368

  Authors: T. C.

• On sparse spanners of weighted graphs

  Citation: 367

  Authors: Ingo, Gautam, David, Deborah, José

---