Infimaximal frames: A technique for making lines look like segments

International Journal of Computational Geometry and Applications

Volumn 13, Issue 3, 2003, Pages 241-255

  Mehlhorn, Kurt ^a   Seel, Michael ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

CGAL; Infimaximal frames; Nef polyhedra; Plane sweep; Points at infinity

Indexed keywords

EID: 0037490968     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001141     Document Type: Article

References (22)

1. H. Bieri. Nef Polyhedra: A Brief Introduction. Computing Suppl. Springer-Verlag, 10:43-60, 1995.
2. C. Burnikel, S. Funke, and M. Seel. Exact arithmetic using cascaded computation. In Proceedings of the 14th Annual Symposium on Computational Geometry (SCG'98), pages 175-183, 1998.
3. The CGAL home page, wwv.cgal.org.
4. H. Cohen. A Course in Computational Algebraic Number Theory, volume Graduate Texts in Mathematics 138. Springer Verlag, New York Berlin Heidelberg, 1993.
5. H.S.M. Coxeter. Projective geometry. Springer, 2nd ed. 1974. corr. 2nd print. 1994 edition, 1987.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, Berlin, 1997.
7. H. Edelsbrunner and E.P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1):66-104, January 1990.
8. S. Fortune and C. van Wyk. Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Transactions on Graphics, 15:223-248, 1996. preliminary version in ACM Conference on Computational Geometry 1993.
9. M. Karasick, D. Lieber, and L.R. Nackman. Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, 10(1):71-91, January 1991.
10. D.E. Knuth. The Art of Computer Programming, volume Volume 2, Seminumerical Algorithms, 3rd edition. Addison-Wesley, 1998.
11. The LEDA home page. www.mpi-ib.mpg.dt/LEDA.
12. K. Mehlhorn and S. Näher. The implementation of geometric algorithms. In Proceedings of the 13th IFIP World Computer Congress, volume 1, pages 223-231. Elsevier Science B.V. North-Holland, Amsterdam, 1994.
13. K. Mehlhorn and S. Näher. LEDA, A Platform for Combinatorial and Geometric Computing, Cambridge University Press, 1999.
14. W. Nef. Beiträge zur Theorie der Polyeder mit Anwendungen in der Computer-graphik. Herbert Lang & Cie AG, Bern, 1978.
15. T. Ottmann, G. Thiemt, and C. Ullrich. Numerical stability of geometric algorithms. In Derick Wood, editor, Proceedings of the 3rd Annual Symposium on Computational Geometry (SCG '87), pages 119-125, Waterloo, ON, Canada, June 1987. ACM Press.
16. Planar nef polyhedron specification. www.mpi-sb.mpg.di/̃seel/Nef/_polyhedra/.
17. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer, 1985.
18. J.R. Rossignac and M.A. O'Connor. SGC: A dimension-independent model for pointsets with internal structures and incomplete boundaries. In M. J. Wozny, J. U. Turner, and K. Preiss, editors, Geometric Modeling for Product Engineering, pages 145-180. Elsevier Science Publishers B.V., North Holland, 1990.
19. S. Schirra. Precision and robustness in geometric computations. Lecture Notes in Computer Science, 1340:255-287, 1997.
20. J. Stolfi. Oriented projective geometry: a framework for geometric computations. Academic Press, 1991.
21. C.K. Yap. Towards exact geometric computation. In Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG'93), pages 405-419, 1993.
22. C.K. Yap and T. Dubé. The exact computation paradigm. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 452-492. World Scientific, Singapore, 2nd edition, 1995.