A fast procedure for computing incremental growth distances

被引：0
|
作者：
Hong, SM [1 ]
机构：
[1] Kyungpook Natl Univ, Sch Elect & Elect Engn, Taegu 702701, South Korea
来源：
1998 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS - PROCEEDINGS, VOLS 1-3: INNOVATIONS IN THEORY, PRACTICE AND APPLICATIONS | 1998年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A fast numerical procedure is presented for computing growth distances between a pair of polytopes in R-3 that move incrementally along specified smooth paths. The procedure carrys out the growth distance evaluations efficiently bgl predicting and verifying contact configurations between a pair of grown polytopes. The computation time, in average, is very small and does not depend significantly on the geometric complexity of two polytopes.
引用
收藏
页码：1170 / 1177
页数：8
相关论文
共 50 条
  • [41] A Fast Incremental Hypervolume Algorithm
    Bradstreet, Lucas
    While, Lyndon
    Barone, Luigi
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (06) : 714 - 723
  • [42] Fast Incremental and Personalized PageRank
    Bahmani, Bahman
    Chowdhury, Abdur
    Goel, Ashish
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 4 (03): : 173 - 184
  • [43] FAST INCREMENTAL PLANARITY TESTING
    WESTBROOK, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 342 - 353
  • [44] A Fast Incremental Clustering Algorithm
    Su, Xiaoke
    Lan, Yang
    Wan, Renxia
    Qin, Yuming
    ISIP: 2009 INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING, PROCEEDINGS, 2009, : 175 - +
  • [45] FAST COMPUTATION OF NORMALIZED EDIT DISTANCES
    VIDAL, E
    MARZAL, A
    AIBAR, P
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (09) : 899 - 902
  • [46] An incremental algorithm for computing the transversal hypergraph
    Szathmary, Laszlo
    ANNALES MATHEMATICAE ET INFORMATICAE, 2023, 58 : 147 - 159
  • [47] On message sequences for incremental network computing
    Lin, Cho-Chin
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2008, 24 (04) : 1023 - 1040
  • [48] Fast Distributed Computation of Distances in Networks
    Almeida, Paulo Sergio
    Baquero, Carlos
    Cunha, Alcino
    2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2012, : 5215 - 5220
  • [49] A procedure for the incremental construction of a knowledge space
    Stefanutti, L
    Koppen, M
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2003, 47 (03) : 265 - 277
  • [50] Monads for incremental computing - Functional pearl
    Carlsson, M
    ACM SIGPLAN NOTICES, 2002, 37 (09) : 26 - 35
12345