ACM Home Page
Please provide us with feedback. Feedback
Delaunay triangulations approximate anchor hulls
Full text PdfPdf (962 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Vancouver, British Columbia
SESSION: Session 11C table of contents
Pages: 1028 - 1037  
Year of Publication: 2005
ISBN:0-89871-585-7
Authors
Tamal K. Dey  The Ohio State U., Columbus, Ohio
Joachim Giesen  Theoretische Informatik, ETH Zürich, Switzerland
Samrat Goswami  The Ohio State U., Columbus, Ohio
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
: SIAM Activity Group on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding question for the dual Delaunay triangulation is not addressed in the literature. We show that, for two dimensional shapes, the Delaunay triangulation approximates a specific structure which we call anchor hulls. As an application we demonstrate that our approximation result is useful for the problem of shape matching.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Alt and L. J. Guibas. Discrete geometric shapes: matching, interpolation, and approximation: a survey. Tech. report B 96-11, EVL-1996-142, Institute of Computer Science, Freie Universität Berlin, 1996.
 
2
 
3
N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discr. Comput. Geom.22 (1999), 481--504.
 
4
N. Amenta, S. Choi and R. Kolluri. The power crust, union of balls, and the medial axis transform. Comput. Geom. Theory Appl.19 (2001), 127--153.
 
5
6
 
7
J.-D. Boissonnat and F. Cazals. Natural neighbor coordinates of points on a surface. Comput. Geom. Theory Appl.19 (2001), 87--120.
 
8
 
9
H. I. Choi, S. W. Choi and H. P. Moon. Mathematical theory of medial axis transform. Pacific J. Mathematics181 (1997), 57--88.
 
10
T. K. Dey. Curve and surface reconstruction. Chapter in Handbook on Discrete and Computational Geometry, J. Goodman and J. O'Rourke eds. CRC press, 2nd edition, (2004), 677--692.
 
11
T. K. Dey, Sample based geometric modeling. AMS/DIMACS volume on Computer-aided Design and Manufacturing, D. Dutta, M. Smid and R. Janardan eds., to appear.
 
12
T. K. Dey, J. Giesen and S. Goswami. Shape segmentation and matching with flow discretization. Proc. Workshop Algorithms Data Structures (WADS03) (2003), LNCS 2748, F. Dehne, J.-R. Sack and M. Smid eds., 25--36.
 
13
 
14
J. Erickson. Uniform samples of generic surfaces have nice Delaunay triangulations (2003), Manuscript.
 
15
P. M. Gruber. Aspects of approximation of convex bodies. Handbook of Convex Geometry, P. M. Gruber and J. M. Wills eds., North Holland, Amsterdam (2003), 319--345.
 
16
17
Collaborative Colleagues:
Tamal K. Dey: colleagues
Joachim Giesen: colleagues
Samrat Goswami: colleagues