Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CCCG 2009, Vancouver, BC, August 1719, 2009 A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
 

Summary: CCCG 2009, Vancouver, BC, August 1719, 2009
A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
Michael D. Adams
Abstract
Two fully-dynamic Delaunay triangulation methods,
which differ in their point-location strategies, are pro-
posed. One method is derived from the (bucket-based)
BucketInc scheme of Su and Drysdale. The other is
a new method based on a quadtree partitioning of the
triangulation domain. The two methods are compared
experimentally, and their relative merits discussed.
1 Introduction
For the application of image compression, there has
been a growing interest in image representations based
on arbitrary sampling (i.e., sampling at an arbitrary
subset of points from a lattice) [2, 1]. Frequently, such
representations are formed by constructing a Delaunay
triangulation (DT) of a subset of the sample points and
then generating an interpolant over each face of the
resulting DT. Since images are usually sampled on a

  

Source: Adams, Michael D. - Department of Electrical and Computer Engineering, University of Victoria

 

Collections: Engineering