Exact geometric computation in LEDA

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Exact geometric computation in LEDA

Full text

Pdf (155 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the eleventh annual symposium on Computational geometry table of contents

Vancouver, British Columbia, Canada

Pages: 418 - 419

Year of Publication: 1995

ISBN:0-89791-724-3

Authors

C. Burnikel	Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany
J. Könemann	Fachbereich 14, Informatik, Universität des Saarlandes, 66041, Saarbrücken, Germany
K. Mehlhorn	Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany
S. Näher	Martin-Luther-Universität Halle, Fachbereich Mathematik und Informatik, 06099 Halle, Germany
S. Schirra	Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany
C. Uhrig	Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 10, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/220279.220330 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M.O. Benouamer, P. Jaillon, D. Michelucci, and J.- M. Moreau. A "lazy" solution to imprecision in computational geometry. 5th CCCG, pp. 73-78, 1993.
	2	Christoph Burnikel , Kurt Mehlhorn , Stefan Schirra, How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results, Proceedings of the Second Annual European Symposium on Algorithms, p.227-239, September 26-28, 1994
	3	Steven Fortune , Christopher J. Van Wyk, Efficient exact arithmetic for computational geometry, Proceedings of the ninth annual symposium on Computational geometry, p.163-172, May 18-21, 1993, San Diego, California, United States [doi>10.1145/160985.161015]
	4	Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995 [doi>10.1145/204865.204889]
	5	Maurice Mignotte, Mathematics for computer algebra, Springer-Verlag New York, Inc., New York, NY, 1992
	6	C.K. Yap and T. Dube. The exact computation paradigm. In Computing in Euclidean Geometry II, 1995.

CITED BY 13

	Victor Y. Pan , Yanqiang Yu, Certified computation of the sign of a matrix determinant, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.715-724, January 17-19, 1999, Baltimore, Maryland, United States
	Gill Barequet , Stina S. Bridgeman , Christian A. Duncan , Michael T. Goodrich , Roberto Tamassia, Classical computational geometry in GeomNet, Proceedings of the thirteenth annual symposium on Computational geometry, p.412-414, June 04-06, 1997, Nice, France
	Hervé Brönnimann , Mariette Yvinec, Efficient exact evaluation of signs of determinants, Proceedings of the thirteenth annual symposium on Computational geometry, p.166-173, June 04-06, 1997, Nice, France
	Chen Li , Chee Yap, A new constructive root bound for algebraic expressions, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.496-505, January 07-09, 2001, Washington, D.C., United States
	Jörg Schwerdt , Michiel Smid , Stefan Schirra, Computing the minimum diameter for moving points: an exact implementation using parametric search, Proceedings of the thirteenth annual symposium on Computational geometry, p.466-468, June 04-06, 1997, Nice, France
	Jean-Daniel Boissonnat , Jack Snoeyink, Efficient algorithms for line and curve segment intersection using restricted predicates, Proceedings of the fifteenth annual symposium on Computational geometry, p.370-379, June 13-16, 1999, Miami Beach, Florida, United States
	Hervé Brönnimann , Christoph Burnikel , Sylvain Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, Proceedings of the fourteenth annual symposium on Computational geometry, p.165-174, June 07-10, 1998, Minneapolis, Minnesota, United States
	Hervé Brönnimann , Ioannis Z. Emiris , Victor Y. Pan , Sylvain Pion, Computing exact geometric predicates using modular arithmetic with single precision, Proceedings of the thirteenth annual symposium on Computational geometry, p.174-182, June 04-06, 1997, Nice, France
	V. Karamcheti , C. Li , I. Pechtchanski , C. Yap, A core library for robust numeric and geometric computation, Proceedings of the fifteenth annual symposium on Computational geometry, p.351-359, June 13-16, 1999, Miami Beach, Florida, United States
	C. Burnikel , R. Fleischer , K. Mehlhorn , S. Schirra, Efficient exact geometric computation made easy, Proceedings of the fifteenth annual symposium on Computational geometry, p.341-350, June 13-16, 1999, Miami Beach, Florida, United States
	Giuseppe Liotta , France P. Preparata , Roberto Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, Proceedings of the thirteenth annual symposium on Computational geometry, p.156-165, June 04-06, 1997, Nice, France
	Gill Barequet , Christian A. Duncan , Michael T. Goodrich , Stina S. Bridgeman , Roberto Tamassia, GeomNet: Geometric Computing over the Internet, IEEE Internet Computing, v.3 n.2, p.21-29, March 1999
	Alexey Lvov , Ulrich Finkler, Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, November 10-13, 2008, San Jose, California