Model-based view planning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A Lagrangian-based heuristic for large-scale set covering problems
- A genetic algorithm for the set covering problem
- Algorithms for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- On the Greedy Heuristic for Continuous Covering and Packing Problems
- Why aspect graphs are not (yet) practical for computer vision
Cited in
(7)- Towards fully automated inspection of large components with UAVs: offline path planning and view angle dependent optimization strategies
- Information theoretic approaches for next best view planning in active computer vision
- Cone visibility decomposition of freeform surfaces.
- scientific article; zbMATH DE number 2040629 (Why is no real title available?)
- CAD-based path planning for 3-D line laser scanning.
- Planning of clarifying observations for the controlling of overhead transmission lines based on laser scanning
- Optimized sensor placement for active visual inspection
This page was built for publication: Model-based view planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008495)