Abstract
A new model-driven heuristic-search algorithm is presented that extracts a connected line drawing from a perspective view of a polyhedron. A main feature of the algorithm is that the search is concentrated in local areas centered at corners found with a special corner finder. Therefore, the search time is significantly reduced and so are the positional errors in the extracted line drawing. An iterative process (which uses the a priori knowledge contained in a world model) removes the false corners and lines and thus guarantees that the algorithms will work stably and reliably even in a noisy environment. Experimental results are presented.
Original language | English (US) |
---|---|
Title of host publication | Unknown Host Publication Title |
Publisher | IEEE |
Pages | 192-198 |
Number of pages | 7 |
ISBN (Print) | 081860624X |
State | Published - 1984 |
ASJC Scopus subject areas
- Engineering(all)