| Download | - View final version: View planning as a set covering problem (PDF, 613 KiB)
|
|---|
| DOI | Resolve DOI: https://doi.org/10.4224/8913444 |
|---|
| Author | Search for: Scott, William; Search for: Roth, Gerhard; Search for: Rivest, J.-F. |
|---|
| Format | Text, Technical Report |
|---|
| Subject | view planning; range sensors; object reconstruction; inspection; geometric modeling; model specification; détecteurs de distance; reconstitution d'objets; inspection; modélisation géométrique; spécification de modèle |
|---|
| Abstract | A 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 | 2001 |
|---|
| Language | English |
|---|
| NRC number | NRCC 44892 |
|---|
| NPARC number | 8913444 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 9c1f54cc-7112-445d-a309-4b8a15b6d005 |
|---|
| Record created | 2009-04-22 |
|---|
| Record modified | 2020-05-27 |
|---|
