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

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Liu, W. Y., & Liu, H. R. (2006). A novel algorithm for extracting the boundaries of two planar curves’ morphologic summation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3942 LNCS, pp. 962–969). Springer Verlag. https://doi.org/10.1007/11736639_118

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free