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.