[ HOME ] [ UP ] [ CG in C ] [ Great Wall ] [ Polytope ] [ Graham ] [ Quickhull ] [ 3dCH ] [ CH ] [ Caliper ] [ Sweepline ] [ Width+Diameter ] [ Kernel ] [ Shortest ] [ Spiral ] [ Tripod ] [ AGP ] [ Simple ] [ Triangulation ] [ MWT ] [ VD&DT ] [ VD+DT ] [ Skeleton ] [ Gishur ] [ RealDT ] [ Closest ] [ Proximity ] [ Crust ] [ Alpha ] [ Beta ] [ Medial ] [ Beach Line ] [ Higher-Order VD ] [ Dual ] [ MRD ] [ 4D Cube ] [ 4D Polytope ] [ HyperStar ] [ MEC ] [ 3dCH+2dDT ] [ Location ] [ TrapMap ] [ BSP ] [ kd-Tree ] [ Range Tree ] [ PST ] [ Windowing ]

Simple Polygon

Simple Polygon Construction@uwsuper

Construction of a simple polygon from a point set

(Courtesy of http://mcs.uwsuper.edu/sb/425/Prog/simplePoly.html)

Cutting Ear

(Courtesy of http://cgm.cs.mcgill.ca/~godfried/teaching/cg-projects/97/Ian//applet1.html)

Minimal Convex Decomposition of A Simple Polygon by Dynamic Programming

(Courtesy of http://valis.cs.uiuc.edu/~sariel/research/CG/applets/convex_decomp/Default.html)

Simple Polygon Counter

> To play this game, you need a Java compatible browser.

(Courtesy of http://www.geom.uiuc.edu/~burgiel/Java/Ngons/ngons.html)

Polygonization of A Set of Points

(Courtesy of http://www.cs.mcgill.ca/~ktulu/507/)

TOP

[ HOME ] [ UP ] [ CG in C ] [ Great Wall ] [ Polytope ] [ Graham ] [ Quickhull ] [ 3dCH ] [ CH ] [ Caliper ] [ Sweepline ] [ Width+Diameter ] [ Kernel ] [ Shortest ] [ Spiral ] [ Tripod ] [ AGP ] [ Simple ] [ Triangulation ] [ MWT ] [ VD&DT ] [ VD+DT ] [ Skeleton ] [ Gishur ] [ RealDT ] [ Closest ] [ Proximity ] [ Crust ] [ Alpha ] [ Beta ] [ Medial ] [ Beach Line ] [ Higher-Order VD ] [ Dual ] [ MRD ] [ 4D Cube ] [ 4D Polytope ] [ HyperStar ] [ MEC ] [ 3dCH+2dDT ] [ Location ] [ TrapMap ] [ BSP ] [ kd-Tree ] [ Range Tree ] [ PST ] [ Windowing ]

Copyleft (c) 2003-3002, Junhui Deng
Last updated on 12.03.2013