An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing

被引：0
|
作者：
Evgeny Lipovetsky
Nira Dyn
机构：
[1] Tel-Aviv University,School of Mathematical Sciences
来源：
Advances in Computational Mathematics | 2007年 / 26卷
关键词：
convex polygons; metric average; morphing; linear time complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we developed an algorithm for the computation of the metric average between two intersecting convex polygons in 2D. For two 1D sets there is an algorithm for the computation of the metric average, with linear time in the number of intervals in the two 1D sets. The proposed algorithm has linear computation time in the number of vertices of the two polygons. As an application of this algorithm, a new technique for morphing between two convex polygons is developed. The new algorithm performs morphing in a non-intuitive way.
引用
收藏
页码：269 / 282
页数：13
相关论文
共 39 条
  • [31] RETRACTED: Efficient Multiuser Computation for Mobile-Edge Computing in IoT Application Using Optimization Algorithm (Retracted Article)
    Hasanin, Tawfiq
    Alsobhi, Aisha
    Khadidos, Adil
    Qahmash, Ayman
    Khadidos, Alaa
    Ogunmola, Gabriel Ayodeji
    APPLIED BIONICS AND BIOMECHANICS, 2021, 2021
  • [32] A new two-step inertial algorithm for solving convex bilevel optimization problems with application in data classification problems
    Sae-jia, Puntita
    Suantai, Suthep
    AIMS MATHEMATICS, 2024, 9 (04): : 8476 - 8496
  • [33] An efficient algorithm for solving two multi-object generalized assignment problems and its application
    Dept. of Control Sci. and Eng., HUST, Wuhan 430074, China
    Huazhong Ligong Daxue Xuebao/Journal Huazhong (Central China) University of Science and Technology, 2001, 29 (01): : 70 - 72
  • [34] An efficient Adaptive Mesh Refinement (AMR) algorithm for the Discontinuous Galerkin method: Applications for the computation of compressible two-phase flows
    Papoutsakis, Andreas
    Sazhin, Sergei S.
    Begg, Steven
    Danaila, Ionut
    Luddens, Francky
    JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 363 : 399 - 427
  • [35] An average-case efficient two-stage algorithm for enumerating all longest common substrings of minimum length k between genome pairs
    Prosperi, Mattia
    Marini, Simone
    Boucher, Christina
    2024 IEEE 12TH INTERNATIONAL CONFERENCE ON HEALTHCARE INFORMATICS, ICHI 2024, 2024, : 93 - 102
  • [36] RETRACTION: Efficient Multiuser Computation for Mobile-Edge Computing in IoT Application Using Optimization Algorithm (Retraction of Vol 2021, art no 9014559, 2021)
    Hasanin, T.
    APPLIED BIONICS AND BIOMECHANICS, 2023, 2023
  • [37] Development of Efficient and Accurate Parallel Computation Algorithm Using Moving Overset Grids on Background Multi-Domains for Complex Two-Phase Flows
    Ha, Minho
    Cheong, Cheolung
    Seol, Hanshin
    Paik, Bu-Geun
    Kim, Min-Jae
    Jung, Young-Rae
    APPLIED SCIENCES-BASEL, 2018, 8 (10):
  • [38] Application of TAGE iterative algorithms to an efficient third order arithmetic average variable mesh discretization for two-point non-linear boundary value problems
    Mohanty, RK
    Khosla, N
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 172 (01) : 148 - 162
  • [39] An Efficient Implicit-Pressure/Explicit-Saturation-Method-Based Shifting-Matrix Algorithm To Simulate Two-Phase, Immiscible Flow in Porous Media With Application to CO2 Sequestration in the Subsurface
    Salama, Amgad
    Sun, Shuyu
    El-Amin, M. F.
    SPE JOURNAL, 2013, 18 (06): : 1092 - 1101
1234