Cai, Shuxian, Cao, Juan, Deng, Bailin ![]() ![]() |
![]() |
PDF
- Published Version
Available under License Creative Commons Attribution Non-commercial. Download (5MB) |
Abstract
Sharp feature lines provide critical structural information in 3D models and are essential for geometric processing. However, the performance of existing algorithms for extracting feature lines from point clouds remains sensitive to the quality of the input data. This paper introduces an algorithm specifically designed to extract feature lines from 3D point clouds. The algorithm calculates the winding number for each point and uses variations in this number within edge regions to identify feature points. These feature points are then mapped onto a cuboid structure to obtain key feature points and capture neighboring relationships. Finally, feature lines are fitted based on the connectivity of key feature points. Extensive experiments demonstrate that this algorithm not only accurately detects feature points on potential sharp edges, but also outperforms existing methods in extracting subtle feature lines and handling complex point clouds.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Schools > Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
Publisher: | Elsevier |
ISSN: | 1524-0703 |
Date of First Compliant Deposit: | 15 August 2025 |
Date of Acceptance: | 29 July 2025 |
Last Modified: | 18 Aug 2025 14:01 |
URI: | https://orca.cardiff.ac.uk/id/eprint/180447 |
Actions (repository staff only)
![]() |
Edit Item |