-
Notifications
You must be signed in to change notification settings - Fork 4
Manipulation :: Algorithms
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data (pdf, academic paper)
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points (called seeds, sites, or generators) is specified beforehand, and for each seed there is a corresponding region consisting of all points closer to that seed than to any other. These regions are called Voronoi cells. Wikipedia
Voronoi Diagrams and a Day at the Beach
In mathematics and computational geometry, a Delaunay triangulation for a set P of points in a plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation; they tend to avoid skinny triangles. The triangulation is named after Boris Delaunay for his work on this topic from 1934. [Wikipedia] (https://en.wikipedia.org/wiki/Delaunay_triangulation)