Robust convex decomposition, RCD, of polytopes is the convex decomposition of nonconvex polytopes using algorithms whose implementation is based on arbitrary precision arithmetic. Decomposing nonconvex polytopes using RCD can make the data representation model consistent enabling generalization with level of detail. Our approach, alternate hierarchical decomposition, AHD, for the decomposition of nonconvex polytopes with arbitrary genus, is a recursive approach whose implementation is robust, efficient and scalable to any dimension. Our approach decomposes the given nonconvex polytope with arbitrary genus into a set of component convex hulls, which are represented hierarchically in a tree structure, convex hull tree, CHT.
|Title of host publication||2009 17th International Conference on Geoinformatics|
|Publication status||Published - 12 Aug 2009|
|Event||17th International Conference on Geoinformatics - CSISS, George Mason University, Fairfax, United States|
Duration: 12 Aug 2009 → 14 Aug 2009
|Conference||17th International Conference on Geoinformatics|
|Period||12/08/09 → 14/08/09|