cs.ROOct 27, 2026

Ground Sample Distance Constrained k-Coverage Viewpoint Planning via Set Multi-Cover Formulation

Authors: Waleed Bin Khalid, Chul Min Yeum

Organizations: Luddy School of Informatics, Computing, and Engineering, Indiana University Bloomington, IN, USA. · Civil and Environmental Engineering, University of Waterloo, ON, Canada.

Abstract

Drone-based 3D reconstruction and inspection require viewpoints that satisfy image-quality constraints while observing each surface region multiple times, which overlap-based planning heuristics do not guarantee. We study ground sample distance (GSD)-constrained kk-coverage viewpoint selection for structures represented by surface voxels. Candidate viewpoints are generated along outward surface directions, screened with distance, viewing-angle, field-of-view, and occlusion tests, and augmented for voxels with insufficient visibility. Selection is then posed as set multi-cover with per-voxel coverage demands. We propose a dynamically weighted greedy heuristic that prioritizes remaining coverage deficits and scarce viewing alternatives, and compare it with sequential overlap-based pruning and an integer linear programming (ILP) formulation on the same candidate pools. Across two structures, four voxel resolutions, and three coverage requirements, the proposed approach achieves full or near-full kk-coverage with compact viewpoint sets, using only 3.00--16.39% more viewpoints than ILP while offering an interpretable selection process based on coverage deficits and viewpoint availability.

Figures & tables

Explore similar work

Apr 6, 2026

Coverage Optimization for Camera View Selection

What makes a good viewpoint? The quality of the data used to learn 3D reconstructions is crucial for enabling efficient and accurate scene modeling. We study the active view selection problem and develop a principled analysis that yields a simple and interpretable criterion for selecting informative camera poses. Our key insight is that informative views can be obtained by minimizing a tractable approximation of the Fisher Information Gain, which reduces to favoring viewpoints that cover geometry that has been insufficiently observed by past cameras. This leads to a lightweight coverage-based view selection metric that avoids expensive transmittance estimation and is robust to noise and training dynamics. We call this metric COVER (Camera Optimization for View Exploration and Reconstruction). We integrate our method into the Nerfstudio framework and evaluate it on real datasets within fixed and embodied data acquisition scenarios. Across multiple datasets and radiance-field baselines, our method consistently improves reconstruction quality compared to state-of-the-art active view selection methods. Additional visualizations and our Nerfstudio package can be found at https://chengine.github.io/nbv_gym/.
May 6, 2026

A Bayesian Approach for Task-Specific Next-Best-View Selection with Uncertain Geometry

We develop a framework for task-specific active next-best-view selection in 3D reconstruction from point clouds, by casting the problem in the language of Bayesian decision theory. Our framework works by (a) placing a prior distribution over the space of implicit surfaces, (b) using recently-developed stochastic surface reconstruction methods to calculate the resulting posterior distribution, then (c) using the posterior distribution to carefully reason about which view to scan next. This enables us to perform camera selection in a manner that is directly optimized for the intended use of the reconstructed data - meaning, we reduce uncertainty only in those regions that make a difference in the task at hand, as opposed to prior approaches that reduce it uniformly across space. We evaluate our method across three distinct downstream tasks: semantic classification, segmentation, and PDE-guided physics simulation. Experimental results demonstrate that our framework achieves superior task performance with fewer views compared to commonly used baselines and prior general uncertainty-reduction techniques.
Aug 6, 2026

Iterative Hybrid Discrete-Continuous Viewpoint Planning for UAV Photogrammetry

Unmanned aerial vehicle (UAV) photogrammetry requires camera networks that provide sufficient surface coverage, image overlap, parallax, and resolution, yet conventional flight patterns are often poorly adapted to scene geometry resulting in local reconstruction errors. This paper proposes an iterative hybrid discrete-continuous viewpoint planning method for targeted UAV photogrammetry from a proxy reconstruction. The method scores sampled surface points using photogrammetric heuristics based on frontality, imaging distance, parallax, and multi-view observation count, while also evaluating the full viewpoint set in terms of visibility, pairwise overlap, and graph connectivity. Candidate viewpoints are generated around weakly observed regions, refined using clustered Covariance matrix adaptation evolution strategy (CMA-ES) optimisation, and removed when redundant. The final flight path combines close-range detail viewpoints with wider model-coverage viewpoints, balancing local reconstruction quality with global image-network robustness. Evaluation on three synthetic scenes shows that the proposed method improves both reconstruction accuracy and completeness compared with prior UAV path-planning methods.