Convex Hull Algorithms
Library Home || Full Table of Contents || Suggest a Link || Library Help
|An applet that demonstrates some algorithms for computing the convex hull of points in three dimensions. See the points from different viewpoints; see how the Incremental algorithm constructs the hull, face by face; while it's playing, look at it from different directions; see how the gift-wrapping or divide-and-conquer algorithms construct the hull; look at animations of Delaunay triangulation algorithms.|
|Levels:||High School (9-12), College|
|Resource Types:||Web Interactive/Java|
|Math Topics:||Computational Geometry, Convex/Discrete Geometry|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.