PRODUCTS
Mathematica
Mathematica for Students
Mathematica for the Classroom
grid
Mathematica
web
Mathematica
Mathematica Player
(free download)
Mathematica Player Pro
Wolfram
Workbench
Mathematica
Applications
PURCHASE
Online Store
Other Ways to Buy
Volume & Site Licensing
Contact Sales
Software
Service
Upgrades
Training
Books
FOR USERS
All User Resources
Product Registration
Technical Support
Customer Service
Developer Support
Does My Site Have a License?
Free Seminars
Certified Training
Custom Group Seminars
Documentation & Examples
Tutorial Screencasts
Video Gallery
Demonstrations Project
Education Portal
Student Resources
COMPANY
About Wolfram Research
News & Events
Wolfram Blog
Employment Opportunities
History of
Mathematica
Stephen Wolfram's Home Page
Contact Us
OUR SITES
Demonstrations Project
MathWorld
Integrator
Wolfram Functions Site
Wolfram Blog
Mathematica Journal
Wolfram Library Archive
Wolfram
Tones
Wolfram Science
Stephen Wolfram
DOCUMENTATION CENTER SEARCH
Computational Geometry Package
>
Computational Geometry
Package Symbol
Computational Geometry Package
Tutorials »
|
VoronoiDiagram
DelaunayTriangulationQ
See Also »
|
Computational Geometry Package
More About »
DelaunayTriangulation
DelaunayTriangulation[{{
x
1
,
y
1
}, {
x
2
,
y
2
},
...
}]
yields the planar Delaunay triangulation of the points
{{
x
1
,
y
1
},
...
}
.
MORE INFORMATION
To use
DelaunayTriangulation
, you first need to load the
Computational Geometry Package
using
Needs
["ComputationalGeometry`"]
.
The Delaunay triangulation is represented by a vertex adjacency list, one entry for each unique point
{
x
i
,
y
i
}
indicating the adjacent vertices in counterclockwise order.
SEE ALSO
VoronoiDiagram
DelaunayTriangulationQ
TUTORIALS
Computational Geometry Package
MORE ABOUT
Computational Geometry Package
© 2008 Wolfram Research, Inc.
