Browsing School of Computing Graduate Theses by Author "Rappaport, David"
Now showing items 111 of 11

Algorithms for Sequence Similarity Measures
Mohamad, Mustafa Amid (20101117)Given two sets of points $A$ and $B$ ($A = m$, $B = n$), we seek to find a minimumweight manytomany matching which seeks to match each point in $A$ to at least one point in $B$ and vice versa. Each matched pair (an ... 
Distances Between Languages: Algorithms and Descriptional Complexity
Ng, TimothyWe consider the descriptional complexity of neighbourhoods of regular languages and the computational complexity of computing the distance between languages. Distance measures are defined on words to describe their similarity. ... 
Efficient algorithms for beacon routing in polygons
Kouhestani, BahramIn a paper by Biro et al. [7], a novel twist on guarding in art galleries is introduced. A beacon is a fixed point with an attraction pull that can move points within the polygon. Points move greedily to monotonically ... 
A Hybrid Holefilling Algorithm
Long, Junhui (20130912)A polygon mesh, or a 3D mesh, consisting of a collection of vertices, edges, and polygons in threedimensional space, is the standard way of representing 3D objects. In practice, polygon meshes acquired from the 3D scanning ... 
Lossless Triangle Mesh Compression
Zhu, Junjie (20130729)Triangle meshes have been widely used in many fields such as digital archives, computerassisted design and in the game industry. The topic we are particularly interested is triangle mesh compression for fossil models. ... 
Minimum Perimeter Convex Hull of a Set of Line Segments: An Approximation
Hassanzadeh, Farzad (20081209)The problem of finding the convex hull of a set of points in the plane is one of the fundamental and wellstudied problems in Computational Geometry. However, for a set of imprecise points, the convex hull problem has not ... 
New Algorithms for 3D Registration Using Raw Point Techniques
Mohamad, MustafaRegistration of two 3D point clouds is a problem encountered in many domains in 3D computer vision. A correct correspondence between the overlapping portions of the point clouds can be used to generate a transform that ... 
Problems on Geometric Graphs with Applications to Wireless Networks
Nunez Rodriguez, Yurai (20091126)It is hard to imagine the modern world without wireless communication. Wireless networks are, however, challenging inasmuch as they are useful. Because of their complexity, wireless networks have introduced a myriad of ... 
QChopper  Segmentation of Large Surface Meshes for 3D Printing
Nicholson, Myles (20160205)3D printers are becoming an evercheaper way to prototype or reproduce objects. There are difficulties that arise when attempting to reproduce very large objects with a 3D printer. Printers have a limited volume that they ... 
Reconstruction of Heterogeneous Scattering Media
Cecchetto, BenjaminA scattering medium is a material in which light does not travel in straight paths. The light travels a certain distance, changes direction, and has a chance of being absorbed by the medium. Three coefficients and a phase ... 
Track Persistence in Wireless Sensor Networks
Bentley, Ian (20100909)In this thesis we directly consider an object tracking problem for wireless sensor networks (WSNs), called track persistence. Track persistence temporally extends the problem of object tracking by seeking to store and ...