| Johnson, D. E. and Cohen, E. (1999). Bound coherence for minimum distance computations. In Proceedings of IEEE International Conference on Robotics and Automation. |
....roboticists might have avoided NURBS is a perceived complexity of the representation and hence an inability to compute geometric interactions sufficiently fast. Recently it has been shown that fast local and global geometric computations can be devised for point to surface interactions using NURBS [15, 21]. The following are some issues of current research. ffl Surface to surface NURBS computations. This computation is more complex, but will be necessary to fully model object interaction such as assembly. ffl Bounding volume toolchest for global minimum distance computations. Various forms of ....
Johnson. D. and Cohen, E., "Bound coherence for minimum distance computations," Proc. IEEE Intl. Conf. Robotics & Automation, pp. 1843-1848, 1999.
.... In the second step, the closest point is found to the polygonal control mesh, then the associated point on the surface is approximated by an interpolation process called nodal mapping from the control mesh (Figure 4) Taking advantage of coherence between time steps can speed up this computation [11]. The closest points then act as seed points to the local surface tracing computation, where contact forces are determined. Local surface tracing is efficiently accomFigure 4: Nodal mapping interpolates from the closest point on the control mesh to the surface. Figure 5: Parametric projection ....
D.E. Johnson and E. Cohen. Bound coherence for minimum distance computations. In Proc. IEEE Intl. Conf. Robotics and Automation, pages 1843--1848, May 1999.
....so lower update rates are acceptable. The global minimum distance calculation is broken into two steps [3] 1. Bounding boxes. Most NURBS surfaces can be quickly eliminated from consideration by using bounding boxes. Taking advantage of coherence between time steps can speed up this computation [5]. 2. Nodal mapping. The control mesh forms a convex hull for its NURBS surface (Figure 4) Once the closest point is found to the polygonal control mesh, then the associated point on the surface is approximated by an interpolation process called nodal mapping from the control mesh. Local Surface ....
D.E. Johnson and E. Cohen, "Bound coherence for minimum distance computations," Proc. IEEE Intl. Conf. Robotics & Automation, pp. 1843-1848, 1999.
No context found.
Johnson, D. E. and Cohen, E. (1999). Bound coherence for minimum distance computations. In Proceedings of IEEE International Conference on Robotics and Automation.
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