Robustness Issues in Computational Geometry  (Make Corrections)  
John Keyser

  Home/Search   Context   Related
 
View or download:
duke.edu/~pankaj/spring9...keyser.ps.gz
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  duke.edu/~pankaj/spring9...cps234 (more)
Homepages:  J.Keyser  [2]  HPSearch  (Update Links)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, I will give a brief survey of the issues involved with each of these classes of problems, and discuss some of the solutions that have been proposed for dealing with them. In particular, I will draw on examples from the field of geometric and solid modeling, as an area where many of these problems have been seen and these techniques applied. (Update)

Active bibliography (related documents):   More   All
0.6:   Efficient and Accurate B-rep Generation of Low Degree.. - Keyser, Krishnan.. (1997)   (Correct)
0.5:   Efficient and Reliable Computation with Algebraic.. - Keyser, Krishnan.. (1998)   (Correct)
0.5:   Optimized Refinable Surface Enclosures - Peters, Wu   (Correct)

Similar documents based on text:   More   All
0.0:   An Effective Architecture of the Pipelined LMS Adaptive.. - Kimijima, NISHIKAWA, KIYA   (Correct)
0.0:   A Compact Mo for the Current-Voltage Characteristics of a.. - Kenji Nator Member   (Correct)
0.0:   Group Theory - Exceptional Lie groups as invariance groups - Cvitanovic (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ keyser-robustness,
  author = "John Keyser",
  title = "Robustness Issues in Computational Geometry",
  url = "citeseer.nj.nec.com/247595.html" }
Citations (may not include all citations):
120   Simulation of simplicity: A technique to cope with degenerat.. - Edelsbrunner, Mucke - 1990
91   Geometric and Solid Modeling (context) - Hoffmann - 1989
65   Verifiable implementations of geometric algorithms using fin.. (context) - Milenkovic - 1988
53   Epsilon geometry: Building robust algorithms from imprecise .. (context) - Guibas, Salesin et al. - 1989
50   Efficient exact arithmetic for computational geometry - Fortune, van Wyk - 1993
39   The exact computation paradigm - Yap, Dube - 1995
35   Efficient delaunay triangulation using rational arithmetic (context) - Karasick, Lieber et al. - 1991
35   Voronoi diagrams and delaunay triangulations - Fortune - 1995
32   A general approach to removing degeneracies - Emiris, Canny - 1994
32   The problems of accuracy and robustness in geometric computa.. (context) - Hoffmann - 1989
31   Using tolerances to guarantee valid polyhedral modeling resu.. (context) - Segal - 1990
25   Symbolic treatment of geometric degeneracies (context) - Yap - 1990
25   Rounding arrangements dynamically - Guibas, Marimont - 1995
23   The nature and meaning of perturbations in geometric computi.. (context) - Seidel - 1994
20   The Complexity of Robot Motion Planning (context) - Canny - 1988
17   A paradigm for robust geometric algorithms (context) - Hopcroft, Kahn - 1989
17   Static analysis yields efficient exact integer arithmetic fo.. - Fortune, van Wyk - 1996
15   Active zones in csg for accelerating boundary evaluation (context) - Rossignac, Voelcker - 1989
15   Error-free boundary evaluation based on a lazy rational arit.. - Benouamer, Michelucci et al. - 1994
14   Exact arithmetic solid modeling (context) - Yu - 1991
12   Calculating approximate curve arrangements using rounded ari.. - Milenkovic - 1989
12   Robustness in solid modeling: A tolerance-based intuitionist.. - Fang, Bruderlin et al. - 1993
11   Robust adaptive floating-point geometric predicates (context) - Shewchuk - 1996
10   Automatic parsing of degenerate quadric-surface intersection.. (context) - Farouki, Neff et al. - 1993
9   Boundary representation modelling with local tolerancing (context) - Jackson - 1995
8   Efficient perturbations for handling geometric degeneracies - Emiris, Canny et al. - 1994
8   Delaunay triangulations in three dimensions with finite prec.. (context) - Dey, Sugihara et al. - 1992
7   Computational Geometry: Theory and Applications (context) - Yap, geometric et al. - 1994
6   Robust interval solid modelling part i: Representations (context) - Hu, Patrikalakis et al. - 1996
5   Optimal tolerance allotment using a genetic algorithm and tr.. (context) - Lee, Johnson - 1993
5   Real algebraic number computation using interval arithmetic (context) - Johnson - 1992
5   Robustness issues in geometric algorithms - Fortune - 1996
4   the bit complexity of minimum link paths: Superquadratic alg.. - Kahan, Snoeyink - 1996
3   Surface intersection using affine arithmetic (context) - de Figueiredo - 1996
3   Robust interval solid modelling part ii: Boundary evaluation (context) - Hu, Patrikalakis et al. - 1996
3   Representational primitives for geometric tolerancing (context) - Guilford, Turner - 1993
1   Affine arithmetic and its applications to computer graphics - Dibl, Jorge - 1993
1   Exact computation in leda (context) - Burnikel - 1995
1   Lecture Notes for Advanced School on Algorithmic Foundations.. (context) - Schirra, robustness - 1996
1   Save and effective determinant evaluation (context) - Clarkson - 1995
1   Floating-point numbers with error estimates (context) - Massotti - 1993

Documents on the same site (http://www.cs.duke.edu/~pankaj/spring97/cps234.html):   More
Collision Detection Techniques for 3D Models - Gottschalk (1997)   (Correct)
A Survey of Polygonal Simplification Algorithms - Luebke (1997)   (Correct)
Data Structures for Spatial Database Systems - Procopiuc (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer   Add search form to your site   Submit documents   Feedback  

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute