Marching squares-based approach to finding the convex hull of a planar set of points

被引：0

作者：

Yue, Y ^{[1
]}

Maple, C ^{[1
]}

机构：

[1] Univ Luton, Dept Comp & Informat Syst, Luton LU1 3JU, Beds, England

来源：

PROCEEDINGS OF THE 8TH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1-3 | 2005年

关键词：

algorithm; convex hull; marching squares; planar set; shape analysis;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Many applications required the use of the convex hull of a finite set of geometric entities in the plane. Finding the convex hull has been a key problem in computational geometry. Although a considerable number of algorithms have been proposed since the 1960s, there are still issues associated with the effectiveness and implementation. This paper presents a practical approach applying the marching squares algorithms to the Jarvis' march for a planar set of points. The points can be obtained from practical situations, for example digitised scanned images.

引用

页码：1700 / 1703

页数：4

共 50 条

[21] An Efficient Convex Hull Algorithm Using Affine Transformation in Planar Point Set
Changyuan Xing
Zhongyang Xiong
Yufang Zhang
Xuegang Wu
Jingpei Dan
Tingping Zhang
Arabian Journal for Science and Engineering, 2014, 39 : 7785 - 7793
[22] Planning the Shortest Path in Cluttered Environments: A Review and a Planar Convex Hull-Based Approach
Masoudi, Nafiseh
Fadel, Georges M.
Wiecek, Margaret M.
JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING, 2019, 19 (04)
[23] A NEW VARIATIONAL APPROACH BASED ON LEVEL-SET FUNCTION FOR CONVEX HULL PROBLEM WITH OUTLIERS
Li, Lingfeng
Luo, Shousheng
Tai, Xue-Cheng
Yang, Jiang
INVERSE PROBLEMS AND IMAGING, 2021, 15 (02) : 315 - 338
[24] 3-Points Convex Hull Matching (3PCHM) for fast and robust point set registration
Fan, Jingfan
Yang, Jian
Lu, Feng
Ai, Danni
Zhao, Yitian
Wang, Yongtian
NEUROCOMPUTING, 2016, 194 : 227 - 240
[25] An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in Rn
An, Phan Thanh
Hoang, Nam Dung
Linh, Nguyen Kieu
NUMERICAL ALGORITHMS, 2020, 85 (04) : 1499 - 1518
[26] IMPLEMENTATION OF BOTTLENECK NON CROSS MATCHING FOR A SET OF CONVEX POINTS USING CONVEX HULL AND DEVELOPMENT OF AN IMAGE SEARCH ALGORITHIM
Sarkar, Aratrika
Sarkar, Anirban
Das Gupta, Sauvik
2014 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND APPLICATIONS (ICHPCA), 2014,
[27] AN EFFICIENT ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN THE CONVEX-HULL OF A FINITE POINT SET IN THE PLANE
MAKIMOTO, N
NAKAGAWA, I
TAMURA, A
OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 33 - 40
[28] Algorithm for Finding Minimum Volume Oriented Bounding Boxes Based on Convex Hull
Hu Z.
Qin Q.
Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences, 2019, 46 (02): : 105 - 111
[29] CH-Bin: A convex hull based approach for binning metagenomic contigs
Chandrasiri, Sunera
Perera, Thumula
Dilhara, Anjala
Perera, Indika
Mallawaarachchi, Vijini
COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2022, 100
[30] A Total Order Heuristic-Based Convex Hull Algorithm for Points in the Plane
Gomes, Abel J. P.
COMPUTER-AIDED DESIGN, 2016, 70 : 153 - 160

← 1 2 3 4 5 →