Library Home || Full Table of Contents || Suggest a Link || Library Help
|Dan Sunday, softSurfer|
|Resources for developing geometry algorithms and computer graphics software: overviews, histories of geometry, a gift shop, and more. The archive of algorithms includes areas of triangles and polygons; lines and distances of a point to a line; fast winding number inclusion of a point in a polygon; intersections of lines, segments, and planes; intersections of rays, segments, planes, and triangles in 3D; distance between lines, segments, and the closest point of approach; bounding containers for polygons, polyhedra, and point sets; the convex hull of a 2D planar point set or polygon; a fast approximate 2D convex hull algorithm; tangents to and between polygons; polyline simplification; and C++ point and vector class. Also available at http://www.softsurfer.com/.|
|Levels:||High School (9-12), College, Research|
|Resource Types:||Link Listings|
|Math Topics:||Algorithms, Higher-Dimensional Geometry, Euclidean Plane Geometry, History and Biography, Computer Science|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.