awesome-computational-geometry

A textbook by Jean-Daniel Boissonnat, Mariette Yvinec, and Herve Bronniman (1998).

A textbook by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars (2008).

An introductory textbook by Franco P. Preparata and Michael I. Shamos (1993).

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).

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).

STOC covers all areas of research within Algorithms and Computation Theory.

Draws some of the brightest minds from industry, academia, and government to discuss innovation in the fields of communication, control, and computing.

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.

A conference held annually since 1997, except for 2008.

An annual symposium.

ACM-SIAM, held annually.

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.

Practice problems for basic concepts in computational geometry.

A course taught by Roberto Tamassia in 2005.

A course in computational geometry.

A course taught by Tamara Mchedlidze and Chih-Hung Liu in 2018.

A course taught by Nicholas Patrikalakis and Takashi Maekawa in 2013.

A course taught by Dave Mount in 2002.

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.

UIUC's large collection and library of geometric software by Jeff Erickson.

A library of computational geometry algorithms for Unity.

A fast and efficient computational geometry library available in C++, C# and Java.

A library of source code for computing in the fields of mathematics, graphics, image analysis, and physics that includes some computational geometry algorithms.

Open-Source, Boost-licensed C# library for geometric computing.

CGViz is a FOSS web app for step-by-step visualizations of many algorithms, designed for exploration, teaching, and creating exportable visuals.

An optimal output-sensitive algorithm to compute the convex hull of a set of points in 2 or 3 dimensions.

The space of possible configurations of an object like a robot.

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.

A sweep line algorithm for generating the Voronoi diagram in O(n log n) time and O(n) space.

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).

An overview of key concepts and results in computational geometry by J. R. Sack, and J. Urrutia (1998).

A handbook by Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth (2017).

Lecture notes from CMSC 754 Computational Geometry at the University of Maryland by David Mount (2002).

Implementations and explanations for a large number of commonly asked questions and common topics in geometric algorithms.

A set of articles on computational geometry.

A set of programming problems using computational geometry.

A set of articles on computational geometry.