Abstract
This paper presents a first step in analyzing how digital shapes behave with respect to multiresolution. We first present an analysis of the covering of a standard digital straight line by a multi-resolution grid. We then study the multi-resolution of Digital Straight Segments (DSS): we provide a sublinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for computing a multiscale representation of a digital shape, based only on a DSS decomposition of its boundary. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Said, M., Lachaud, J. O., & Feschet, F. (2009). Multiscale discrete geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 118–131). https://doi.org/10.1007/978-3-642-04397-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
