A Method of Connecting Two Planner Shapes to Minimize the Region Lying between Them

Toyohiko HAYASHI; Kiyoshi ISHIOKA

A Method of Connecting Two Planner Shapes to Minimize the Region Lying between Them

Toyohiko HAYASHI, Kiyoshi ISHIOKA

Full Text Views

1

Share
Cite this

Summary :

This paper deals with the problem of connecting two planer shapes on a single boundary. This jigsaw-like problem is encountered in many fields. The previous approaches involved what is referred to as pattern matching technology, including feature extraction. Our algorithm takes a different approach, wherein we evaluate the connection of two shapes by the area remaining between them. In this algorithm, we attempted to overlap matching boundaries of two shapes, so as to minimize the region lying between them. If this region was, in fact, narrow enough, it would prove their near-perfect connection. The advantage of this particular method is that it requires no complicated feature extractions or no point-to-point correspondence between boundaries. In order to put this method to practical use, we presented an algorithm to calculate the aforementioned area regardless of shape. A computer simulation of the connection using Koch's curves as boundaries shows its efficiency.

Publication: IEICE TRANSACTIONS on Information Vol.E74-D No.12 pp.4181-4187

Publication Date: 1991/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Image Processing, Computer Graphics and Pattern Recognition

Authors

Toyohiko HAYASHI
Kiyoshi ISHIOKA

Keyword

Cite this

Copy

Toyohiko HAYASHI, Kiyoshi ISHIOKA, "A Method of Connecting Two Planner Shapes to Minimize the Region Lying between Them" in IEICE TRANSACTIONS on Information, vol. E74-D, no. 12, pp. 4181-4187, December 1991, doi: .
Abstract: This paper deals with the problem of connecting two planer shapes on a single boundary. This jigsaw-like problem is encountered in many fields. The previous approaches involved what is referred to as pattern matching technology, including feature extraction. Our algorithm takes a different approach, wherein we evaluate the connection of two shapes by the area remaining between them. In this algorithm, we attempted to overlap matching boundaries of two shapes, so as to minimize the region lying between them. If this region was, in fact, narrow enough, it would prove their near-perfect connection. The advantage of this particular method is that it requires no complicated feature extractions or no point-to-point correspondence between boundaries. In order to put this method to practical use, we presented an algorithm to calculate the aforementioned area regardless of shape. A computer simulation of the connection using Koch's curves as boundaries shows its efficiency.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e74-d_12_4181/_p

Copy

@ARTICLE{e74-d_12_4181,
author={Toyohiko HAYASHI, Kiyoshi ISHIOKA, },
journal={IEICE TRANSACTIONS on Information},
title={A Method of Connecting Two Planner Shapes to Minimize the Region Lying between Them},
year={1991},
volume={E74-D},
number={12},
pages={4181-4187},
abstract={This paper deals with the problem of connecting two planer shapes on a single boundary. This jigsaw-like problem is encountered in many fields. The previous approaches involved what is referred to as pattern matching technology, including feature extraction. Our algorithm takes a different approach, wherein we evaluate the connection of two shapes by the area remaining between them. In this algorithm, we attempted to overlap matching boundaries of two shapes, so as to minimize the region lying between them. If this region was, in fact, narrow enough, it would prove their near-perfect connection. The advantage of this particular method is that it requires no complicated feature extractions or no point-to-point correspondence between boundaries. In order to put this method to practical use, we presented an algorithm to calculate the aforementioned area regardless of shape. A computer simulation of the connection using Koch's curves as boundaries shows its efficiency.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - A Method of Connecting Two Planner Shapes to Minimize the Region Lying between Them
T2 - IEICE TRANSACTIONS on Information
SP - 4181
EP - 4187
AU - Toyohiko HAYASHI
AU - Kiyoshi ISHIOKA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 1991
AB - This paper deals with the problem of connecting two planer shapes on a single boundary. This jigsaw-like problem is encountered in many fields. The previous approaches involved what is referred to as pattern matching technology, including feature extraction. Our algorithm takes a different approach, wherein we evaluate the connection of two shapes by the area remaining between them. In this algorithm, we attempted to overlap matching boundaries of two shapes, so as to minimize the region lying between them. If this region was, in fact, narrow enough, it would prove their near-perfect connection. The advantage of this particular method is that it requires no complicated feature extractions or no point-to-point correspondence between boundaries. In order to put this method to practical use, we presented an algorithm to calculate the aforementioned area regardless of shape. A computer simulation of the connection using Koch's curves as boundaries shows its efficiency.
ER -