Convex Hull Algorithms
|
|
| Audience/Grade: | College Freshman-Professional Development 0-Continuing Education |
| Discipline(s): |
Computer Science |
| Special Topic(s): | |
| Learning Resource Type: |
Teaching - Simulation |
| Media Type: |
Document |
| Author(s): |
Tim Lambert |
| Publisher(s): |
Tim Lambert |
| Description: | 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. |
| Rating: |
|
| Related Resources | |
| Keywords: | convex hull |
| Usage Tip | |
| Related ABET Criteria: |
(a) Apply mathematics, science, and engineering |
| Use of Resource: |
High+School+%289-12%29 This site from Australia is only up during their workday. Obtained from Math Forum. College |
| Difficulty: |
Medium Unknown |
| Interactivity Level: |
Medium |
| Version Info | |
| Publication Date: | November 1999 |
| Platform/Format: |
WWW |
| Cost: |
Free |
| Download URL: | http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html |
| Copyright and Use Restrictions: |
Copyright+1999 |
| Metadata: |
IEEE LOM Record |
| Collection: |
NEEDS
|
