Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth.

Many problems in discrete geometry arise from questions in computational geometry related to algorithms for analyzing discrete geometric structures. Historically, there have been …

This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner.

Computational topology of graphs on surfaces (É. Colin de Verdière) pdf.

We start with discrete curves and then proceed to discuss several versions of the Cauchy rigidity theorem, the solution of the bellows conjecture and Alexandrov’s various theorems on …

Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects.

Discrete Math describes the subfield of geometry that deals with the interaction between convex sets and lattices in Euclidean space. A major emphasis is on polyhedra within convexity.

Sep 1, 2025 · Discrete mathematical structures include objects with distinct values, like graphs, integers, logic-based statements, etc. To explore these concepts in detail, we begin with the …

Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with …

Mar 11, 2025 · Discrete geometry is field that lies on the edge of traditional geometry and incorporates a touch of combinatorics. It studies discrete sets of points, lines, curves and other …