Kurt Mehlhorn
Michael Müller
- BDH96.C. Barber, D. Dobkin, and H. Hudhanpaa. The quickhull program for convex hulls. A CM Transactions on Mathematical Software, 22:469-483, 1996. Google Scholar
Digital Library
- BLR90.M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. In Proc. 22nd Annual ACM Symp. on Theory of Computing, pages 73-83, 1990. Google ScholarDigital Library
- CMS93.Kenneth L. Ciarkson, Kurt Mehlhorn, and Raimund Seidel. Four results on randomized incremental constructions. In Computational geometry: theory and applications, volume 3, pages 185-212, Amsterdam, 1993. Elsevier. Google Scholar
- Ede87.H. Edeisbrunner. Algorithms in Combinatorial Geometry. Springer, 1987. Google ScholarDigital Library
- Edm67.J. Edmonds. Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards, 71(B):241-245, 1967.Google Scholar
- FGK+96.Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schrnherr. The CGAL kernel : a basis for geometric computation. In Ming C. Lin and Dinesh Manocha, editors, Applied Computational Geometry : Towards Geometric Engineering : Workshop (FCRC-96; WACG-96), Philadelphia, PA, USA, May 27-28, 1996; selected paper, volume LNCS 1148, pages 191-202S., Berlin, 1996. Springer. Google ScholarDigital Library
- MN95.K. Mehlhorn and S. N~iher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96-102, 1995. Google ScholarDigital Library
- MNS+96.K. Mehlhorn, S. N~er, T. Schilz, S. Schirra, M. Seel, R. Seidel, and Ch. Uhrig. Checking Geometric Programs or Verification of Geometric Structures. In Proc. of the 12th Annual Symposium on Computational Geometry, pages 159-165, 1996. Google ScholarDigital Library
- MNU95.K. Mehlhorn, S. N~er, and C. Uhrig. The LEDA User Manual, 1995.Google Scholar
- MZ94.M. Miiller and J. Ziegler. An implementation of a convex hull algorithm. Technical Report MPI-I-94-105, Max-Planck- Institut fiJr informatik, Saarbrficken, 1994.Google Scholar
- Sch86.A. Schrijver. Theor3' of Linear and Integer Programming. John Wiley and Sons, Chichester, New York, Brisbane, Toronto, Singapore, ! 986. Google ScholarDigital Library
- Yap93.C.K. Yap. Fundamental Problems in Algorithmic Algebra. Princeton University Press, 1993. Google ScholarDigital Library
Index Terms
- A computational basis for higher-dimensional computational geometry and applications
Recommendations
Computational geometry column 51
Can a simple spherical polygon always be triangulated? The answer depends on the definitions of "polygon" and "triangulate".
Define a spherical polygon to be a simple, closed curve on a sphere S composed of a finite number of great circle arcs (also ...
Computational Geometry A Survey
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in ...
Comments