Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic

[1]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[2]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[3]  Arjen K. Lenstra,et al.  Polynomial Factorization by Root Approximation , 1984, EUROSAM.

[4]  Kazuo Murota,et al.  IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS , 1984 .

[5]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[6]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[7]  F. Frances Yao,et al.  Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Joshua U. Turner,et al.  Accurate solid modeling using polyhedral approximations , 1988, IEEE Computer Graphics and Applications.