(Enter summary)
Abstract: We describe the implementation of the LEDA [MN95, Nah95] data type real. Every
integer is a real and reals are closed under the operations addition, subtraction,
multiplication, division and squareroot. The main features of the data type real are
ffl The user--interface is similar to that of the built--in data type double. (Update)
Context of citations to this paper: More
...an easy way to overcome such precision and robustness problems by exact computation. For example, the number type leda real of LEDA [7, 40] can be used. This number type models a subset of algebraic numbers: All integers are leda reals and leda reals are closed under the...
Cited by: More
On the Design of CGAL, a Computational Geometry.. - Fabri, Giezeman.. (1999)
(Correct)
Similar documents (at the sentence level):
78.7%: The LEDA class real number - Burnikel, Mehlhorn, Schirra (1996)
(Correct)
Active bibliography (related documents): More All
0.4: Static Analysis Yields Efficient Exact Integer Arithmetic.. - Fortune, Van Wyk (1996)
(Correct)
0.3: The Implementation of Geometric Algorithms - Kurt Mehlhorn Stefan (1994)
(Correct)
0.2: Robust Geometric Computation (RGC), State of the Art - Santisteve (1999)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.3: Exact Geometric Computation in LEDA - Burnikel, Könemann, Mehlhorn.. (1995)
(Correct)
0.7: Efficient Exact Geometric Computation Made Easy - Burnikel, Fleischer.. (1999)
(Correct)
0.5: A Separation Bound for Real Algebraic Expressions - Burnikel, Funke, Mehlhorn.. (2001)
(Correct)
BibTeX entry: (Update)
C. Burnikel, K. Mehlhorn, and S. Schirra, `The LEDA class real number', Technical Report MPI-I-96-1001, Max-Planck-Institut fur Informatik, 1996. http://citeseer.ist.psu.edu/burnikel96leda.html More
@techreport{ burnikel96leda,
author = "Christoph Burnikel and Kurt Mehlhorn and Stefan Schirra",
title = "The {LEDA} Class {{\bf real}} Number",
number = "MPI-I-96-1-001",
address = "Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany",
year = "1996",
url = "citeseer.ist.psu.edu/burnikel96leda.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1980
68
Towards exact geometric computation
- Yap - 1993
63
Efficient exact arithmetic for computational geometry
- Fortune, van Wyk - 1993
60
The exact computation paradigm
- Yap, Dube - 1995
46
Efficient Delaunay triangulation using rational arithmetic (context) - Karasick, Lieber et al. - 1991
41
How to compute the Voronoi diagram of line segments: Theoret.. (context) - Burnikel, Mehlhorn et al. - 1994
35
Mathematics for Computer Algebra (context) - Mignotte - 1992
34
Max-Planck-Institut fur Informatik (context) - Naher, Version et al. - 1995
31
LEDA: A library of efficient data types and algorithms (context) - Mehlhorn, Naher - 1995
30
Numerical stability of algorithms for 2d Delaunay triangulat.. (context) - Fortune - 1992
27
Constructing strongly convex hulls using exact or rounded ar..
- Li, Milenkovic - 1992
25
The implementation of geometric algorithms
- Mehlhorn, Naher - 1994
25
Numerical stability of algorithms for line arrangements
- Fortune, Milenkovic - 1991
22
Fundamental Problems in Algorithmic Algebra (context) - Yap - 1994
17
for binary floating--point arithmetic (context) - standard - 1987
7
solution to imprecision in computational geometry (context) - Benouamer, Jaillon et al. - 1993
6
Implementation of a sweep line algorithm for the straight li..
- Mehlhorn, Naher - 1994
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