Algebraic methods and arithmetic filtering for exact predicates on circle arcs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic methods and arithmetic filtering for exact predicates on circle arcs

Full text

Pdf (808 KB)

Source

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

Clear Water Bay, Kowloon, Hong Kong

Pages: 139 - 147

Year of Publication: 2000

ISBN:1-58113-224-7

Authors

Olivier Devillers	INRIA, BP 93, 06902 Sophia Antipolis cedex, France
Alexandra Fronville	INRIA, BP 93, 06902 Sophia Antipolis cedex, France
Bernard Mourrain	INRIA, BP 93, 06902 Sophia Antipolis cedex, France
Monique Teillaud	INRIA, BP 93, 06902 Sophia Antipolis cedex, France

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): 14, Citation Count: 4

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/336154.336194 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	Jean-Daniel Boissonnat , Franco P. Preparata, Robust Plane Sweep for Intersecting Segments, SIAM Journal on Computing, v.29 n.5, p.1401-1421, March 2000 [doi>10.1137/S0097539797329373]
	2	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 [doi>10.1145/304893.304991]
	3	J-D. Boissonnat and A. Vigneron. Elementary algorithms for reporting intersections of curve segments. Rapport de recherche 3825, INRIA, 1999.
	4	Laurent Busé , Mohamed Elkadi , Bernard Mourrain, Generalized resultants over unirational algebraic varieties, Journal of Symbolic Computation, v.29 n.4-5, p.515-526, April/May 2000 [doi>10.1006/jsco.1999.0304]
	5	The CGAL Reference Manual, 2000. Release 2.1.
	6	D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer-Verlag, New York, NY, 1992.
	7	Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Exact predicates for circle arcs arrangements. Research Report 3826, INRIA, 1999. http://www.inria.fr/RRRT/RR-3826.
	8	J. Dixmier. Quelques aspects de ta th(~orie des invariants. Gazette des mathdmatiques, 43:39-64, 1990.
	9	M. Elkadi ancl B. Mourrain. Some applications of bezoutians in effective algebraic geometry. Rapport de Recherche 3572, INRIA, 1998.
	10	Ioannis Z. Emiris , Bernard Mourrain, Matrices in elimination theory, Journal of Symbolic Computation, v.28 n.1-2, p.3-44, July/Aug. 1999 [doi>10.1006/jsco.1998.0266]
	11	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	12	J. P.S. Kung and G-C. Rota. The invariant theory of binary forms. Bulletin (New Series) of the American Mathematical Society, 10(1):27-85, 1984.
	13	Giuseppe Liotta , Franco P. Preparata , Roberto Tamassia, Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design, SIAM Journal on Computing, v.28 n.3, p.864-889, Feb. 1999 [doi>10.1137/S0097539796305365]
	14	B. Mourrain and N. Stolfi. The Hilbert series of invariants of Sl,~. In G. Jacob, N.E. Oussous, and S. Steinberg, editors, IMACS SC'93, pages 89-96, Lille (France), June 1993.
	15	S. Pion. De la gdomdtrie algorithmique au calcul gdomdtrique. Th~se de doctorat en sciences, Universit(~ de Nice-Sophia Antipolis, France, 1999.
	16	S. Pion. Interval arithmetic: an efficient implementation and an application to computational geometry. In Workshop on Applications of Interval Analysis to systems and Control, pages 99-110, 1999.
	17	Bernd Sturmfels, Algorithms in invariant theory, Springer-Verlag New York, Inc., New York, NY, 1993
	18	J.Y. Uspensky. Theory of equations. Mac Graw Hill, 1948.
	19	H. Weyl. The Classical Groups, their invariants and representations. Princeton University Press, 1939.
	20	Chee-Keng Yap, Towards exact geometric computation, Computational Geometry: Theory and Applications, v.7 n.1-2, p.3-23, Jan. 1997 [doi>10.1016/0925-7721(95)00040-2]
	21	Chee Keng Yap, Fundamental problems of algorithmic algebra, Oxford University Press, Inc., New York, NY, 1999

CITED BY 4

	Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert, Complete, exact, and efficient computations with cubic curves, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
	Shankar Krishnan , Mark Foskey , Tim Culver , John Keyser , Dinesh Manocha, PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation, Proceedings of the seventeenth annual symposium on Computational geometry, p.274-283, June 2001, Medford, Massachusetts, United States
	Elmar Schömer , Nicola Wolpert, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry: Theory and Applications, v.33 n.1-2, p.65-97, January 2006
	Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert, Exact, efficient, and complete arrangement computation for cubic curves, Computational Geometry: Theory and Applications, v.35 n.1, p.36-73, August 2006