Computing the domain of a digital curve.

Title: Computing the domain of a digital curve.
Identifier: AAI3024828
identifier: 3024828
Creator: Robinson, Jonathan.
Contributor: Adviser: Robert Goldberg
Date: 2001
Language: English
Publisher: City University of New York.
Subject: Computer Science
Abstract: In this thesis we offer a methodology for computing the domain, the set of all estimates that would digitize to a digital curve. For line segments, this is accomplished using convex hulls and an extension of the convex hull: the infinite hull. By incorporating the alpha-hull, introduced by Edelsbrunner (1983), these results can be extended to compute the domain of digital circular arcs where the radius is known. We claim that similar results can be found when computing the domain of a standard elliptical digital curve by using the alpha,beta-infinite hull that we introduce. These algorithms exhibit linear time during experimentation.;We then propose an algorithm that computes a digital circular arc's (circular) domain, under all radii. This algorithm is further applied to find the standard elliptical domain of standard elliptical digital curves under all radii. Both algorithms exhibit an O(n) run time where n is the number of pixels in the digital curve. The approach used by the algorithm is then extended to compute the domain for gray scale images.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.