A fast algorithm for constructing approximate medial axis of polygons, using Steiner points

被引：10

作者：

Smogavec, G. ^{[1
]}

Zalik, B. ^{[1
]}

机构：

[1] Univ Maribor, Fac Elect Engn & Comp Sci, SI-2000 Maribor, Slovenia

来源：

ADVANCES IN ENGINEERING SOFTWARE | 2012年 / 52卷

关键词：

Algorithms; Polygons; Medial axis; Constrained Delaunay triangulation; Steiner points; Approximation; SWEEPLINE ALGORITHM; VORONOI DIAGRAM; CONVERGENCE; SHAPE;

D O I：

10.1016/j.advengsoft.2012.05.006

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents a new algorithm for constructing the approximation of a polygon's medial axis. The algorithm works in three steps. Firstly, constrained Delaunay triangulation of a polygon is done. After that, the obtained triangulation is heuristically corrected by inserting Steiner points. Finally, the obtained triangles are classified into three classes, thus enabling the construction of the polygon's medial axis. As shown by experiments, the obtained approximate polygon medial axis has better properties than those methods based on a Voronoi diagram. (c) 2012 Elsevier Ltd. All rights reserved.

引用

页码：1 / 9

页数：9

共 50 条

[21] Fast estimation for generalised multivariate joint models using an approximate EM algorithm
Murray, James
Philipson, Pete
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2023, 187
[22] Multi-hop Routing Algorithm Using Steiner Points for Reducing Energy Consumption in Wireless Sensor Networks
Rezaei, Elham
Baradaran, Amir Abbas
Heydariyan, Atefeh
WIRELESS PERSONAL COMMUNICATIONS, 2016, 86 (03) : 1557 - 1570
[23] Multi-hop Routing Algorithm Using Steiner Points for Reducing Energy Consumption in Wireless Sensor Networks
Elham Rezaei
Amir Abbas Baradaran
Atefeh Heydariyan
Wireless Personal Communications, 2016, 86 : 1557 - 1570
[24] Quassi Lossless Motion Estimation Algorithm Using Fast Elimination of Checking Points
Kim, Jong-Nam
Kim, Won-Hee
Jung, Tae-Il
2011 DATA COMPRESSION CONFERENCE (DCC), 2011, : 461 - 461
[25] Fast algorithm of DFT with only a subset of input or output points using GFFT
Sun, Shixin
Zheng, Wenxue
Dianzi Keji Daxue Xuebao/Journal of University of Electronic Science and Technology of China, 26 (06): : 627 - 631
[26] Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points
Sun, Zhongwei
Hu, Keyong
Hu, Tong
Liu, Jing
Zhu, Kai
IEEE ACCESS, 2018, 6 : 42319 - 42326
[27] A fast Approximate Joint Diagonalization algorithm using a criterion with a block diagonal weight matrix
Tichavsky, Petr
Yeredor, Arie
Nielsen, Jan
2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 3321 - +
[28] Fast Extended One-Versus-Rest Multi-label SVM Classification Algorithm Based on Approximate Extreme Points
Sun, Zhongwei
Guo, Zhongwen
Wang, Xupeng
Liu, Jing
Liu, Shiyong
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT I, 2017, 10177 : 265 - 278
[29] Fast Monostatic RCS Computation Using the Near-Field Sparse Approximate Inverse and the Multilevel Fast Multipole Algorithm
Delgado, Carlos
Catedra, Felipe
APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL, 2020, 35 (07): : 735 - 741
[30] Nested Iterative Solutions of Electromagnetic Problems Using Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can
Ucuncu, Arif
Karaosmanoglu, Bariscan
Ergul, Ozgur
2017 11TH EUROPEAN CONFERENCE ON ANTENNAS AND PROPAGATION (EUCAP), 2017, : 1109 - 1112

← 1 2 3 4 5 →