The nature and meaning of perturbations in geometric computing

16Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This note addresses some fundamental questions concerning perturbations as they are used in computational geometry: How does one define them? What does it mean to compute with them? How can one compute with them? Is it sensible to use them? We define perturbations to be curves, point out that computing with them amounts to computing with limits. and (re)derive some methods of computing with such limits automatically. In principle a line can always be used as a perturbation curve. We discuss a generic method for choosing such a line that is applicable in many situations.

Cite

CITATION STYLE

APA

Seidel, R. (1994). The nature and meaning of perturbations in geometric computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 3–17). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_127

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free