single-rb.php

JRM Vol.2 No.1 pp. 59-65
doi: 10.20965/jrm.1990.p0059
(1990)

Development Report:

Algorithm for Automatic Generation of Boundary Lines

Sadahiko Nagae* and Chiaki Ohta**

*Professor, Arts and Cultural Studies, School of Literature, Kinki University, 3-41, Kowakae, Osaka 577, Japan

**Part-time instructor, Temma Campus, Branch School in Japan, Philips University, 2-21, Nishiki-cho, Kita-ku, Osaka Japan

Published:
February 20, 1990
Abstract

It may be supposed that the development of an algorithm capable of automatically generating boundary lines among parts for designing IC diagrams and automatic recognition of intervals among parts as well as mapping is widely desired in different industrial sectors. The most basic, effective solution conceivable will be image analysis using an ITV camera. The authors, however, tried to develop an algorithm capable of automatically generating boundary lines which would not interfere with one another using a great number of profiles comprising, in principle, polygons based on vector input data. It is not that this enables every boundary line between graphics to be automatically generated with good precision, but a result has been obtained which can appropriately be applied to roughly calculating the living space in a floor plan, and dividing structures for land use status drawing on a scale of about 1 to 2500. It can also be used for designing wiring drawings among parts. It is conceivable that the utilization of the results of this research will enable the algorithm to be used for graphic recognition by image processing. The following are the proposed problem, definitions, and a detailed description of the algorithm leading to a solution.

Cite this article as:
S. Nagae and C. Ohta, “Algorithm for Automatic Generation of Boundary Lines,” J. Robot. Mechatron., Vol.2, No.1, pp. 59-65, 1990.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, IE9,10,11, Opera.

Last updated on Sep. 09, 2019