Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search.

Saved in:

Bibliographic Details
Title:	Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search.
Authors:	Ishikawa, Seiji¹
Source:	Systems & Computers in Japan. Jan1986, Vol. 17 Issue 1, p44-52. 9p.
Subjects:	LINDA (Computer system), Optical pattern recognition, Newton diagrams, Heuristic programming, Computer systems
Geographic Terms:	Japan
Abstract:	This paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number el all sides on a line drawing of a polyhedron; and the difference between the minimum `and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring re the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed. [ABSTRACT FROM AUTHOR]
	Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	This paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number el all sides on a line drawing of a polyhedron; and the difference between the minimum `and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring re the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed. [ABSTRACT FROM AUTHOR]
ISSN:	08821666
DOI:	10.1002/scj.4690170106