EdgeCrack: A parallel Divide-and-Conquer algorithm for building a topological data structure

2013 ◽  
pp. 113-122
Keyword(s):  
Data Structure ◽  
Divide And Conquer ◽  
Divide And Conquer Algorithm ◽  
Topological Data Structure ◽  
Topological Data

An object-oriented framework for finite element analysis based on a compact topological data structure

2014 ◽  
Vol 68 ◽  
pp. 40-48 ◽  
Author(s):  
Lauren L. Beghini ◽  
Anderson Pereira ◽  
Rodrigo Espinha ◽  
Ivan F.M. Menezes ◽  
Waldemar Celes ◽  
...  
Keyword(s):  
Finite Element Analysis ◽  
Finite Element ◽  
Data Structure ◽  
Object Oriented ◽  
Element Analysis ◽  
Topological Data Structure ◽  
Topological Data

scholarly journals SPATIAL ADJACENCY ANALYSIS OF CITYGML BUILDINGS VIA 3D TOPOLOGICAL DATA STRUCTURE

2019 ◽  
Vol XLII-4/W16 ◽  
pp. 573-579
Author(s):  
S. Salleh ◽  
U. Ujang ◽  
S. Azri ◽  
T. L. Choon
Keyword(s):  
Data Structure ◽  
3D Models ◽  
3D Navigation ◽  
Topological Information ◽  
Cell Complexes ◽  
Connectivity Information ◽  
Different Dimensions ◽  
3D Topology ◽  
Topological Data Structure ◽  
Topological Data

Abstract. Adjacencies between objects provides the most basic connectivity information of objects. This connectivity information provides support for more complex 3D spatial analysis such as 3D navigation, nearest neighbour and others. In 3D models, the connectivity information is maintained by building a comprehensive 3D topology. As the international standard for 3D city models, CityGML employs a simple XML links mechanism that references related entities to each other as a means of maintaining topological information. This method fulfils the purpose of relating connected entities but, it does not describe how the entities are related or in other words its adjacencies. In this study, a 3D topological data structure was utilised to preserve topological primitives and maintain connectivity information for CityGML datasets of buildings in LoD2. The adjacencies tested in this study were based on the topological links maintained by the Compact Abstract Cell Complexes 3D topological data structure. Four types of adjacencies were tested which are Point-to-Line, Line-to-Surface, Surface-to-Surface and Volume-to-Volume adjacency. As a result, all adjacencies were able to be executed for both datasets which consisted of two connected buildings and disjointed buildings. It was found that the ability of the 3D topological data structure to preserve topological primitives and build topological links supported the maintenance of connectivity information between buildings. The maintenance of connectivity information was also not limited to objects of the same dimension and could extend to connectivity between building elements in different dimensions.

Sign in / Sign up

Export Citation Format

Share Document