Look: A lazy object-oriented kernel design for geometric computation

Computational Geometry: Theory and Applications

Volumn 22, Issue 1-3, 2002, Pages 99-118

  Funke, Stefan ^a   Mehlhom, Kurt ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational geometry; Exact computation; Software design

Indexed keywords

EID: 33750697671     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00046-3     Document Type: Article

References (15)

1. N. Amenta, M. Bern, D. Eppstein, The crust and the -skeleton: Combinatorial curve reconstruction, in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998.
2. J.-D. Boissonat, J. Snoeyink, Efficient algorithms for line and curve segment intersection using restricted predicates, in: Proc. 15th Annual ACM Symposium on Computational Geometry, 1999.
3. H. Brönnimann, C. Burnikel, S. Pion, Interval analysis yields efficient arithmetic filters for computational geometry, in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998.
4. The CGAL project http://www.cs.uu.nl/CGALJ.
5. C. Burnikel, R. Fleischer, K. Mehlhorn, S. Schirra, Efficient exact geometric computation made easy, in: Proc. 15th Annual ACM Symposium on Computational Geometry, 1999.
6. C. Burnikel, S. Funke, M. Seel, Exact geometric computation using cascading, preliminary version in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998; also: International Journal on Computational Geometry and Applications, to appear.
7. O. Devillers, P. Preparata, Further results on arithmetic filters for geometric predicates, Computational Geometry: Theory and Applications 13 (2) (1999) 141-148.
8. R. A. Dwyer, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Algorithmica 2 (1987)137-151.
9. S. Fortune, Vertex-rounding a three-dimensional polyhedral subdivision, in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998.
10. S. Fortune, C. van Wyk, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Trans. Graphics 15 (3) (1996) 223-248.
11. S. Funke, K. Mehlhorn, S. Näher, Structural filtering-A paradigm for efficient and exact geometric programs, in: Proc. 11th Canadian Conference on Computational Geometry, 1999.
12. IEEE standard 754-1985 for binary floating-point arithmetic; reprinted in SIGPLAN 22 (2) (1987) 9-25.
13. M. Karasick, D. Lieber, L. Nackmann, Efficient Delaunay triangulation using rational arithmetic, ACM Transactions on Graphics 10(1) (1991)71-91.
14. The LEDA homepage http://www.mpi-sb.mpg.de/LEDAJ.
15. C.K. Yap, T. Dube, The exact computation paradigm, in: D. Du, F. Hwang (Eds.), Computing in Euclidean Geometry, 2nd edition, World Scientific Press, Singapore, 1995, pp. 452-492.