In computational geometry, the diameter of a finite set of points or of a polygon is its diameter as a set, the largest distance between any two points...

and sets include: Angular diameter, how large a circle or sphere appears in a field of view Diameter (computational geometry), the problem of computing...

computing diameters in higher-dimensional Euclidean spaces have also been studied in computational geometry; see diameter (computational geometry). In differential...

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 and another...

In geometry, a diameter of a circle is any straight line segment that passes through the centre of the circle and whose endpoints lie on the circle. It...

theory and computational technique. In the 20th century, algebraic geometry split into several subareas. The mainstream of algebraic geometry is devoted...

Absolute geometry Affine geometry Algebraic geometry Analytic geometry Birational geometry Complex geometry Computational geometry Conformal geometry Constructive...

Spherical geometry or spherics (from Ancient Greek σφαιρικά) is the geometry of the two-dimensional surface of a sphere or the n-dimensional surface of...

In geometry, direction, also known as spatial direction or vector direction, is the common characteristic of all rays which coincide when translated to...

methods—differential geometry, algebraic geometry, computational geometry, algebraic topology, discrete geometry (also known as combinatorial geometry), etc.—or...

In metric geometry and computational geometry, a minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which...

Riemannian geometry is the branch of differential geometry that studies Riemannian manifolds, defined as smooth manifolds with a Riemannian metric (an...

mathematics, hyperbolic geometry (also called Lobachevskian geometry or Bolyai–Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate...

foundation of most modern fields of geometry, including algebraic, differential, discrete and computational geometry. Usually the Cartesian coordinate system...

In geometry, a straight line, usually abbreviated line, is an infinitely long object with no width, depth, or curvature, an idealization of such physical...

Elliptic geometry is an example of a geometry in which Euclid's parallel postulate does not hold. Instead, as in spherical geometry, there are no parallel...

In mathematics, affine geometry is what remains of Euclidean geometry when ignoring (mathematicians often say "forgetting") the metric notions of distance...

In geometry, two geometric objects are perpendicular if they intersect at right angles, i.e. at an angle of 90 degrees or π/2 radians. The condition of...

"Quadrilateral meshing by circle packing", International Journal of Computational Geometry and Applications, 10 (4): 347–360, arXiv:cs.CG/9908016, doi:10...

Synthetic geometry (sometimes referred to as axiomatic geometry or even pure geometry) is geometry without the use of coordinates. It relies on the axiomatic...

With the advent of the computer, new disciplines such as computational geometry or digital geometry deal with geometric algorithms, discrete representations...

In geometry, a line segment is a part of a straight line that is bounded by two distinct endpoints (its extreme points), and contains every point on the...

Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry, Elements...

link diameter is two. Maheshwari, Anil; Sack, Jörg-Rüdiger; Djidjev, Hristo N. (2000), "Link distance problems", Handbook of Computational Geometry, North-Holland...

Hull Area and Universal Cover Problems", International Journal of Computational Geometry & Applications, 23 (3): 197–212, arXiv:1101.5638, doi:10.1142/S0218195913500076...

non-Euclidean geometry consists of two geometries based on axioms closely related to those that specify Euclidean geometry. As Euclidean geometry lies at the...

combined with increasing computational power, extended the decimal representation of π to many trillions of digits. These computations are motivated by the...

In computational geometry, the method of rotating calipers is an algorithm design technique that can be used to solve optimization problems including finding...

List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects...

Absolute geometry is a geometry based on an axiom system for Euclidean geometry without the parallel postulate or any of its alternatives. Traditionally...