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 条
  • [21] Incremental computing with data structures
    Morihata, Akimasa
    SCIENCE OF COMPUTER PROGRAMMING, 2018, 164 : 18 - 36
  • [22] Fast Algorithms for Approximating Distances
    S. Bespamyatnikh
    M. Segal
    Algorithmica, 2002, 33 : 263 - 269
  • [23] The Incremental Quest for Quantum Computing
    Coffey, Valerie C.
    PHOTONICS SPECTRA, 2014, 48 (06) : 36 - 41
  • [24] Incremental trust in Grid computing
    Brinklov, Michael
    Sharp, Robin
    CCGRID 2007: SEVENTH IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, 2007, : 135 - +
  • [25] COMPUTING GEODESIC DISTANCES IN TREE SPACE
    Owen, Megan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (04) : 1506 - 1529
  • [26] COMPUTING MINIMAL DISTANCES ON POLYHEDRAL SURFACES
    WOLFSON, E
    SCHWARTZ, EL
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (09) : 1001 - 1005
  • [27] On computing distances and latencies in Link Streams
    Simard, Frederic
    PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019), 2019, : 394 - 397
  • [28] Computing similarity distances between rankings
    , Farzad Farnoud
    Milenkovic, Olgica
    Puleo, Gregory J.
    Su, Lili
    DISCRETE APPLIED MATHEMATICS, 2017, 232 : 157 - 175
  • [29] Computing complexity distances between algorithms
    Romaguera, S
    Sánchez-Pérez, EA
    Valero, O
    KYBERNETIKA, 2003, 39 (05) : 569 - 582
  • [30] Computing geodesic distances on triangular meshes
    Novotni, M
    Klein, R
    WSCG'2002, VOLS I AND II, CONFERENCE PROCEEDINGS, 2002, : 341 - 347
12345