Three-dimensional predictive deposit modelling based on the linear octree data structure

2008 ◽  
pp. 229-238 ◽  
Author(s):  
René Prissang
Keyword(s):  
Data Structure ◽  
Three Dimensional ◽  
Linear Octree

The Crystal Structure of [2,6-Bis(1-methyl-4-methylthio-5-thia-2,3-diazahexa-1,3-dienyl)-pyridine]dithiocyanatonickel(II), a Complex of a Potentially Pentadentate N3S2 Ligand, and a Comparison with Complexes of an N3O2 Ligand

1979 ◽  
Vol 32 (6) ◽  
pp. 1199 ◽  
Author(s):  
W Choong ◽  
NC Stephenson ◽  
MA Ali ◽  
MA Malik ◽  
DJ Phillips
Keyword(s):  
Crystal Structure ◽  
Data Structure ◽  
Pyridine Ring ◽  
Structure Refinement ◽  
Three Dimensional ◽  
Octahedral Structure ◽  
Potential Donor ◽  
X Ray ◽  
Distorted Octahedral ◽  
R Value

The crystal structure of Ni(dapsm)(NCS)2 [dapsm is 2,6-bis(1-methyl-4-methylthio-5-thia-2,3-diazahexa-1,3-dienyl)pyridinel has been determined from three-dimensional single-crystal diffractometer X-ray data. Structure refinement was carried out by least-squares methods to a final R value of 0.059. The ligand dapsm is a potential N3S2 pentadentate, but it coordinates as a tetradentate, giving a planar N3S donor grouping. Rotation occurs about an N-N bond in dapsm, moving a potential donor sulfur atom away from the nickel(II) ion. The pyridine ring of the ligand, and the N3S donor grouping, are approximately coplanar. Two thiocyanate groups are coordinated to the nickel, giving a distorted octahedral structure. The structure and electronic spectrum of Ni(dapsm)- (NCS)2 are compared with those for seven-coordinate complexes with the related N3O2 ligand, 2,6-diacetylpyridine bissemicarbazone.

scholarly journals BRLO-Tree: A Data Structure Used for 3D GIS Dynamic Scene Rendering

2015 ◽  
Vol 15 (4) ◽  
pp. 124-137 ◽  
Author(s):  
Wenju Wang ◽  
Zhang Xuan ◽  
Liujie Sun ◽  
Zhongmin Jiang ◽  
Jingjing Shang
Keyword(s):  
Data Structure ◽  
Large Scale ◽  
Three Dimensional ◽  
Level Of Detail ◽  
Dynamic Scene ◽  
3D Gis ◽  
Dynamic Scenes ◽  
Complex Dynamic ◽  
3D Objects ◽  
System A

Abstract BRLO-Tree (Block-R-Tree-Loose-Octree) is presented in this paper based on the R-Tree and Loose-Octree. The aim of the structure is to visualize the large scale and complex dynamic scenes in a 3D (three-dimensional) GIS (Geographic Information System). A new method of clustering rectangles to construct R-tree based on an improved K-means algorithm is put forward. Landform in 3D GIS is organized by R-Tree. The block is used as the basic rendering unit. The 3D objects of each block are respectively organized by a Loose-Octree. A series of techniques, based on this data structure, such as LOD (Level of Detail), relief impostors are integrated. The results of the tests show that BRLO-Tree cannot only support the large scale 3D GIS scene exhibition with wandering and fighting, but it can also efficiently manage the models in a dynamic scene. At the same time, a set of integrated techniques based on BRLO-Tree can make the rendering pictures more fluence and the rendering time vastly improved.

An Efficient Contact Search Algorithm for Three-Dimensional Sphere Discontinuous Deformation Analysis

2020 ◽  
pp. 2050044
Author(s):  
Ganghai Huang ◽  
Yuanzhen Xu ◽  
Xiaofeng Chen ◽  
Jianjun Ma ◽  
Shu Zhang
Keyword(s):  
Data Structure ◽  
Large Scale ◽  
Search Algorithm ◽  
Three Dimensional ◽  
Discontinuous Deformation Analysis ◽  
Deformation Analysis ◽  
Dimensional Sphere ◽  
Contact Search ◽  
Direct Search Algorithm ◽  
Discontinuous Deformation

The efficiency of contact search is one of the key factors related to the computational efficiency of three-dimensional sphere discontinuous deformation analysis (3D SDDA). This paper proposes an efficient contact search algorithm, called box search algorithm (BSA), for 3D SDDA. The implementation steps and data structure for BSA are designed, with a case study being conducted to verify its efficiency. The data structure also has been improved for parallelizing the computation in contact search. For the demonstration of the proposed algorithm (BSA), six cases with various sphere numbers are simulated. Simulation results show that the time consumed in contact search using BSA (CTofBSA) is much less than that by the direct search algorithm (DSA) (CTofDSA). For the case with 12,000 spheres, CTofBSA is 1.1[Formula: see text]h, which is only 1.3% of CTofDSA (84.62[Formula: see text]h). In addition, the proportion of the computation quantity of contact search in the entire computation (Pcs) is 91.3% by using DSA, while this value by BSA is only 12.4%, which demonstrates the contribution of BSA. The efficiency brought about by BSA (time consumed and computation quantity) may enable 3D SDDA to simulate large-scale problems.

A Method of Three-Dimensional Modeling Based on Voxel Code

2010 ◽  
Vol 139-141 ◽  
pp. 1312-1316
Author(s):  
Ai Dong He ◽  
Bang Yan Ye
Keyword(s):  
Three Dimensional ◽  
The Body ◽  
Three Dimensional Model ◽  
Three Dimensional Modeling ◽  
Dimensional Modeling ◽  
Visualization Toolkit ◽  
Dimensional Shape ◽  
Related Science ◽  
Linear Octree ◽  
The One

This article proposes a method of three-dimensional modeling based on voxel code, which can build three-dimensional model by means of cubic voxels and Voxel code. Voxel code is the one that records the formation of physical location of the voxels piled up in turn order in the body. The different Three-dimensional shape can be constructed according to different codes. In order to reduce the storage overhead of the code, the linear octree coding and decoding are given in recording voxel code. Combined with VTK (Visualization Toolkit) programming, some voxel models have been visualization. The modeling idea and method proposed in this paper have a positive significance for the promotion of the research and development of related science fields and have their theoretical and practical value.

An Octree-Based Heuristic Algorithm for 3-D Packing

1994 ◽  
Author(s):  
Zuo Dai ◽  
Jainzhong Cha ◽  
Junliang Yuan
Keyword(s):  
Data Structure ◽  
Theoretical Analysis ◽  
Heuristic Algorithm ◽  
Numerical Experiments ◽  
Three Dimensional ◽  
Object Oriented ◽  
Simulation System ◽  
Packing Problems ◽  
Ring Method ◽  
Bounding Boxes

Abstract Based on the Object-Oriented Simulation System for 3-D Packing developed by Dai & Cha (1993a), this paper presents an effective heuristic algorithm using the Octree Data Structure for the three-dimensional packing problems of irregular components. It also describes in detail the Tri-Ring Method which is designed for the topology identification of the octree’s construction. For those problems where the total volume of packed items is smaller than that of container, the results of the theoretical analysis and numerical experiments show that the heuristic is excellent both in packing quality and calculation cost. For those problems where the total volume of packed items is larger than that of container, a variant of this method is expected to be also quite effective. The packing of arbitrarily shaped objects is achieved by packing their octrees generated from their EXTENTS or BOUNDING BOXES.

Sign in / Sign up

Export Citation Format

Share Document