Convex Hull
The convex hull of a set of points
is the smallest convex set containing
. Use the slider to set the number of points and drag the resulting locators around to visualize their convex hull.
Contributed by:
Eric W. Weisstein
X
X
X
Show Source Code
|
Download Source Code Notebook
Show Initialization Code
Convex Hull
(
Wolfram
MathWorld
)
"
Convex Hull
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ConvexHull/
Contributed by:
Eric W. Weisstein
Algorithms
Computational Geometry
Computer Graphics
Computers
Voronoi Diagrams
Convex Hull and Delaunay Triangulation
Spanning Tree of Points on Sphere
Parity Entangled Links
Affine Products of Locators
Rotation Point Mandala
Raster Bubble
Voxel Distortion
Projection of Three Orthogonal Planes
Image Compression via the Singular Value Decomposition
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
