Discrete Geometry
Discrete Geometry is a branch of mathematics that studies geometric objects and configurations using discrete structures and combinatorial methods, focusing on properties invariant under finite or countable sets of points, polygons, polyhedra, and their arrangements, in contrast to continuous or differential approaches in geometry.
1.6K
Publications
82.2K
Citations
2.2K
Authors
903
Institutions
Publications per year
2017–2026
122
Variants
Combinatorial Geometry
Parents
1.6K
Algorithms in Combinatorial Geometry.
Jacob E. Goodman, Herbert Edelsbrunner · American Mathematical Monthly · 1989 · 1.8K citations
1–5 of 1.6K
2.2K
University of Illinois Urbana-Champaign, United States
15 publications · 860 citations
14
h-index
12
h-index
12
h-index
8
h-index
7
h-index
1–5 of 2.2K
903

Centre National de la Recherche Scientifique
Paris, France
21 h-index
65 publications
2K citations
Technische Universität Berlin
Berlin, Germany
19 h-index
46 publications
2.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
19 h-index
36 publications
3.8K citations

Hungarian Academy of Sciences
Budapest, Hungary
17 h-index
26 publications
1.7K citations
New York University
New York, United States
16 h-index
24 publications
1.3K citations

Tel Aviv University
Tel Aviv, Israel
16 h-index
24 publications
1.1K citations
Princeton University
Princeton, United States
15 h-index
29 publications
1.8K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
22 publications
756 citations
1–8 of 903
41 publications · 1.8K citations
21
h-index
22 publications · 1.5K citations
18
h-index
Repository · 43 publications · 1.4K citations
18
h-index
Repository · 36 publications · 992 citations
17
h-index
32 publications · 1.4K citations
17
h-index
1–5