Explore: Geometric Algorithms

algorithms (also known as force-directed algorithms or spring-based algorithm) Spectral layout Network analysis Link analysis Girvan–Newman algorithm:

Geometric modeling is a branch of applied mathematics and computational geometry that studies methods and algorithms for the mathematical description of

of algorithms that can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and

breakthrough in the computational complexity of geometric algorithms when Shamos and Hoey presented algorithms for line segment intersection in the plane in

and geometric algorithms. Sona drawings can be classified by the algorithms used for their construction. Paulus Gerdes identified six algorithms, most

geographic information systems, a geometric primitive (or prim) is the simplest (i.e. 'atomic' or irreducible) geometric shape that the system can handle

similar curve with fewer points. It was one of the earliest successful algorithms developed for cartographic generalization. It produces the most accurate

problems can be solved with grid-based algorithms that overlay a grid on top of configuration space, or geometric algorithms that compute the shape and connectivity

computer-assisted art. Roman Verostko argues that Islamic geometric patterns are constructed using algorithms, as are Italian Renaissance paintings which make

(Las Vegas algorithms, for example Quicksort), and algorithms which have a chance of producing an incorrect result (Monte Carlo algorithms, for example