An efficient simplification method for point cloud based on salient regions detection

DOI10.1051/ro/2018082zbMath1446.65014OpenAlexW2890864077WikidataQ129208652 ScholiaQ129208652MaRDI QIDQ5242353

Abdul Rahman El Sayed, Adnan Yassine, Hassan Alabboud, Abdallah El Chakik

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018082

zbMATH Keywords

saliency3D object processing3D point clouds segmentation3D point clouds simplificationpoints clouds

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational issues in computer and robotic vision (65D19)

Uses Software

• Metro

Cites Work

• Curvature estimation of point set data based on the moving-least square surface
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Multidimensional binary search trees used for associative searching

This page was built for publication: An efficient simplification method for point cloud based on salient regions detection