|
[AT] |
S. G. Akl and G. T. Toussaint.
A fast convex hull algorithm.
Inform. Process. Lett., 7(5):219-222, 1978.
|
|
[As] |
K. R. Anderson.
A reevaluation of an efficient algorithm for determining the convex
hull of a finite planar set.
Inform. Process. Lett., 7(1):53-55, 1978.
|
|
[Aw] |
A. M. Andrew.
Another efficient algorithm for convex hulls in two dimensions.
Inform. Process. Lett., 9(5):216-219, 1979.
|
|
[doubledouble] |
Keith Briggs.
The doubledouble home page.
http://epidem13.plantsci.cam.ac.uk/~kbriggs/doubledouble.html.
|
|
[BMFS] |
C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra.
A strong and easily computable separation bound for arithmetic
expressions involving square roots.
In Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms,
pages 702-709, 1997.
|
|
[BKMNSU] |
C. Burnikel, J. Könemann, K. Mehlhorn, S. Näher, S. Schirra, and C. Uhrig.
Exact geometric computation in LEDA.
In Proceedings of the 11th ACM Symposium on Computational
Geometry, pages C18-C19, 1995.
|
|
[BMS] |
C. Burnikel, K. Mehlhorn, and S. Schirra.
The LEDA class real number.
Technical Report MPI-I-96-1-001, Max-Planck-Institut für
Informatik, 1996.
|
|
[By] |
A. Bykat.
Convex hull of a finite set of points in two dimensions.
Inform. Process. Lett., 7:296-298, 1978.
|
|
[D] |
T. J. Dekker.
A floating-point technique for extending the available precision.
Numerische Mathematik, 18:224 - 242, 1971.
|
|
[Ey] |
W. F. Eddy.
A new convex hull algorithm for planar sets.
ACM Trans. Math. Softw., 3:398-403 and 411-412, 1977.
|
|
[FvW] |
S. Fortune and C. Van Wyk.
Static analysis yields efficient exact integer arithmetic for
computational geometry.
ACM Transactions on Graphics, 15(3):223-248, 1996.
|
|
[G] |
R. L. Graham.
An efficient algorithm for determining the convex hull of a finite
planar set.
Inform. Process. Lett., 1:132-133, 1972.
|
|
[gmp] |
T. Granlund.
GNU MP, The GNU Multiple Precision Arithmetic Library,
2.0.2 edition, June 1996.
|
|
[Ha] |
C. C. Handley.
Efficient planar convex hull algorithm.
Image Vision Comput., 3:29-35, 1985.
|
|
[Ja] |
R. A. Jarvis.
On the identification of the convex hull of a finite set of points in
the plane.
Inform. Process. Lett., 2:18-21, 1973.
|
|
[Me] |
K. Mehlhorn.
Multi-dimensional Searching and Computational Geometry,
volume 3 of Data Structures and Algorithms.
Springer-Verlag, Heidelberg, Germany, 1984.
|
|
[OvL] |
M. H. Overmars and J. van Leeuwen.
Further comments on Bykat's convex hull algorithm.
Inform. Process. Lett., 10:209-212, 1980.
|
|
[P] |
D. M. Priest.
On Properties of Floating-Point Arithmetic: Numerical Stability
and the Cost of Accurate Computations.
PhD thesis, Department of Mathematics, University of California at
Berkeley, 1992.
|
|
[S] |
Jonathan Richard Shewchuk.
Adaptive precision floating-point arithmetic and fast robust
geometric predicates.
Discrete & Computational Geometry, 18(3):305-363, October
1997.
|