A curated list of awesome computational geometry visualizations, libraries, and resources.
Computational geometry is a topic in computer science that focuses on solving problems in geometry.
Applications of computational geometry include computer-aided design, robotics, GIS systems, and computer vision.
The convex hull of a shape is the smallest convex set that contains it.
A website with visualizations of many convex hull algorithms, including gift wrapping, Graham's scan, quickhull, divide and conquer, monotone chain, and Chan's algorithm.
An optimal output-sensitive algorithm to compute the convex hull of a set of points in 2 or 3 dimensions.
A data structure and method for point location with O(n) space and O(log n) query time using triangulation.
A partition of a plane into regions close to a given set of points.
A sweep line algorithm for generating the Voronoi diagram in O(n log n) time and O(n) space.
A method of partitioning k-dimensional space in an efficient way for searches like nearest neighbors.
The space of possible configurations of an object like a robot.
A textbook by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars (2008).
A popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design by Joseph O'Rourke (1998).
An introductory textbook by Franco P. Preparata and Michael I. Shamos (1993).
A textbook by Jean-Daniel Boissonnat, Mariette Yvinec, and Herve Bronniman (1998).
A comprehensive yet accessible introduction to the intermingling of discrete geometry, a relatively new development in pure mathematics, and computational geometry, an emerging area in applications-driven computer science by Satyan L. Devadoss and Joseph O'Rourke (2011).
An interactive introduction to some of the fundamental algorithms of computational geometry with Mathematica by Jim Arlow (2014).
Lecture notes from CMSC 754 Computational Geometry at the University of Maryland by David Mount (2002).
A handbook by Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth (2017).
An overview of key concepts and results in computational geometry by J. R. Sack, and J. Urrutia (1998).
A collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry by Ding-Zhu Du and Frank Hwang (1995).
A software project that provides easy access to efficient and reliable geometric algorithms in the form of a C++ library. This website also has explanations of many of these algorithms.
An extremely efficient, robust, and simple to use C++ 2D/3D oriented computational geometry library.
Open-Source, Boost-licensed C# library for geometric computing.
UIUC's large collection and library of geometric software by Jeff Erickson.
A repository of algorithms based on [The Algorithm Design Manual](https://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1848000693).
A library of source code for computing in the fields of mathematics, graphics, image analysis, and physics that includes some computational geometry algorithms.
A fast and efficient computational geometry library available in C++, C# and Java.
JavaScript library that builds the convex hull of a set of points.
A package for manipulating geometric shapes. Unlike many geometry libraries, S2 is primarily designed to work with spherical geometry, i.e., shapes drawn on a sphere rather than on a planar 2D map. This makes it especially suitable for working with geographic data.
A library of computational geometry algorithms for Unity.
An annual symposium.
An annual international event for the dissemination of new results in the fields of computational and combinatorial geometry. The conference is usually held in a Canadian city sometime in mid-August.
A conference held annually since 1997, except for 2008.
ACM-SIAM, held annually.
STOC covers all areas of research within Algorithms and Computation Theory.
The flagship conference sponsored by the IEEE Computer Society Technical Committee on the Mathematical Foundations of Computing (TCMF) and covers a broad range of theoretical computer science.
Draws some of the brightest minds from industry, academia, and government to discuss innovation in the fields of communication, control, and computing.
Recent submissions to arXiv about computational geometry.
A forum for research in theoretical and applied aspects of computational geometry.
An international open access journal devoted to publishing original research of the highest quality in all aspects of computational geometry.
A set of articles on computational geometry.
A set of articles on computational geometry.
A set of programming problems using computational geometry.
Implementations and explanations for a large number of commonly asked questions and common topics in geometric algorithms.
A course taught by Nicholas Patrikalakis and Takashi Maekawa in 2013.
A course about implementing computational geometry algorithms in C++.
A course in computational geometry.
Practice problems for basic concepts in computational geometry.
A course taught by Roberto Tamassia in 2005.
A course taught by Tao Ju in 2017.
A course taught by Dave Mount in 2002.
A course taught by Subhash Suri in 2021.
A course taught by Jeff Erickson in 2022.
A course taught by Jonathan Shewchuk in 2019.
A course taught by Diane Souvaine in 2022.
A course taught by Tamara Mchedlidze and Chih-Hung Liu in 2018.
A project aimed to record important open problems in computational geometry and related fields.
Documentation for computational geometry algorithms implemented in the Wolfram language.
Documentation for computational geometry algorithms implemented in the Matlab.