Please use this identifier to cite or link to this item:
|Title:||Subdividing alpha complex|
|Authors:||Cheng, H.-L. |
|Citation:||Cheng, H.-L.,Tan, T. (2004). Subdividing alpha complex. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3328 : 186-197. ScholarBank@NUS Repository.|
|Abstract:||Given two simplicial complexes C 1 and C 2 embedded in Euclidean space ℝ d, C 1 subdivides C 2 if (i) C 1 and C 2 have the same underlying space, and (ii) every simplex in C 1 is contained in a simplex in C 2. In this paper we present a method to compute a set of weighted points whose alpha complex subdivides a given simplicial complex. Following this, we also show a simple method to approximate a given polygonal object with a set of balls via computing the subdividing alpha complex of the boundary of the object. The approximation is robust and is able to achieve a union of balls whose Hausdorff distance to the object is less than a given positive real number ε. © Springer-Verlag Berlin Heidelberg 2004.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.