Abstract | ||
---|---|---|
Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1109/SYNASC.2006.30 | SYNASC |
Keywords | Field | DocType |
n dimensional irregular pyramid,primitive topological configuration,combinatorial map,hierarchical structure,possible configuration,possible application,existing work,minimal configuration,primitive operation,data structures,computational geometry | Topology,Discrete mathematics,Data structure,Algebra,Combinatorial map,Computer science,Computational geometry,Torus,Simplex,Hierarchy | Conference |
ISBN | Citations | PageRank |
0-7695-2740-X | 0 | 0.34 |
References | Authors | |
13 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Adrian Ion | 1 | 222 | 21.11 |
Thomas Illetschko | 2 | 6 | 0.83 |
Yll Haxhimusa | 3 | 233 | 20.26 |
Walter G. Kropatsch | 4 | 896 | 152.91 |