论文信息 - The convex hull in a new model of computation - 字舞流文

The convex hull in a new model of computation

Elham Kashefi | Abbas Edalat | André Lieutier | E. Kashefi | A. Lieutier | A. Edalat

[1] Rida T. Farouki,et al. Approximation by Interval , 1992 .

[2] David Avis,et al. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1992, Discret. Comput. Geom..

[3] Victor J. Milenkovic,et al. Robust polygon modelling , 1993, Comput. Aided Des..

[4] Nicholas M. Patrikalakis,et al. Robust interval algorithm for curve intersections , 1996, Comput. Aided Des..

[5] Mark Segal,et al. Using tolerances to guarantee valid polyhedral modeling results , 1990, SIGGRAPH.

[6] Nicholas M. Patrikalakis,et al. Robust interval solid modelling Part II: boundary evaluation , 1996, Comput. Aided Des..

[7] Leonidas J. Guibas,et al. Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.