C. Turnbull and S. Cameron. Computing distances between NURBS-defined convex objects. In IEEE International Conference on Robotics and Automation, pages 3685--3690, Leuven, Belgium, May 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Distance Computation for Quadratic Curves and Surfaces - Lennerz, Schömer (2002) (Correct)
....information about the distance and dynamic states of all objects provides lower bounds on the earliest time of collision. The problem of distance computation has been well studied in the past for polyhedral objects, e.g. 5, 8, 3] but only little effort has spent on objects with curved surfaces [11]. There are two reasons for this situation. First, a polygonal representation is not considered a true restriction since real objects can be approximated arbitrarily precisely by a polyhedron. The second reason is the fact that the basic algorithms and predicates can be implemented robustly and ....
C. Turnbull and S. Cameron. Computing distances between nurbs-defined convex objects. In IEEE Int. Conf. of Robot. Autom., pages 3686--3690, 1998.
3D Collision Detection: A Survey - Jiménez, Thomas, Torras (2000) (Correct)
....detection between smooth surfaces would be of interest. Although some research has been performed on robust and interactive computation of closest features, much remains to be done in the direction of determining contact points and penetration distances between models with smooth surfaces (see [80] for some results) As a further step, accurate and efficient detection of contacts between deformable models is also a research area that will certainly deserve attention in the near future. Acknowledgments This research has been partially supported by Comissionat per a Universitats i Recerca, ....
Turnbull, C., and Cameron, S. Computing distances between nurbs-defined convex objects. In Proc. IEEE Int. Conf. on Robotics and Automation (Leuven (Belgium), May 1998), pp. 3686--3690. 29
Bound Coherence for Minimum Distance Computations - Johnson, Cohen (1999) (3 citations) (Correct)
.... in constant time [11] This was later extended into the I COLLIDE system [5] Gilbert s algorithm for computing distance between convex objects [6] was later shown to have a similar constant time complexity with minor modification [3] Turnbull has extended this approach to convex spline patches [17]. Rather than explicitly tracking closest points, an additional way to exploit time coherence for convex objects is through witness planes. A plane that separates two objects can be efficiently computed and offers quick testing of separation on following time steps. Baraff [1] and Chung [4] used ....
Turnbull, Colin and Cameron, Stephen, "Computing Distances Between NURBS-defined Convex Objects", Proc. IEEE Intl. Conf. Robotics & Automation, Leuven, Belgium, May 16-21, 1998.
Proximity Queries between Convex Objects: - An Interior Point (Correct)
No context found.
C. Turnbull and S. Cameron. Computing distances between NURBS-defined convex objects. In IEEE International Conference on Robotics and Automation, pages 3685--3690, Leuven, Belgium, May 1998.
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