Solving the interference problem for ellipses and ellipsoids: New formulae

被引:3
|
作者
Caravantes, J. [1 ]
Diaz-Toca, G. M. [2 ,3 ]
Fioravanti, M. [3 ]
Gonzalez-Vega, L. [4 ]
机构
[1] Univ Alcala, Madrid, Spain
[2] Univ Murcia, Murcia, Spain
[3] Univ Cantabria, Santander, Spain
[4] CUNEF Univ, Madrid, Spain
关键词
Ellipses; Ellipsoids; Subresultants; Events detection; CONTINUOUS COLLISION DETECTION; ALGEBRAIC CONDITIONS; RELATIVE POSITIONS; MOVING ELLIPSOIDS; CLASSIFICATION;
D O I
10.1016/j.cam.2021.114072
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The problem of detecting when two moving ellipses or ellipsoids overlap is of interest to robotics, CAD/CAM, computer animation, etc., where ellipses and ellipsoids are often used for modelling (and/or enclosing) the shape of the objects under consideration. By analysing symbolically the sign of the real roots of the characteristic polynomial of the pencil defined by two ellipses/ellipsoids A and B given by X(T)AX = 0 and (XBX)-B-T = 0, we derive new formulae characterising when A and B overlap, are separate, or touch each other externally. This characterisation is defined by a minimal set of polynomial inequalities depending only on the entries of A and B so that we need only compute the characteristic polynomial of the pencil defined by A and B, det(TA+B), and not the intersection points between them. Compared with the best available approach dealing with this problem, the new formulae involve a smaller set of polynomials and less sign conditions. As an application, this characterisation provides also a new approach for exact collision detection of two moving ellipses or ellipsoids since the analysis of the univariate polynomials (depending on the time) in the previously mentioned formulae provides the collision events between them.(C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 50 条
  • [31] On the lattice point problem for ellipsoids
    Bentkus, V
    Gotze, F
    ACTA ARITHMETICA, 1997, 80 (02) : 101 - 125
  • [32] On the clique problem in intersection graphs of ellipses
    Ambühl, C
    Wagner, U
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 489 - 500
  • [33] Toward A Totally Solving Interference Problem for Ultrasound Localization system
    Song, Byunghun
    Lee, Hyungsu
    Chung, Kwangsue
    2006 THE JOINT INTERNATIONAL CONFERENCE ON OPTICAL INTERNET (COIN) AND NEXT GENERATION NETWORK (NGNCON), 2006, : 426 - 428
  • [34] NEW WAYS OF SOLVING THE MAIKOP PROBLEM
    SAFRONOV, VA
    SOVIET ANTHROPOLOGY AND ARCHEOLOGY, 1992, 30 (03): : 57 - 66
  • [35] NEW IDEAS FOR SOLVING THE OLD PROBLEM
    MASLOV, VP
    VESTNIK AKADEMII NAUK SSSR, 1991, (05) : 41 - 56
  • [36] A New Paradigm of Distributed Problem Solving
    Su, Yila
    Liu, Chunnian
    Liu, Limin
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (06): : 70 - 77
  • [37] A New Approach to Stoichiometric Problem Solving
    Cvitas, T.
    KEMIJA U INDUSTRIJI-JOURNAL OF CHEMISTS AND CHEMICAL ENGINEERS, 2006, 55 (04): : 175 - 182
  • [38] NEW DIMENSION IN PROBLEM-SOLVING
    LEYS, J
    RUSCICA, R
    INDUSTRIAL RESEARCH & DEVELOPMENT, 1978, 20 (03): : 114 - 119
  • [39] A NEW METHOD OF SOLVING THE TRANSPORTATION PROBLEM
    WAGENER, UA
    OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (04) : 453 - 469
  • [40] A new approach for solving the Stokes problem
    M. Gachpazan
    A. Kerayechian
    Korean Journal of Computational & Applied Mathematics, 2001, 8 (1) : 151 - 164