New algorithm for medial axis transform of plane domain

摘要: Abstract In this paper, we present a new approximate algorithm for medial axis transform of plane domain. The underlying philosophy our approach is the localization idea based on Domain Decomposition Lemma, which enables us to break up complicated domain into smaller and simpler pieces. We then develop tree data structure various operations it keep track information produced by decomposition procedure. This strategy isolate important points such as branch terminal points. Because guarantees existence points—in fact, devised with in mind—we can zoom those makes efficient. Our “from within” approach, whereas traditional methods use “from-the-boundary” approach. nature scheme help mitigate instability phenomena, thereby making reasonably robust.