A novel algorithm for extracting the boundaries of two planar curves' morphologic summation

Authors:
WenYu Liu;HaiRong Liu
Affiliations:
Dept. of Electronics & Information Engineering, Huazhong University of Science & Technology, Wuhan, P.R. China;Dept. of Electronics & Information Engineering, Huazhong University of Science & Technology, Wuhan, P.R. China
Venue:
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
Year:
2006

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
A solution of polygon containment, spatial planning, and other related problems using minkowski operations

Computer Vision, Graphics, and Image Processing
An algebra of polygons through the notion of negative shapes

CVGIP: Image Understanding
Polynomial/rational approximation of Minkowski sum boundary curves

Graphical Models and Image Processing
The Minkowski Sum of Two Simple Surfaces Generated by Slope-Monotone Closed Curves

GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the morphologic summation of two curves is studied and its parametric equation is obtained. Because the morphologic summation is usually a region that not convenient to analyze and to use, we turn to research its boundaries and found a super set of the boundaries by solving the Jacobi determinant equation. In our method, the super set consists of several sub-curves and the corresponding parametric equation of each sub-curve can be obtained. As the super set includes the real boundaries and the pseudo boundaries, we propose a method of removing the pseudo boundaries real. To avoid the complicated computation, based on the geometric meanings of the boundaries, an approximate algorithm is also applied. Experimental results show that the approximate boundaries are very close to the real boundaries and the computational cost is low.