C.-K. Yap. Symbolic treatment of geometric dependancies. J. Symbolic Computation, 10 (1990), pp. 349--370. 34  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
How Good are Convex Hull Algorithms? - Avis, Bremner (1995) (Correct)
....list all vertices in P corresponding to these bases, removing duplicates. If P is simple then the number of bases is at most O(m bd=2c ) by the upper bound theorem. A perturbation scheme can be either numerical or symbolic, and general framework for describing such schemes is contained in Yap [20]. A common numerical perturbation is obtained by perturbing the right hand side vector of the system of halfspaces defining P . This perturbed vector is used in calculations. A simple way of transforming the perturbed vertices back to vertices of P is simply to carry an extra column which is the ....
C-K Yap. Symbolic treatment of geometric dependancies. J. Symbolic Computation, 10:349-- 370, 1990.
Determining the Castability of Simple Polyhedra - Bose, Bremner, van Kreveld (1994) (7 citations) (Correct)
No context found.
C.-K. Yap. Symbolic treatment of geometric dependancies. J. Symbolic Computation, 10 (1990), pp. 349--370. 34
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