LEDA: a platform for combinatorial and geometric computing | 615 | 87.19 | 1999 |
Checking geometric programs or verification of geometric structures | 27 | 2.47 | 1999 |
A computational basis for higher-dimensional computational geometry and applications | 2 | 0.36 | 1997 |
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time | 9 | 0.75 | 1997 |
Lower bounds for set intersection queries | 4 | 0.54 | 1995 |
Exact geometric computation in LEDA | 34 | 2.89 | 1995 |
Maintaining dynamic sequences under equality-tests in polylogarithmic time | 9 | 0.92 | 1994 |
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures | 39 | 3.93 | 1992 |
k Versus k+1 index registers and modifiable versus non-modifiable programs | 0 | 0.34 | 1992 |
Selected Topics from Computational Geometry, Data Structures and Motion Planning | 0 | 0.34 | 1992 |