Gishur is a java class library. The main goal of gishur is to provide a platform independent, object oriented, flexible and efficient framework to implement and visualize geometric algorithms.
Although java programs for language design reasons can never be as run time efficient as C programs, Gishur is trimmed to be efficient. The choice of java offers some major advantages over C. Most significant are Java's platform independence and it's object oriented design. Moreover, there is substantial hope that the run time gap between java and conventional C compilers will become smaller in the future.
Gishur provides a variety of basic data structures, geometric objects and algorithms combined with a flexible core visualization environment.
The current version 2.5 of Gishur is based on Java 1.1. Probably I will switch to Java 2 when it becomes more common. In addition to basic data structures and methods the algorithm library contains more complex algorithms including the computation of the visibility polygon and skeleton (medial axis) of simple polygons, segment intersection sweep and polygon intersection sweep. Just look at the samples page.
Gishur consists of several packages with different functionality:
Further data types and algorithms are integrated, the existing ones are improved and the documentation is revised.
|Demo-Applets / Applications:
You can try some demo applets showing the power of Gishur at the Java-Applets page.
The Gishur API Documentation is available online [English/German].
To develop your own applets or applications with Gishur execute the following steps:
If you are writing applets or applications with Gishur, please tell me your experience and send comments to firstname.lastname@example.org. You can also contact me, if you are interested in parts of the source code.
Gishur is simple. Soon I will put some demo-applets here to demonstrate this. That far
please contact me, if you are interested in programming with Gishur.
last modified 30/03/2000, (c) 1999 by Lupinho.