Automating adaptive scan planning for static laser scanning in complex 3D environments
Bibliographic record
Abstract
Laser scanning is increasingly important for applications in the built environment and requires efficient planning for effective data collection. The conventional process is a time-consuming and repetitive manual task, presenting a strong case for automation. This paper introduces a novel method for scan planning in complex 3D environments, overcoming the limitations of existing approaches. It accepts any 3D model or point cloud as input by processing them as triangulated meshes. The method involves automated steps of mesh processing, viewpoint candidate generation, and evaluations of visibility and coverage. It facilitates optimized planning for static laser scanning missions by selecting appropriate viewpoints while considering targetless registration needs. Our method can handle uniform coverage requirements and specific local requirements. It is rigorously tested through method comparisons and extensive parameter studies and applied to several scenes, including a comparison to scan strategies manually created by laser scanning experts, demonstrating its practical applicability. • A novel method for automated planning of static laser scanning in complex 3D environments • Identifies efficient scanning strategies with suitable locations and sequence in the scene • Works based on a triangulated mesh representation that can be derived from any 3D scene • Deterministic evaluation of occlusions, incidence angles, point densities, and overlaps • Achieves better coverage and efficiency than manual solutions provided by experts.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".