algorithm Directory Reference

Directory dependency graph for algorithm:

Files
	arrangement.hpp
	Planar subdivision induced by a set of one-dimensional shapes.
	bitmatrix.hpp
	One bit per cell over a fixed rectangular window of the integer grid.
	closestpair.hpp
	Closest pair of points by divide and conquer.
	convexhull.hpp
	Convex hull algorithms built from Pangolin point predicates.
	graph.hpp
	Simple undirected graph with hashable vertices.
	intersections.hpp
	Segment intersection and crossing algorithms.
	intervaltree.hpp
	Mutable one-dimensional interval tree over projected bounded shapes.
	mindisk.hpp
	Smallest enclosing disk algorithms.
	polyominoes.hpp
	Enumeration of polyominoes as Pangolin polygons.
	redbluesweep.hpp
	Bichromatic (red-blue) boundary contact by one combined plane sweep.
	shapetree.hpp
	Static 2D shape tree over any bounded shape (one exposing bbox()).
	sortpoints.hpp
	Angular sorting of points around a center.
	triangulation.hpp
	Mutable triangulation of a point set or simple polygon.
	xysweep.hpp
	Bounding-box sweep over pairs of segments.