(Enter summary)
Abstract: . This article defines input perturbations so that an algorithm designed under certain restrictions
on the input can execute on arbitrary instances. A syntactic definition of perturbations is proposed and
certain properties are specified under which an algorithm executed on perturbed input produces an output
from which the exact answer can be recovered. A general framework is adopted for linear perturbations,
which are efficient from the point of view of worst-case complexity. The deterministic ... (Update)
Context of citations to this paper: More
...longer present in the perturbed input. For a review of perturbation schemes, see Emiris and Canny [22] Yap [64] and Emiris, Canny and Seidel [23]. The above methods give the implementer two rather unsatisfactory choices: find an approximate solution to the original problem...
Cited by: More
Probabilistic Algorithms for Efficient Grasping and Fixturing - Marek Teichmann Bud
(Correct)
Berry-Esseen Bounds for the Number of Maxima . . . - Bai (2003)
(Correct)
Berry-Esseen bounds for the number of maxima in planar regions - Bai
(Correct)
Similar documents (at the sentence level):
53.0%: Efficient Perturbations for Handling Geometric Degeneracies - Emiris, Canny, Seidel (1994)
(Correct)
35.4%: Sparse Elimination and Applications in Kinematics - Emiris (1994)
(Correct)
Active bibliography (related documents): More All
1.0: A Complete Implementation for Computing General Dimensional.. - Emiris (1995)
(Correct)
0.5: A General Approach To Removing Degeneracies - Emiris, Canny (1991)
(Correct)
0.3: Robust Geometric Computation - Yap (1997)
(Correct)
Similar documents based on text: More All
0.6: An Efficient Approach to Removing Geometric Degeneracies.. - Emiris, al. (1992)
(Correct)
0.4: Variable Elimination for Reliable Parallel Robot Calibration - Daney, Emiris
(Correct)
0.3: A General Solver Based on Sparse Resultants: Numerical Issues and .. - Emiris (1997)
(Correct)
Related documents from co-citation: More All
5: Output-sensitive results on convex hulls (context) - Chan - 1995
5: Symbolic treatment of geometric degeneracies (context) - Yap - 1990
5: Simulation of simplicity: a technique to cope with degenerate cases in geometric..
- Edelsbrunner, Mucke - 1990
BibTeX entry: (Update)
I. Z. Emiris, J. F. Canny, and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica, 19(1--2):219--242, September 1997. http://citeseer.ist.psu.edu/article/emiris97efficient.html More
@article{ emiris97efficient,
author = "Ioannis Z. Emiris and John F. Canny and Raimund Seidel",
title = "Efficient Perturbations for Handling Geometric Degeneracies",
journal = "Algorithmica",
volume = "19",
number = "1/2",
pages = "219-242",
year = "1997",
url = "citeseer.ist.psu.edu/article/emiris97efficient.html" }
Citations (may not include all citations):
1450
The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254
Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
481
Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
308
Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
276
Linear Programming and Extensions (context) - Dantzig - 1963
174
Visibility preprocessing for interactive walkthroughs
- Teller, S'equin - 1991
140
Simulation of simplicity: A technique to cope with degenerat..
- Edelsbrunner, Mucke - 1990
86
Matrix Polynomials (context) - Gohberg, Lancaster et al. - 1982
69
A polyhedral method for solving sparse polynomial systems (context) - Huber, Sturmfels - 1995
56
A geometric consistency theorem for a symbolic perturbation .. (context) - Yap - 1990
43
Partitioning and Ordering Large Radiosity Computations
- Teller, Fowler et al. - 1994
43
On degeneracy in geometric computations (context) - Burnikel, Mehlhorn et al. - 1994
41
Interpolating polynomials from their values (context) - Zippel - 1990
40
A general approach to removing degeneracies
- Emiris, Canny - 1995
38
An efficient approach to removing geometric degeneracies
- Emiris, Canny - 1992
33
The nature and meaning of perturbations in geometric computi.. (context) - Seidel - 1994
32
Safe and effective determinant evaluation
- Clarkson - 1992
28
Symbolic treatment of geometric degeneracies (context) - Yap - 1990
26
Computer Algebra (context) - Davenport, Siret et al. - 1988
22
Real zeros of polynomials (context) - Collins, Loos - 1982
20
Fast algorithms for the characteristic polynomial (context) - Keller-Gehrig - 1985
18
Axioms and Hulls (context) - Knuth - 1992
18
Bayesian grasping
- Goldberg, Mason - 1990
18
Computing a ham-sandwich cut in two dimensions (context) - Edelsbrunner, Waupotitsch - 1986
17
Multipolynomial resultants and linear algebra (context) - Manocha, Canny - 1992
16
A practical method for the sparse resultant (context) - Emiris, Canny - 1993
15
Algebraic complexity theory (context) - Gathen - 1988
14
Computing a statistical distribution of stable poses for a p..
- Wiegley, Rao et al. - 1992
12
of Electrical Engineering and Computer Science (context) - Emiris, Applications et al. - 1994
10
the average number of maxima in a set of vectors (context) - Bentley, Kung et al. - 1978
10
A complete implementation for computing general dimensional ..
- Emiris - 1995
8
Computing roadmaps of semi-algebraic sets (context) - Canny - 1991
8
Degeneracy in geometric computation and the perturbation app.. (context) - Schorn - 1994
7
Molecular Interstitial Skeleton (context) - Connolly - 1991
7
An epsilon-arithmetic for removing degeneracies
- Michelucci - 1995
7
Efficient contact determination for dynamic environments (context) - Lin, Manocha et al. - 1994
7
A complete framework for the intersection of a general polyh.. (context) - Dobrindt, Mehlhorn et al. - 1993
5
Automated spectral unmixing of Aviris data using convex geom.. (context) - Boardman - 1993
4
Personal Communication (context) - Thiele - 1993
Documents on the same site (http://www-sop.inria.fr/saga/personnel/Ioannis.Emiris/): More
Certified Approximate Univariate GCDs - Emiris, Galligo, Lombardi (1997)
(Correct)
An Efficient Algorithm for the Sparse Mixed Resultant - Canny, Emiris (1993)
(Correct)
Symbolic and Numeric Methods for Exploiting Structure in.. - Emiris, Pan (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC