Computing minimum distance between two implicit algebraic surfaces

被引:20
|
作者
Chen, Xiao-Diao
Yong, Jun-Hai
Zheng, Guo-Qin
Paul, Jean-Claude
Sun, Jia-Guang
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[3] CNRS, F-75700 Paris, France
基金
中国国家自然科学基金;
关键词
minimum distance; offset; canal surface; implicit algebraic surface; parametric surface;
D O I
10.1016/j.cad.2006.04.012
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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. (C) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1053 / 1061
页数:9
相关论文
共 44 条
  • [21] Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes
    Shen, BZ
    Tzeng, KK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) : 1703 - 1708
  • [22] EXPLICIT SOLUTION FOR THE MINIMUM DISTANCE BETWEEN TWO SOLID SEMI-INFINITE CIRCULAR CONES
    Karlin, Baruch E.
    GRAPP 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS THEORY AND APPLICATIONS, 2010, : 154 - 159
  • [23] Two-stage least squares as minimum distance
    Windmeijer, Frank
    ECONOMETRICS JOURNAL, 2019, 22 (01) : 1 - 9
  • [24] Minimum distance of Hermitian two-point codes
    Seungkook Park
    Designs, Codes and Cryptography, 2010, 57 : 195 - 213
  • [25] Minimum distance of Hermitian two-point codes
    Park, Seungkook
    DESIGNS CODES AND CRYPTOGRAPHY, 2010, 57 (02) : 195 - 213
  • [26] Minimum Distance between Bent and Resilient Boolean Functions
    Qu, Longjiang
    Li, Chao
    CODING AND CRYPTOLOGY, PROCEEDINGS, 2009, 5557 : 219 - 232
  • [27] Computing the minimum directed distances between convex polyhedra
    Shih, CL
    Liu, JY
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1999, 15 (03) : 353 - 373
  • [28] Distance between Two Keplerian Orbits
    Mohamed A.H.
    Dwidar H.R.
    Adham I.
    Bakry A.-E.
    El-Raffie A.
    Artificial Satellites, 2021, 56 (03) : 57 - 77
  • [29] DISTANCE BETWEEN TWO KEPLERIAN ORBITS
    Mohamed, Ayman Homda
    Dwidar, Hany Ramdan
    Adham, Inal
    Bakry, Abd-Elazaz
    El-Raffie, Ahmed
    ARTIFICIAL SATELLITES-JOURNAL OF PLANETARY GEODESY, 2021, 56 (03): : 57 - 77
  • [30] The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance
    Masaaki Homma
    Seon Jeong Kim
    Designs, Codes and Cryptography, 2006, 38 : 55 - 81