VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization

Simple item page
dc.contributor.authorXiong, Biaoen_US
dc.contributor.authorZhang, LongJunen_US
dc.contributor.authorHuang, Ruiqien_US
dc.contributor.authorZhou, Junweien_US
dc.contributor.authorJafri, Syed Riaz un Nabien_US
dc.contributor.authorWu, Bojianen_US
dc.contributor.authorLi, Fashuaien_US
dc.contributor.editorChristie, Marcen_US
dc.contributor.editorHan, Ping-Hsuanen_US
dc.contributor.editorLin, Shih-Syunen_US
dc.contributor.editorPietroni, Nicoen_US
dc.contributor.editorSchneider, Teseoen_US
dc.contributor.editorTsai, Hsin-Rueyen_US
dc.contributor.editorWang, Yu-Shuenen_US
dc.contributor.editorZhang, Eugeneen_US
dc.date.accessioned2025-10-07T06:04:16Z
dc.date.available2025-10-07T06:04:16Z
dc.date.issued2025
dc.description.abstractViewpoint planning is critical for efficient 3D data acquisition in applications such as 3D reconstruction, building life-cycle management, navigation, and interior decoration. However, existing methods often neglect key optimization objectives specific to static LiDAR systems, resulting in redundant or disconnected viewpoint networks. The viewpoint planning problem (VPP) extends the classical Art Gallery Problem (AGP) by requiring full coverage, strong registrability, and coherent network connectivity under constrained sensor capabilities. To address these challenges, we introduce a novel Visibility Field (VF) that accurately captures the directional and range-dependent visibility properties of static LiDAR scanners. We further observe that visibility information naturally converges onto a 1D skeleton embedded in the 2D space, enabling significant searching space reduction. Leveraging these insights, we develop a greedy optimization algorithm tailored to the VPP, which constructs a minimal yet fully connected Viewpoint Network (VPN) with low redundancy. Experimental evaluations across diverse indoor and outdoor scenarios confirm the scalability and robustness of our method. Compared to expert-designed VPNs and existing state-of-the-art approaches, our algorithm achieves comparable or fewer viewpoints while significantly enhancing connectivity. In particular, it reduces the weighted average path length by approximately 95%, demonstrating substantial improvements in compactness and structural efficiency. Code is available at https://github.com/xiongbiaostar/VFPlan.en_US
dc.description.sectionheaders3D Reconstruction
dc.description.seriesinformationPacific Graphics Conference Papers, Posters, and Demos
dc.identifier.doi10.2312/pg.20251289
dc.identifier.isbn978-3-03868-295-0
dc.identifier.pages15 pages
dc.identifier.urihttps://doi.org/10.2312/pg.20251289
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/pg20251289
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCCS Concepts: Theory of computation → Computational geometry
dc.subjectTheory of computation → Computational geometry
dc.titleVF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimizationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
pg20251289.pdf
Size:
5.69 MB
Format:
Adobe Portable Document Format
Download
Collections
PG2025 Conference Papers, Posters, and Demos