DocumentCode :
2077225
Title :
The alpha-Embracing Contour
Author :
Abellanas, Manuel ; Claverol, Merce ; Matos, Ines
Author_Institution :
Dept. de Mat. Aplic., U.P.M., Madrid
fYear :
2008
fDate :
June 30 2008-July 3 2008
Firstpage :
365
Lastpage :
372
Abstract :
Every notion of depth induces a stratification of the plane in regions of points with the same depth with respect to a given set of points. The boundaries of these regions, also known as depth-contours, are an appropriate tool for data visualization and have already been studied for some depths like Turkey depth [5, 9, 10, 11] and Delaunay depth [3, 8]. The contours also have applications in quality illumination as is the case of good alpha-illumination [2]. The first alpha-depth contour is also known as the alpha-embracing contour. We prove that the first alpha-depth contour has linear size and we give an algorithm to compute it that runs in O(n2 log n) time and O(n2)space.
Keywords :
computational complexity; computational geometry; data visualisation; Delaunay depth; Turkey depth; alpha-embracing contour; data visualization; depth-contours; quality illumination; Data visualization; Distributed computing; Lighting; Q measurement; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Sciences and Its Applications, 2008. ICCSA '08. International Conference on
Conference_Location :
Perugia
Print_ISBN :
978-0-7695-3243-1
Type :
conf
DOI :
10.1109/ICCSA.2008.36
Filename :
4561241
Link To Document :
بازگشت