Interactive Java Programs ,developed by Anderson Chan
Fractal Java Programs ,developed by Andy Ho

 
 
Interactive Java Programs


Program Description Run the program
Divided polygon into triangules by adding diagonals Triangulation
The smallest convex set containing the points Graham
Partition a plane Voronoi

 
Every Polygon P of n vertices may be divided into triangules by adding diagonals. We will illusrate the idea by the applet called Triangulation. The program is according to the following algorithm.
SIMPLE TRIANGULATION ALGORITHM

 
The Convex Hull of a set of points S is the set of all convex combinations of points of S. In other words, it is the smallest convex set containing the points.

We will show the idea in applet Graham which is according to Graham's Algorithm.

GRAHAM'S ALGORITHM
 
 

convex_flowchart.jpg
 
We will show another idea in applet Incremental which is according to Incremental Algorithm.
how to find the 2 tangent points?
 
INCREMENTAL ALGORITHM
 
 

Let P = {P1, P2,..., Pn} be a set of points in a plane. These are called the sites. Partition the plane by assigning every point in the plane to its nearest site. Voronoi Diagram V(p) is a set of points that have more than one nearest neigbour.

We will demostrate by the applet Voronoi.