Stable maintenance of point set triangulations in two dimensions
暂无分享,去创建一个
[1] Victor J. Milenkovic,et al. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Leonidas J. Guibas,et al. Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.
[3] John E. Hopcroft,et al. Towards implementing robust geometric computations , 1988, SCG '88.
[4] N. Mnev. The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .
[5] Christoph M. Hoffmann,et al. The problems of accuracy and robustness in geometric computation , 1989, Computer.
[6] F. Frances Yao,et al. Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[7] Carsten Thomassen,et al. Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.
[8] John F. Canny,et al. Some algebraic and geometric computations in PSPACE , 1988, STOC '88.
[9] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[10] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.