Geometric algorithms

programming method to achieve the best outcome in a mathematical model

triangulation method named after Boris Delaunay

(as a form of proximity search (metric space)) optimization problem of finding the point in a given set that is closest (or most similar) to a given point

database optimized for storing and querying data that represents objects defined in a geometric space

class of problems in combinatorial mathematics

commutative associative binary operation on subsets of an Abelian group (such as Euclidean space)

computer-based description of the shape of geometric objects

concept in computational geometry

the problem of finding the two points with minimum distance from a larger finite set of points

mathematical algorithm to determine the area of a simple polygon

basic shapes represented in vector graphics

line simplification algorithm

the box or hyperrectangle of minimal dimensions that contains the set of interest

polygon that contains a point from which the entire polygon boundary is visible

intersection of a line and a line can be the empty set, a point, or a line

point minimizing the distance to other points

in computer graphics, a closed volume that completely contains the union of the objects in a set

method for creating geometric centroidal tessellations from points

class of algorithms in computational geometry that uses a conceptual sweep line/surface to solve various problems in Euclidean space

smallest rectangle which encloses some planar set of points

Type of geometry processing

The Computational Geometry Algorithms Library (CGAL) is an open source software library of computational geometry algorithms. While primarily written in C++, Scilab bindings and bindings generated with SWIG (supporting Python and Java for now) are also available.

an algorithm used to determine the points needed for rasterizing a circle

Voronoi diagram generation algorithm

dividing a geometric space into discrete cells

representation of a given graph in computational geometry

mathematical abstraction of the real-life notion of visibility

property of a geometric object

sphere that contains a set of objects

intersection of a line and a plane can be the empty set, a point, or a line

Computation method in geometry

method of calculating ray-triangle intersections in 3D space