DocumentCode :
2002339
Title :
AHD: The alternate hierarchical decomposition of nonconvex polytopes (generalization of a convex polytope based spatial data model)
Author :
Bulbul, Rizwan ; Frank, Andrew U.
Author_Institution :
Inst. of Geoinformation & Cartography, Tech. Univ. of Vienna, Vienna, Austria
fYear :
2009
fDate :
12-14 Aug. 2009
Firstpage :
1
Lastpage :
6
Abstract :
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.
Keywords :
computational geometry; alternate hierarchical decomposition; arbitrary precision arithmetic; convex hull tree; convex polytope based spatial data model; data representation model; nonconvex polytope decomposition; recursive approach; tree structure; Application software; Arithmetic; Data models; Geometry; Motion planning; Partitioning algorithms; Pattern recognition; Robustness; Shape; Tree data structures; convex decomposition; convex hull tree; hierarchial; polygon;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Geoinformatics, 2009 17th International Conference on
Conference_Location :
Fairfax, VA
Print_ISBN :
978-1-4244-4562-2
Electronic_ISBN :
978-1-4244-4563-9
Type :
conf
DOI :
10.1109/GEOINFORMATICS.2009.5293499
Filename :
5293499
Link To Document :
بازگشت