CiteSeer.IST Home  Related articles for:  Constructing Strongly Convex Hulls Using Exact or Rounded.. - Li, Milenkovic (1992)   (Correct)

Active bibliography (related documents):
0.1:   Computing Convex Hull in Floating Point Arithmetic - Jaromczyk, Wasilkowski (1994)   (Correct)
0.1:   Robust Polygon Modeling - Milenkovic (1993)   (Correct)
0.1:   Approximate Data Structures with Applications (Extended.. - Matias, Vitter, Young (1994)   (Correct)
0.1:   The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1996)   (Correct)
0.1:   Approximate Data Structures (Extended Abstract) - Matias, Vitter, Young (1994)   (Correct)
0.1:   Robustness In Solid Modeling - A Tolerance Based.. - Fang, Bruderlin, Zhu (1993)   (Correct)
0.1:   Shapes And Implementations In Three-Dimensional Geometry - Mücke (1993)   (Correct)
0.1:   On Detecting Spatial Regularity in Noisy Images - Robins, Robinson, Sethi (1999)   (Correct)
0.1:   Structural Tolerance and Delaunay Triangulation - Abellanas, Hurtado, Ramos (1999)   (Correct)
0.1:   Pattern Minefield Detection from Inexact Data (Extended.. - Robins, Robinson (1995)   (Correct)
0.1:   Robust Construction of the Voronoi Diagram of a Polyhedron - Milenkovic (1993)   (Correct)
0.1:   Double Precision Geometry: A General Technique for Calculating.. - Milenkovic (1989)   (Correct)
0.1:   An Experiment Using LN for Exact Geometric Computations - Chang, Milenkovic (1993)   (Correct)
0.1:   On the bit complexity of minimum link paths: Superquadratic.. - Kahan, Snoeyink (1998)   (Correct)
0.1:   Computational Geometry - Fortune (1994)   (Correct)
0.1:   Robustness Issues in Computational Geometry - Keyser   (Correct)
0.1:   Evaluating Signs of Determinants Using.. - Avnaim, Boissonnat, .. (1997)   (Correct)
0.1:   Safe and Effective Determinant Evaluation - Clarkson (1995)   (Correct)
0.0:   A Paradigm for the Robust Design of Algorithms for Geometric .. - Agrawal, Requicha (1994)   (Correct)
0.0:   Robust Point Location in Approximate Polygons - James Stewart (1991)   (Correct)

Similar documents based on text:
0.2:   Robust Geometric Computations for Vision and Robotics - Milenkovic (1989)   (Correct)
0.1:   Correctly Rounded Binary-Decimal and Decimal-Binary Conversions - Gay (1990)   (Correct)
0.1:   Snap Rounding Revisited - Packer, Halperin (2001)   (Correct)
0.1:   Performance of an Occam/transputer implementation of interval .. - Caprani, Madsen (1993)   (Correct)
0.1:   Shortest Path Geometric Rounding - Milenkovic (2000)   (Correct)
0.1:   Round-Pound Arithmetic - Iain Maccallum   (Correct)
0.1:   Calculating Approximate Curve Arrangements Using Rounded.. - Milenkovic (1989)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Related documents from co-citation:
20:   Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithm.. (context) - Milenkovic - 1988
12:   Double precision geometry: a general technique for calculating line and segment .. - Milenkovic - 1989
11:   Epsilon geometry: Building robust algorithms from imprecise computations (context) - Guibas, Salesin et al. - 1989
10:   Numerical stability of algorithms for line arrangements - FORTUNE, MILENKOVIC - 1991
9:   Towards exact geometric computation - Yap - 1993
9:   Efficient Delaunay triangulation using rational arithmetic (context) - Karasick, Lieber et al. - 1991
9:   Towards implementing robust geometric computations (context) - Hoffmann, Hopcroft et al. - 1988
9:   Efficient exact arithmetic for computational geometry - Fortune, Van Wyk - 1993
9:   Stable maintenance of point set triangulations in two dimensions (context) - Fortune - 1989
8:   Finite-Resolution Computational Geometry (context) - Greene - 1986
8:   Numerical stability of algorithms for 2-d Delaunay triangulations and Voronoi di.. (context) - Fortune - 1992
7:   Simulation of simplicity: a technique to cope with degenerate cases in geometric.. - Edelsbrunner, Mucke - 1990
6:   Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
6:   Primitives for the manipulation of general subdivisions and the computation of V.. (context) - Guibas, Stolfi - 1985
6:   Construction of the Voronoi diagram for one million generators in single-precisi.. (context) - Iri, Sugihara - 1989
6:   A Solid Modelling System Free from Topological Inconsistencies (context) - Sugihara, Iri - 1989
6:   A paradigm for robust geometric algorithms (context) - HOPCROFT, KAHN - 1992
6:   the Representation and Manipulation of Rigid Solids (context) - Karasick - 1988
5:   How to compute the voronoi diagram of line segments: Theoretical and experimenta.. (context) - Burnikel, Mehlhorn et al. - 1994
5:   Algorithms for reporting and counting geometric intersections (context) - Bentley, Ottmann - 1979

CiteSeer.IST - Copyright Penn State and NEC