Minimum distance between the faces of two convex polyhedra: A sufficient condition

被引：3
|
作者：
Llanas, B
De Sevilla, MF
Feliu, V
机构：
[1] ETSI Caminos, Dpto Matemat & Informat, Madrid 28040, Spain
[2] ETSI Ind, Dpto Ingn Elect, Ciudad Real 13071, Spain
来源：
JOURNAL OF GLOBAL OPTIMIZATION | 2003年 / 26卷 / 04期
关键词：
distance between convex polyhedra; local descent; projection algorithms; sufficient condition of global minimum;
D O I：
10.1023/A:1024755315702
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.
引用
收藏
页码：361 / 385
页数：25
相关论文
共 50 条
  • [41] Necessary and sufficient condition on decomposable convex programming
    Chu, Liang-Ju
    [J]. Proceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering, 1996, 20 (04): : 351 - 359
  • [42] A sufficient condition for a generalized minimum distance Reed-Solomon decoder to ensure correct decoding
    Kamiya, N
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (11) : 2066 - 2072
  • [43] NECESSARY AND SUFFICIENT CONDITION FOR A CONVEX SET TO BE CLOSED
    HALKIN, H
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (06): : 628 - &
  • [44] Characterization of convex polyhedra with regular polygonal faces by minimal number of parameters
    [J]. Kovič, J. (amadea.kovic@siol.net), 1600, Charles Babbage Research Centre (89):
  • [45] Coloring the faces of convex polyhedra so that like colors are far apart
    Sanders, DP
    Zhao, Y
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 85 (02) : 348 - 360
  • [46] Calculating minimum distance between two NURBS objects
    He P.
    Zhang C.
    Zhou J.
    Ma Y.
    [J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2010, 22 (08): : 1344 - 1351
  • [47] Computing the minimum distance between two Bezier curves
    Chen, Xiao-Diao
    Chen, Linqiang
    Wang, Yigang
    Xu, Gang
    Yong, Jun-Hai
    Paul, Jean-Claude
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 229 (01) : 294 - 301
  • [48] Calculating the minimum distance between two NURBS curves
    He, Ping
    Zhang, Caiming
    Zhou, Jingbo
    Ma, Yingliang
    [J]. 2009 IEEE 10TH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED INDUSTRIAL DESIGN & CONCEPTUAL DESIGN, VOLS 1-3: E-BUSINESS, CREATIVE DESIGN, MANUFACTURING - CAID&CD'2009, 2009, : 643 - 648
  • [49] Multidimensional Data Visualization Based on the Minimum Distance Between Convex Hulls of Classes
    Nemirko A.P.
    [J]. Pattern Recognition and Image Analysis, 2018, 28 (04) : 712 - 719
  • [50] ON THE SHORTEST PATHS BETWEEN 2 CONVEX POLYHEDRA
    BALTSAN, A
    SHARIR, M
    [J]. JOURNAL OF THE ACM, 1988, 35 (02) : 267 - 287
12345