日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

成果報告書

The Offset Filtration of Convex Objects

MPS-Authors
/persons/resource/persons44759

Kerber,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)

arXiv:1407.6132.pdf
(プレプリント), 602KB

付随資料 (公開)
There is no public supplementary material available
引用

Halperin, D., Kerber, M., & Shaharabani, D. (2014). The Offset Filtration of Convex Objects. Retrieved from http://arxiv.org/abs/1407.6132.


引用: https://hdl.handle.net/11858/00-001M-0000-0024-4771-2
要旨
We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested simplicial complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based on the Voronoi partition with respect to the given convex objects. The size of the filtration and the time complexity for computing it are proportional to the size of the Voronoi diagram and its time complexity, respectively. Our approach is inspired by alpha-complexes for point sets, but requires more involved machinery and analysis primarily since Voronoi regions of general convex objects do not form a good cover. We show by experiments that our approach results in a similarly fast and topologically more stable method for computing a filtration compared to approximating the input by a point sample.