Multiscale Discrete Geometry
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.
Type
Publication
Proc. International Conference on Discrete Geometry for Computer Imagery (DGCI2009), Montréal, Québec, volume 5810 of Lecture Notes in Computer Science, 118-131, 2009. Springer
Multiscale Geometry
Digital Contour
Digital Straightness
Digital Straight Segment Recognition
Stern-Brocot Tree
Multi-Resolution
Digital Geometry
Authors
Professor of Computer Science
My research interests include digital geometry, geometry processing, image analysis, variational models and discrete calculus.