Abstract
AbstractFor a given planar region P its discretization on a discrete planar point set \(\mathcal{S}\) consists of the points from \(\mathcal{S}\) which fall into P. If P is bounded with a convex polygon having n vertices and the number of points from \(P \cap \mathcal{S}\) is finite, the obtained discretization of P will be called discrete convexn-gon.In this paper we show that discrete moments having the order up to n characterize uniquely the corresponding discrete convex n-gon if the discretizing set \(\mathcal{S}\) is fixed. In this way, as an example, the matching of discrete convex n-gons can be done by comparing \(\frac{1}{2} \cdot (n + 1) \cdot (n + 2)\) discrete moments what can be much efficient than the comparison “point-by-point” since a digital convex n-gon can consist of an arbitrary large number of points.KeywordsDiscrete shapecodingmomentspattern matching
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.