Jump to content

Pitteway triangulation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ashwin (talk | contribs) at 09:01, 16 May 2007 (Stub to start off). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Pitteway triangulation is a subgraph of the Delaunay triangulation. The Pitteway triangulation can be generated from a Voronoi tessellation in the same as a Delaunay triangulation is generated. An edge in PT exists iff it crosses the associated Voronoi hyperplane (edge).

Reference: Spatial Tessellations by Okabe et al.