Stefan Funke
Kurt Mehlhorn
- 1.N. Amenta, M. Bern, D. Eppstein: The Crust and the/3- Skeleton: Combinatorial Curve Reconstruction, (Proceedings of the 14th Symposium on Computational Geometry 1998, ACM Press)]] Google Scholar
Digital Library
- 2.J.-D. Boissonat, J. Snoeyink: Efficient algorithms for line and curve segment intersection using restricted predicates, (Prooceedings of the 15th Symposium on CG 1999, ACM Press)]] Google ScholarDigital Library
- 3.H. Br6nnimann, C. Bumikel, S. Pion: Interval Analysis Yields Efficient Arithmetic Filters for Computational Geometry, (Proceedings of the 14th Symposium on CG 1998, ACM Press)]] Google ScholarDigital Library
- 4.The CGAL project ht tp: //www. cs. uu. nl/CGAL/]]Google Scholar
- 5.C. Bumikel, R. Fleischer, K. Mehlhom, S. Schirra: Efficient Exact Geometric Computation Made Easy, (Proceedings of the 15th Symposium on CG 1999, ACM Press)]] Google ScholarDigital Library
- 6.C. Bumikel, S. Funke, M. Seel: Exact Geometric Computation using Cascading, (to appear in International Journal on Computational Geometry and Applications, preliminary version in Proceedings of the 14th Symposium on CG 1998, ACM Press)]] Google ScholarDigital Library
- 7.O. Devillers, P. Preparata: A Probabilistic Analysis of the Power of Arithmetic Filters, (Computational Geometry: Theory and Applications, Vol. 13, No.2, 1999 )]] Google ScholarDigital Library
- 8.R.A. Dwyer: A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations, (Algorithmica (1987), 2)]]Google Scholar
- 9.S. Fortune: Vertex-rounding a three-dimensional polyhedral subdivision, (Proceedings of the 14th Symposium on CG 1998, ACM press)]] Google ScholarDigital Library
- 10.S. Fortune, C. van Wyk: Static analysis yields efficient exact integer arithmetic for computational geometry, (ACM Trans. Graphics, 15(3), pp. 223-248, July 1996).]] Google ScholarDigital Library
- 11.S. Funke, K. Mehlhom, S.N/iher: Structural Filtering- A Paradigm for Efficient and Exact Geometric Programs, (Proeeedings of the 11 th Canadian Conference on CG 1999)]]Google Scholar
- 12.IEEE standard 754-1985 for binaryfloating-point arithmetic, reprinted in SIGPLAN 22, 2:9-25, 1987]]Google Scholar
- 13.M. Karasick, D. Lieber, L. Nackmann: Efficient Delaunay Triangulation using rational arithmetic, (ACM Transactions on Graphics, 10(1):7 I-91, 1991)]] Google ScholarDigital Library
- 14.The LEDA homepage http://www.mpi- sb.mpg.de/LEDA/]]Google Scholar
- 15.S. Schirra: A case study on the cost of geometric computing, (Proe. ALENEX99, 1999)]] Google ScholarDigital Library
- 16.C. K. Yap, T. Dube: The exact computation paradigm, (In D. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 452-492. World Scientific Press, 1995.2nd edition.)]]Google ScholarCross Ref
Index Terms
- Look — a Lazy Object-Oriented Kernel for geometric computation
Recommendations
What Is Object-Oriented Programming?
The meaning of the term 'object oriented' is examined in the context of the general-purpose programming language C++. This choice is made partly to introduce C++ and partly because C++ is one of the few languages that supports data abstraction, object-...
Object-oriented dataflow
VL '95: Proceedings of the 11th International IEEE Symposium on Visual LanguagesIn our efforts to develop an object-oriented visual programming language, the dataflow model of computation is extended from its traditional functional model to an object-oriented model. It is argued that the concept of subroutine in the object-oriented ...
Comments