Java Applets

The following applets were developed with the Gishur library. More information about Gishur can be found at the Gishur Hompage.

	Geometric Applets using the old visualization engine:
	Fixtures: Fixture Design 1.0 Verification and computation of point fixtures.
	Voronoi Diagrams / Skeletons: Skeleton / MIC 1.1 Calculates the Skeleton and the maximal inscribed circle of a simple polygon. The applet uses the skeleton algorithm by D. T. Lee.
	Visibility Polygons: VIP 2.0 Computes the visibility polygon in optimal time. VIP 1.0 (needs only JDK1.0 capable Browser) Older version of VIP that needs only a JDK 1.0 capable browser. It has an additional step mode.
	Sweep Applets: Segment Intersection Sweep Computation of all k intersection point of n line segments in time O(nlog n+k).* Polygon Intersection Sweep Calculates the intersection of two simple polygons.
	Graph-Applets using the new visualization engine:
	Graph Search Algorithms: Depth First Search Searches a graph in depth-first-order. Breadth First Search Searches a graph in breadth-first-order. Dijkstra Algorithm The well-known Dijkstra-Algorithm for computing shortest paths.

System requirements:
All applets (except VIP 1.0) need a Java JDK1.1 enabled browser. At this time only Microsofts Internet Explorer 4.x (and higher) and Netscape Navigator 4.5 (and higher) support this adequately. Internet Explorer performs better on Windows platforms.