discrete geometry

Contains a proof via a more general theorem in discrete geometry.

A long-standing topic in discrete geometry is tiling of the plane.

Pach's research is focused in the areas of combinatorics and discrete geometry.

The McMullen problem is an open problem in discrete geometry.

His research spans the areas of formal languages, programming language semantics and discrete geometry.

His work is mostly in the areas of number theory, combinatorics and discrete geometry, including graph theory.

We should note that combinatorial geometry is an old fashioned name for discrete geometry.

In the context of discrete geometry, Beck's theorem may refer to several different results, two of which are given below.

Digital geometry heavily overlaps with discrete geometry and may be considered as a part thereof.

It should not be confused with Discrete geometry (Combinatorial geometry).

This transform uses discrete geometry in order to dispatch information onto a discrete geometrical support.

Harborth's research ranges across the subject areas of combinatorics, graph theory, discrete geometry, and number theory.

Robert (Bob) Connelly is a mathematician specializing in discrete geometry and rigidity theory.

Helly's theorem is a basic result in discrete geometry describing the ways that convex sets may intersect each other.

Founded in 1986, the journal publishes articles on in discrete geometry and computational geometry.

In Discrete geometry he is remembered for Sylvester's Problem and a result on the orchard problem.

There remain many connections with geometric and topological combinatorics, which themselves can be viewed as outgrowths of the early discrete geometry.

Lectures on Discrete Geometry.

Geometric combinatorics is related to convex and discrete geometry, in particular polyhedral combinatorics.

For an alternative definition of abstract convexity, more suited to discrete geometry, see the 'convex geometries' associated with antimatroids.

Projective, convex and discrete geometry are three sub-disciplines within present day geometry that deal with these and related questions.

G. Hemion, A discrete geometry: speculations on a new framework for classical electrodynamics; Int.

Following these sequences and their length bounds have also become a standard tool in discrete geometry and in the analysis of geometric algorithms.

In discrete geometry, the original orchard-planting problem asks for the maximum number of 3-point lines attainable by a configuration of points in the plane.

He has authored over 200 papers, mostly in discrete geometry, an area in which he is particularly well known for various meticulous classification theorems.