| LEP: GEOMLEP - A Geometry LEDA Extension Package |
- This LEP provides several algorithms and data structures related to Computational Geometry.
|
|
|
-
If you want to get update information concerning this package please contact
matthias_baesken@yahoo.de.
|
|
Matthias Bäsken
Universität Trier Fachbereich IV - Informatik 54286 Trier Germany email: matthias_baesken@yahoo.de |
-
The GEOMLEP (Geometry LEDA Extension Package) package
consists of a
number of algorithms and data structures from
the field of Computational Geometry that complete and enhance the
algorithms and data structures
provided by the LEDA library. GEOMLEP also provides additional
classes for visualization that can
be used together with the GeoWin visualization tool of LEDA.
- Two-dimensional Alpha shapes
- a class for advanced point sets; this class is derived from the LEDA class and provides additional search operations
- Two-dimensional static point sets based on kd-trees
- a number of 2d geometry algorithms like convex hull, clustering using the minimum spanning tree, halfplane intersections and local minimum weight triangulations
- a collection of special 3d geometry predicates using multi-level filtering techniques
- Three-dimensional static point sets based on kd-trees
- an implementation of 3d convex hull combining Quickhull and incremental space sweep; this is usually faster than the incremental space sweep of LEDA
- a 3d simplicial complex class; it is used to store 3d triangulations of point sets
- a number of algorithms for computing 3d triangulations and 3d Delaunay triangulations of point sets and related data structures
- 3d terrain triangulations
- a number of 2d point data types, predicates and traits classes that are especially useful when used together with the GLGP (Generic LEDA Geometry Package)
- a class for writing 3d output in VRML format
The current version of GEOMLEP includes:
|
|
|
back to the LEDA EP index page