Computational Geometry Student Projects, 1997
Library Home || Full Table of Contents || Library Help
|Godfried Toussaint, McGill University|
|A variety of student projects: papers presented on the Web, many with Java applets, and available in postscript form. Topics include: Quadrangulations of Planar Sets of Points; The Jordan Curve Theorem for Polygons; The Art Gallery Problem; Ear Cutting; Generating Fractals from Voronoi Diagrams; Constructions with Straight Edge and Collapsing Compass; Melkman's Convex Hull Algorithm for Simple Polygons; The Match-Stick Game; Testing Convexity of Polygons; Intersecting Convex Polygons; Mobility of Objects in Space; Polygonizing Sets of Points (with Valeriu Sitaru); Inserting and Deleting Edges from Triagulations; Polygonizing Sets of Points (with Tony Ruso); Boolean Operations on Simple Polygons.|
|Resource Types:||Courses, Articles, Web Interactive/Java|
|Math Topics:||Computational Geometry|
© 1994- The Math Forum at NCTM. All rights reserved.