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 条
  • [21] AN ALGORITHM FOR EFFICIENT COMPUTATION OF SPATIAL IMPULSE RESPONSE ON THE GPU WITH APPLICATION IN ULTRASOUND SIMULATION
    Shams, Ramtin
    Luna, Florian
    Hartley, Richard I.
    2011 8TH IEEE INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING: FROM NANO TO MACRO, 2011, : 45 - 51
  • [22] Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
    Chen, Dai-Qiang
    Zhou, Yan
    Song, Li-Juan
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2016, 42 (06) : 1287 - 1310
  • [23] Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
    Dai-Qiang Chen
    Yan Zhou
    Li-Juan Song
    Advances in Computational Mathematics, 2016, 42 : 1287 - 1310
  • [24] Computation-Efficient Distributed Algorithm for Convex Optimization Over Time-Varying Networks With Limited Bandwidth Communication
    Li, Huaqing
    Huang, Chicheng
    Wang, Zheng
    Chen, Guo
    Umar, Hafiz Gulfam Ahmad
    IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2020, 6
  • [25] Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
    Huang, Wenli
    Tang, Yuchao
    APPLIED NUMERICAL MATHEMATICS, 2020, 157 : 236 - 254
  • [26] A SIMPLE ALGORITHM FOR STRUCTURED-GRID GENERATION WITH APPLICATION TO EFFICIENT NAVIER-STOKES COMPUTATION
    TAKANASHI, S
    COMPUTERS & FLUIDS, 1991, 19 (3-4) : 393 - 399
  • [27] Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPC
    Necoara, Ion
    Clipici, Dragos
    JOURNAL OF PROCESS CONTROL, 2013, 23 (03) : 243 - 253
  • [28] An efficient adaptive window based disparity map computation algorithm by dense two frame stereo correspondence
    Shukla, Narendra Kumar
    Rathi, Vivek
    Chakka, Vijaykumar
    COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING, PROCEEDINGS, 2006, 4338 : 894 - +
  • [29] An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of petri net invariants
    Taguchi, A
    Taoka, S
    Watanabe, T
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL III: GENERAL & NONLINEAR CIRCUITS AND SYSTEMS, 2003, : 172 - 175
  • [30] An Energy-Efficient Load Balancing Algorithm to Perform Computation Type Application Processes for Virtual Machine Environments
    Enokido, Tomoya
    Takizawa, Makoto
    PROCEEDINGS 2015 18TH INTERNATIONAL CONFERENCE ON NETWORK-BASED INFORMATION SYSTEMS (NBIS 2015), 2015, : 32 - 39
1234