Delaunay triangulation

Show Summary Details

Quick Reference

A recursive algorithm for splitting an area into triangles that ensures that the circle circumscribing the vertices of a triangle contains the vertices of no other triangle within it. This avoids long thin triangles, for example. See also triangulation.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.