Multiresolution by Repeated Invertible Averaging - With Applications in Digital Earth

Alderson, Troy F.

Multiresolution by Repeated Invertible Averaging - With Applications in Digital Earth

dc.contributor.advisor	Samavati, Faramarz
dc.contributor.author	Alderson, Troy F.
dc.contributor.committeemember	Stefanakis, Emmanuel
dc.contributor.committeemember	Akleman, Ergun
dc.contributor.committeemember	Prusinkiewicz, Przemysław W.
dc.contributor.committeemember	Alim, Usman R.
dc.date	2020-06
dc.date.accessioned	2019-11-27T18:09:44Z
dc.date.available	2019-11-27T18:09:44Z
dc.date.issued	2019-11
dc.description.abstract	In this thesis, we present a general-purpose, arbitrary-degree framework for the multiscale representation of various types of graphics objects. These include curves in Euclidean and non-Euclidean spaces (particularly the surfaces of spheres and ellipsoids) as well as polygonal mesh surfaces. The core framework, which operates on curves, is based on simple yet fundamental modifications to the Lane-Riesenfeld algorithm and its generalizations. The algorithm’s averaging step is replaced with invertible variants, defining a repeated invertible averaging approach that supports a class of subdivision and reverse subdivision methods (including those that produce B-Spline curves). These averaging steps and their inverses are defined in terms of sequences of two-point interpolations between neighbouring vertices, which can be easily generalized to several different spaces and manifolds. In addition to developing this core framework, we explore different applications and generalizations of the approach. In particular, we concentrate on applications to Digital Earth, where spherical and ellipsoidal curves can be used to represent geospatial vectors (e.g. nation boundaries, road networks). We use multiscale representations of geospatial vector data to develop fast algorithms for offsetting queries and inside/outside tests. A fast offsetting algorithm for rasterized vectors in a DGGS is also presented. Generalizations of the approach include a modification that allows our framework to produce multiscale NURBS curves on the sphere and ellipsoid. This is accomplished by incorporating vertex weights into the interpolation parameters of individual operations, preserving the framework's generalizability. We additionally present a generalization of our framework to the multiscale representation of polygonal meshes. Similarly to the curve case, our framework for surfaces is defined in terms of local mesh operations that involve only direct vertex neighbours. Smooth reverse and non-uniform surface subdivisions are additionally supported.	en_US
dc.identifier.citation	Alderson, T. F. (2019). Multiresolution by Repeated Invertible Averaging - With Applications in Digital Earth (Doctoral thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.	en_US
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/37274
dc.identifier.uri	http://hdl.handle.net/1880/111254
dc.language.iso	eng	en_US
dc.publisher.faculty	Science	en_US
dc.publisher.institution	University of Calgary	en
dc.rights	University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.	en_US
dc.subject	Multiresolution	en_US
dc.subject	Subdivision	en_US
dc.subject	Reverse Subdivision	en_US
dc.subject	Digital Earth	en_US
dc.subject.classification	Computer Science	en_US
dc.title	Multiresolution by Repeated Invertible Averaging - With Applications in Digital Earth	en_US
dc.type	doctoral thesis	en_US
thesis.degree.discipline	Computer Science	en_US
thesis.degree.grantor	University of Calgary	en_US
thesis.degree.name	Doctor of Philosophy (PhD)	en_US
ucalgary.item.requestcopy	true	en_US