View planning as a set covering problem

Download
  1. (PDF, 399 KB)
DOIResolve DOI: http://doi.org/10.4224/8913444
AuthorSearch for: ; Search for: ; Search for:
TypeTechnical Report
Subjectview planning; range sensors; object reconstruction; inspection; geometric modeling; model specification
AbstractA new theoretical framework for the view planning problem is presented. In this framework, view planning is defined as an instance of the well-known set covering problem from the field of combinatorial optimization. We include an image-based registration constraint and express the result in the form of an integer programming problem.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number44892
NPARC number8913444
Export citationExport as RIS
Report a correctionReport a correction
Record identifier9c1f54cc-7112-445d-a309-4b8a15b6d005
Record created2009-04-22
Record modified2016-06-14
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)