Computing minimum distance between two implicit algebraic surfaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer-Aided Design Year : 2006

Computing minimum distance between two implicit algebraic surfaces

Abstract

The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic surfaces, a new method based on the offset technique is presented to compute the minimum distance and a pair of points where the minimum distance occurs. The new method also works where there are an implicit algebraic surface and a parametric surface. Quadric surfaces, tori and canal surfaces are used to demonstrate our new method. When the two surfaces are a general quadric surface and a surface which is a cylinder, a cone or an elliptic paraboloid, the new method can produce two bivariate equations where the degrees are lower than those of any existing method.

Dates and versions

inria-00124255 , version 1 (12-01-2007)

Identifiers

Cite

Xiao-Diao Chen, Jun-Hai Yong, Guo-Qin Zheng, Jean-Claude Paul, Jia-Guang Sun. Computing minimum distance between two implicit algebraic surfaces. Computer-Aided Design, 2006, Computer-Aided Design, 38 (10), pp.1053--1061. ⟨10.1016/j.cad.2006.04.012⟩. ⟨inria-00124255⟩
124 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More