Interval methods for kinetic simulations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Interval methods for kinetic simulations

Full text

Pdf (1.12 MB)

Source

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

Miami Beach, Florida, United States

Pages: 255 - 264

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Leonidas J. Guibas	Graphics Lab., Computer Science Dept., Stanford University, Stanford, CA
Menelaos I. Karavelas	Graphics Lab., Computer Science Dept., Stanford University, Stanford, CA

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): 4, Downloads (12 Months): 24, Citation Count: 2

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/304893.304978 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	G. Alefeld and J. Herzberger. Introduction to interval computations. Academic Press, New York, 1983.
	2	Julien Basch , Leonidas J. Guibas , John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
	3	J. L. Bentley and T. Ottman. Algorithms for reporting and counting geometria intersections. IEEE Trans. on Computers, C-28(9):643-467, Sept. 1973.
	4	Leonidas J. Guibas, Kinetic data structures: a state of the art report, Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective, p.191-209, August 1998, Houston, Texas, United States
	5	N. Jacobson. Basic Algebra L W. H. Freeman, New York, 2nd edition, 1985.
	6	M. A. Jenkins, Algorithm 493: Zeros of a Real Polynomial [C2], ACM Transactions on Mathematical Software (TOMS), v.1 n.2, p.178-189, June 1975 [doi>10.1145/355637.355643]
	7	A. G. Khovanski#. Fewnomials, volume 88 of Translations of Mathematical Monographs. Americal Mathematical Society, Providence, Rhode Island, 1991.
	8	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	9	M. Lang and B.-C. Frenzel. Polynomial root finding. IEEE Signal Processing Letters, 1994.
	10	J. Peetre. Approximation of norms. J. Approx. Theory, 3(3) :243-260, 1970.
	11	W. H. Press, S. A. Teukolsky, W. T. Vettering, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, Cambridge, 2nd edition, 1992.
	12	H. Ratschek and J. Rokne. Computer Methods for the Range of Functions. John Wiley & Sons, New York, 1984.
	13	L. N. Trefethen and D. Bau, III. Numerical Linear Algebra. SIAM, 1997.
	14	R. E. Zippel. Effective polynomial computation. Kluwer Academic Publishers, Boston, 1993.

CITED BY 2

	Leonidas Guibas , Daniel Russel, An empirical comparison of techniques for updating Delaunay triangulations, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
	Daniel Russel , Menelaos I. Karavelas , Leonidas J. Guibas, A package for exact kinetic data structures and sweepline algorithms, Computational Geometry: Theory and Applications, v.38 n.1-2, p.111-127, September, 2007