Log in

Relevant bibliographies by topics / Octree / Journal articles

To see the other types of publications on this topic, follow the link: Octree.

Journal articles on the topic 'Octree'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Octree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Wang, Jin Min, Lu Feng Luo, and Ying Liu. "A New Algorithm for the Boundary Representation of Octree Model." Applied Mechanics and Materials 220-223 (November 2012): 2857–61. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2857.

Full text

Abstract:

According to the space structure of octree and the neighbor of octree node，a new algorithm for calculating the boundary representation of octree model is put forward. The algorithm is started by minimum nodes of octrees and then gradually to increase into the biggest node of octrees, thus avoided the decomposition of some node effectively. For raising the calculation efficiency of algorithm, the integral “bit” is used to record the status of node and carry on judging. Theory analysis and examples validate the rationality and efficiency of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

2

SWIFT, L. K., T. JOHNSON, and P. E. LIVADAS. "PARALLEL CREATION OF LINEAR OCTREES FROM QUADTREE SLICES." Parallel Processing Letters 04, no. 04 (1994): 447–53. http://dx.doi.org/10.1142/s0129626494000417.

Full text

Abstract:

Quadtrees and octrees are hierarchical data structures for efficiently storing image data. Quadtrees represent two dimensional images, while octrees are a generalization to three dimensions. The linear form of each is an abstraction of the tree structure to reduce storage requirements. We have developed a parallel algorithm to efficiently create a linear octree from quadtree slices of an object without the use of an intermediate data structure. We also propose the d-slice, which is a generalization of an octree, and which efficiently represents non-cubic volumes.

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Peng-Shuai. "OctFormer: Octree-based Transformers for 3D Point Clouds." ACM Transactions on Graphics 42, no. 4 (2023): 1–11. http://dx.doi.org/10.1145/3592131.

Full text

Abstract:

We propose octree-based transformers, named OctFormer, for 3D point cloud learning. OctFormer can not only serve as a general and effective backbone for 3D point cloud segmentation and object detection but also have linear complexity and is scalable for large-scale point clouds. The key challenge in applying transformers to point clouds is reducing the quadratic, thus overwhelming, computation complexity of attentions. To combat this issue, several works divide point clouds into non-overlapping windows and constrain attentions in each local window. However, the point number in each window vari

APA, Harvard, Vancouver, ISO, and other styles

4

CHAUDHARY, VIPIN, K. KUMARI, P. ARUNACHALAM, and J. K. AGGARWAL. "MANIPULATIONS OF OCTREES AND QUADTREES ON MULTIPROCESSORS." International Journal of Pattern Recognition and Artificial Intelligence 08, no. 02 (1994): 439–55. http://dx.doi.org/10.1142/s0218001494000218.

Full text

Abstract:

Octrees offer a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture. Octrees are hierarchical data structures used to model 3-D objects. The manipulation of these data structures involves performing independent computations on each node of the octree. Octrees are much easier to deal with than other forms of representations used to model 3-D objects especially where extensive manipulations are involved. When these operations are distributed among multiple processing eleme

APA, Harvard, Vancouver, ISO, and other styles

5

Miltiadou, Milto, Neill D. F. Campbell, Darren Cosker, and Michael G. Grant. "A Comparative Study about Data Structures Used for Efficient Management of Voxelised Full-Waveform Airborne LiDAR Data during 3D Polygonal Model Creation." Remote Sensing 13, no. 4 (2021): 559. http://dx.doi.org/10.3390/rs13040559.

Full text

Abstract:

In this paper, we investigate the performance of six data structures for managing voxelised full-waveform airborne LiDAR data during 3D polygonal model creation. While full-waveform LiDAR data has been available for over a decade, extraction of peak points is the most widely used approach of interpreting them. The increased information stored within the waveform data makes interpretation and handling difficult. It is, therefore, important to research which data structures are more appropriate for storing and interpreting the data. In this paper, we investigate the performance of six data struc

APA, Harvard, Vancouver, ISO, and other styles

6

SCHNEIDERS, ROBERT. "OCTREE-BASED HEXAHEDRAL MESH GENERATION." International Journal of Computational Geometry & Applications 10, no. 04 (2000): 383–98. http://dx.doi.org/10.1142/s021819590000022x.

Full text

Abstract:

An octree-based algorithm for the generation of hexahedral element meshes is presented. The algorithm works in three steps: (i) The geometry to be meshed is approximated by an octree structure. (ii) An unstructured hexahedral element mesh is derived from the octree. (iii) The mesh is adapted to the boundary of the geometry. We focus on step (ii) and describe an algorithm that constructs a hex mesh for a given octree structure.

APA, Harvard, Vancouver, ISO, and other styles

7

Han, Soohee. "Towards Efficient Implementation of an Octree for a Large 3D Point Cloud." Sensors 18, no. 12 (2018): 4398. http://dx.doi.org/10.3390/s18124398.

Full text

Abstract:

The present study introduces an efficient algorithm to construct a file-based octree for a large 3D point cloud. However, the algorithm was very slow compared with a memory-based approach, and got even worse when using a 3D point cloud scanned in longish objects like tunnels and corridors. The defects were addressed by implementing a semi-isometric octree group. The approach implements several semi-isometric octrees in a group, which tightly covers the 3D point cloud, though each octree along with its leaf node still maintains an isometric shape. The proposed approach was tested using three 3D

APA, Harvard, Vancouver, ISO, and other styles

8

Benson, David, and Joel Davis. "Octree textures." ACM Transactions on Graphics 21, no. 3 (2002): 785–90. http://dx.doi.org/10.1145/566654.566652.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhou, H. M., Z. G. Liu, M. X. Li, and B. H. Lu. "A Fast Reconstruction of Dense Unorganized Point Cloud Based on 3-Color Octree." Materials Science Forum 628-629 (August 2009): 293–98. http://dx.doi.org/10.4028/www.scientific.net/msf.628-629.293.

Full text

Abstract:

This paper describes a fast reconstruction algorithm of implicit model based on 3-color octree structure for dense unorganized point cloud. At first, the point cloud is stored with an extended octree, 3-color octree. Aiming at this 3-color octree structure a new node watershed algorithm is presented with a higher efficiency to estimate the signs of subdivided leaf nodes. So the leaf nodes are divided into three types: interior, boundary and exterior nodes. To quickly reconstruct the model we sample the 3-color octree structure only at boundary nodes, which greatly reduces the number of sampled

APA, Harvard, Vancouver, ISO, and other styles

10

Yujian, Wang, Tan Shaowei, Dong Weiwei, and Jing Wenpeng. "Research on 3D Modeling Method Based on Hybrid Octree Structure." Open Electrical & Electronic Engineering Journal 8, no. 1 (2014): 323–29. http://dx.doi.org/10.2174/1874129001408010323.

Full text

Abstract:

With studying deeply of the three-dimensional modeling method, this paper proposed a hybrid data model which based on Octree,the four fork tree and NURBS. The characteristic of fast convergence of Octree is used to segment the 3D entity. Describe the irregular surface of entity by NURBS, and restructure the local mesh surface. The model uses the mixture data structure of Octree and four fork tree to restructure mesh surface gradually. The storage structure is the Octree structure type; establish Hash table based on octal prefix code. Finally, an experimental model system is designed by using O

APA, Harvard, Vancouver, ISO, and other styles

11

Kyu-Young Whang, Ju-Won Song, Ji-Woong Chang, et al. "Octree-R: an adaptive octree for efficient ray tracing." IEEE Transactions on Visualization and Computer Graphics 1, no. 4 (1995): 343–49. http://dx.doi.org/10.1109/2945.485621.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Chen, Xiang Hua, and Juan Zhou. "An Improved Three-Dimensional Target Octonion Representation." Applied Mechanics and Materials 263-266 (December 2012): 1614–18. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1614.

Full text

Abstract:

It is an efficient way to represent three-dimensional objects by octree.The traditional structure of pointer -based octree representation has several shortcomings,such as requiring large memory,missing relationship between two nodes,etc.Based on analyzing the space Iayout and the configuration of octree,this paper presents an improved octree for 3D representation.From the experimental results for 3D reconstruction of medical images,we can see the proposed method is superior to the traditional method in terms of the storing structure and visiting way,etc.

APA, Harvard, Vancouver, ISO, and other styles

13

Xing, Yan, and Xiao Li Qiu. "Kinetic Monte Carlo Simulation for the Evolution of Complex Surface in Fabrication of MEMS Devices." Advanced Materials Research 60-61 (January 2009): 99–104. http://dx.doi.org/10.4028/www.scientific.net/amr.60-61.99.

Full text

Abstract:

This paper introduces a octree search Kinetic Monte Carlo(OS-KMC) that combines the topological requirements for representing an evolving multivalued surface using minimal memory and an efficient search algorithm for the realization of the KMC time evolution. In addition, the data structure for OS-KMC also provides a nature way to generate hexahedral element meshes for the integration between simulator and performance analysis tool. The density of mesh grid and the refinement of the hexahedral element can be controlled in this octree based mesh generation method. In simulating surface morpholo

APA, Harvard, Vancouver, ISO, and other styles

14

Figueiredo, Mauro, João Pereira, João Oliveira, and Bruno Araújo. "Collision Detection for Point Cloud Models With Bounding Spheres Hierarchies." International Journal of Virtual Reality 11, no. 2 (2012): 37–43. http://dx.doi.org/10.20870/ijvr.2012.11.2.2841.

Full text

Abstract:

Point cloud models are a common shape representation for several reasons. Three-dimensional scanning devices are widely used nowadays and points are an attractive primitive for rendering complex geometry. Nevertheless, there is not much literature on collision detection for point cloud models. This paper presents a novel collision detection algorithm for large point cloud models using voxels, octrees and bounding spheres hierarchies (BSH). The scene graph is divided in voxels. The objects of each voxel are organized intoan octree. Due to the high number of points in the scene, each non-empty c

APA, Harvard, Vancouver, ISO, and other styles

15

Chen, Xu Bing, Chen Yu Shan, and You Lun Xiong. "Linear Octree Represented Tool Swept Volume Modeling on Complex Surface Machining." Applied Mechanics and Materials 190-191 (July 2012): 699–704. http://dx.doi.org/10.4028/www.scientific.net/amm.190-191.699.

Full text

Abstract:

In this paper, a novel approach of linear octree is employed to represent discrete tools and build their swept volumes along machining trajectories. Firstly, a data structure of linear octree is defined as the base of geometrical transformations. The linear octree can be extended into leaf nodes in the deepest level for simplifying homogeneous transformations, and all leaf nodes in the deepest level can also be concentrated into a linear octree for saving storage capacity inversely. Secondly, tool trajectories are interpolated as short lines, and swept volumes between neighbor interpolation po

APA, Harvard, Vancouver, ISO, and other styles

16

Yu, Xiaomin, Huiqiang Wang, Hongwu Lv, and Junqiang Fu. "An Optimization Technique of the 3D Indoor Map Data Based on an Improved Octree Structure." Mathematical Problems in Engineering 2020 (July 10, 2020): 1–13. http://dx.doi.org/10.1155/2020/4315850.

Full text

Abstract:

The construction and retrieval of indoor maps are important for indoor positioning and navigation. It is necessary to ensure a good user experience while meeting real-time requirements. Unlike outdoor maps, indoor space is limited, and the relationship between indoor objects is complex which would result in an uneven indoor data distribution and close relationship between the data. A data storage model based on the octree scene segmentation structure was proposed in this paper initially. The traditional octree structure data storage model has been improved so that the data could be backtracked

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Wei, Yi Zhang, Genyu Ge, Qin Jiang, Yang Wang, and Lihe Hu. "A Hybrid Spatial Indexing Structure of Massive Point Cloud Based on Octree and 3D R*-Tree." Applied Sciences 11, no. 20 (2021): 9581. http://dx.doi.org/10.3390/app11209581.

Full text

Abstract:

The spatial index structure is one of the most important research topics for organizing and managing massive 3D Point Cloud. As a point in Point Cloud consists of Cartesian coordinates (x,y,z), the common method to explore geometric information and features is nearest neighbor searching. An efficient spatial indexing structure directly affects the speed of the nearest neighbor search. Octree and kd-tree are the most used for Point Cloud data. However, octree or KD-tree do not perform best in nearest neighbor searching. A highly balanced tree, 3D R*-tree is considered the most effective method

APA, Harvard, Vancouver, ISO, and other styles

18

Yin, Y., Y. Li, K. Wu, and J. Zhou. "Numerical Simulation of Solidification Microstructure based on Adaptive Octree Grids." Archives of Foundry Engineering 16, no. 2 (2016): 33–40. http://dx.doi.org/10.1515/afe-2016-0022.

Full text

Abstract:

Abstract The main work of this paper focuses on the simulation of binary alloy solidification using the phase field model and adaptive octree grids. Ni-Cu binary alloy is used as an example in this paper to do research on the numerical simulation of isothermal solidification of binary alloy. Firstly, the WBM model, numerical issues and adaptive octree grids have been explained. Secondary, the numerical simulation results of three dimensional morphology of the equiaxed grain and concentration variations are given, taking the efficiency advantage of the adaptive octree grids. The microsegregatio

APA, Harvard, Vancouver, ISO, and other styles

19

Caraffa, L., M. Brédif, and B. Vallet. "3D OCTREE BASED WATERTIGHT MESH GENERATION FROM UBIQUITOUS DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-3/W3 (August 20, 2015): 613–17. http://dx.doi.org/10.5194/isprsarchives-xl-3-w3-613-2015.

Full text

Abstract:

Despite of the popularity of Delauney structure for mesh generation, octree based approaches remain an interesting solution for a first step surface reconstruction. In this paper, we propose a generic framework for a octree cell based mesh generation. Its input is a set of Lidar-based 3D measurements or other inputs which are formulated as a set of mass functions that characterize the level of confidence on the occupancy of each octree’s leaf. The output is a binary segmentation of the space between <i>occupied</i> and <i>empty</i> areas by taking into account the uncer

APA, Harvard, Vancouver, ISO, and other styles

20

Wu, Shuo Mei, Yan Kun Wang, Jian Wei Song, and Xu Ning Liu. "Research on Technology of Building Three-Dimensional Geological Simulation Model by Octree Algorithm Method." Applied Mechanics and Materials 456 (October 2013): 591–94. http://dx.doi.org/10.4028/www.scientific.net/amm.456.591.

Full text

Abstract:

Accurate terrain data should be obtained in order to research geological structure modeling problem, and it is difficult to truly reflect the form of three-dimensional geological body by traditional three-dimensional spatial data model method. By taking geological structure modeling problem as research object, this paper analyzes geological modeling principles, builds the volume element model of octree subdivision algorithm, proposes to build a three-dimensional geological body by octree subdivision algorithm based on multi-scale, meets the needs of multi-scale organization of data as well as

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Jian Xin, Han Guo Cui, and Xing Dai. "Three Dimensional Point Clouds Watermarking Algorithm Based on Sphere Degenerated Octree." Advanced Materials Research 314-316 (August 2011): 2064–70. http://dx.doi.org/10.4028/www.scientific.net/amr.314-316.2064.

Full text

Abstract:

To ensure the security and integrity of three dimensional point clouds model during transmission in the network, according to their own characteristics, after the pretreatment of PCA (Primary Component Analysis), three dimensional point clouds watermarking embedding algorithm based on sphere degenerated octree was proposed, and the octree that contained the original point clouds model was subdivided multilevel from top to bottom, and the nodes of the octree were ordered. And three dimensional point clouds watermarking extraction algorithm was proposed, and the original point clouds model and t

APA, Harvard, Vancouver, ISO, and other styles

22

Jiang, Yan, Shu Fan Hou, and Yi Nan Lu. "A Multilevel Feature Points Detecting Method upon Point-Octree for Point-Based Models." Advanced Materials Research 490-495 (March 2012): 115–19. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.115.

Full text

Abstract:

In this paper, we present a multilevel feature points extracting and displaying method for point-based models to improve the fast detecting of the multilevel feature of large-scale models. Our algorithm is built upon a non uniform partitioning feature point-octree data structure. We adopt covariance analysis method to estimate the surface variation, and feature parameter in local surfaces to describe the feature. The bigger the feature parameter is, the greater likelihood the point becomes a feature point. During the process of building point-octree, feature parameter is related to each LOD no

APA, Harvard, Vancouver, ISO, and other styles

23

Gehrung, J., M. Hebel, M. Arens, and U. Stilla. "A FAST VOXEL-BASED INDICATOR FOR CHANGE DETECTION USING LOW RESOLUTION OCTREES." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-2/W5 (May 29, 2019): 357–64. http://dx.doi.org/10.5194/isprs-annals-iv-2-w5-357-2019.

Full text

Abstract:

<p><strong>Abstract.</strong> This paper proposes a change detection approach that uses a low-resolution octree enhanced with Gaussian kernels to describe free and occupied space. This so-called Gaussian Occupancy Octree is derived from range measurements and used to represent spatial information for a single epoch. Changes between epochs are encoded using a Delta Octree. A qualitative and quantitative evaluation of the proposed approach shows that its advantages are a fast runtime and the ability to make a statement about the re-exploration of space. An evaluation of the cla

APA, Harvard, Vancouver, ISO, and other styles

24

Wang, Peng-Shuai, Yang Liu, and Xin Tong. "Dual octree graph networks for learning adaptive volumetric shape representations." ACM Transactions on Graphics 41, no. 4 (2022): 1–15. http://dx.doi.org/10.1145/3528223.3530087.

Full text

Abstract:

We present an adaptive deep representation of volumetric fields of 3D shapes and an efficient approach to learn this deep representation for high-quality 3D shape reconstruction and auto-encoding. Our method encodes the volumetric field of a 3D shape with an adaptive feature volume organized by an octree and applies a compact multilayer perceptron network for mapping the features to the field value at each 3D position. An encoder-decoder network is designed to learn the adaptive feature volume based on the graph convolutions over the dual graph of octree nodes. The core of our network is a new

APA, Harvard, Vancouver, ISO, and other styles

25

Song, B., G. Q. Zhou, Y. L. Lu, X. Zhou, and P. Liang. "BASED ON GPU FOR STRIP ADJUSTMENT ALGORITHM OF LIDAR DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-3/W10 (February 7, 2020): 229–33. http://dx.doi.org/10.5194/isprs-archives-xlii-3-w10-229-2020.

Full text

Abstract:

Abstract. In order to solve the problem that the source of LiDAR data error needs to be adjusted and the data volume is large, the adjustment speed between the voyages is slow and cannot be automatically adjusted. Based on the iterative nearest point (ICP) algorithm, this paper proposes an improved iterative closest point (ICP) algorithm based on GPU parallel octree. The algorithm quickly constructs the octree of LiDAR nautical belt data in the GPU, uses the octree to quickly find the overlapping area of the nautical band, and then uses the ICP algorithm in the overlapping area to solve the ad

APA, Harvard, Vancouver, ISO, and other styles

26

Yacob, Filmon, Daniel Semere, and Erik Nordgren. "Octree-Based Generation and Variation Analysis of Skin Model Shapes." Journal of Manufacturing and Materials Processing 2, no. 3 (2018): 52. http://dx.doi.org/10.3390/jmmp2030052.

Full text

Abstract:

The concept of Skin Model Shape has been introduced as a method for a close representation of manufactured parts using a discrete geometry representation scheme. However, discretized surfaces make irregular polyhedra, which are computationally demanding to model and process using the traditional implicit surface and boundary representation techniques. Moreover, there are still some research challenges related to the geometrical variation modelling of manufactured products; specifically, methods for geometrical data processing, the mapping of manufacturing variation sources to a geometric model

APA, Harvard, Vancouver, ISO, and other styles

27

Cui, Mingyue, Junhua Long, Mingjian Feng, Boyang Li, and Huang Kai. "OctFormer: Efficient Octree-Based Transformer for Point Cloud Compression with Local Enhancement." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 1 (2023): 470–78. http://dx.doi.org/10.1609/aaai.v37i1.25121.

Full text

Abstract:

Point cloud compression with a higher compression ratio and tiny loss is essential for efficient data transportation. However, previous methods that depend on 3D convolution or frequent multi-head self-attention operations bring huge computations. To address this problem, we propose an octree-based Transformer compression method called OctFormer, which does not rely on the occupancy information of sibling nodes. Our method uses non-overlapped context windows to construct octree node sequences and share the result of a multi-head self-attention operation among a sequence of nodes. Besides, we i

APA, Harvard, Vancouver, ISO, and other styles

28

Deng, Shangqi, Jun Ma, Liang-Jian Deng, and Ping Wei. "OTIAS: OcTree Implicit Adaptive Sampling for Multispectral and Hyperspectral Image Fusion." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 3 (2025): 2708–16. https://doi.org/10.1609/aaai.v39i3.32275.

Full text

Abstract:

Implicit Neural Representation (INR) methods have demonstrated great potential in arbitrary-scale super-resolution tasks. This success is primarily due to their ability to continuously represent images using coordinates. In the task of remote sensing image fusion, INR methods have also shown promising applications. However, the previous INR methods neglect channel-wise modeling, while sharing a single kernel across all channels at each position, resulting in a lack of sensitivity to data specificity. To address these issues, we propose the OcTree Implicit Adaptive Sampling (OTIAS) method, whic

APA, Harvard, Vancouver, ISO, and other styles

29

김철원, Min Gyu Choi, and 박석훈. "Octree-Based Adaptive Tetrahedral Meshing." Journal of the Korea Computer Graphics Society 17, no. 2 (2011): 45–53. http://dx.doi.org/10.15701/kcgs.2011.17.2.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Castro, Rener, Thomas Lewiner, Hélio Lopes, Geovan Tavares, and Alex Bordignon. "Statistical optimization of octree searches." Computer Graphics Forum 27, no. 6 (2008): 1557–66. http://dx.doi.org/10.1111/j.1467-8659.2007.01104.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Shapira, Aviad. "Octree Subdivision of Building Elements." Journal of Computing in Civil Engineering 7, no. 4 (1993): 439–57. http://dx.doi.org/10.1061/(asce)0887-3801(1993)7:4(439).

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Gosálvez, M. A., Y. Xing, K. Sato, and R. M. Nieminen. "Octree-search Kinetic Monte Carlo." Sensors and Actuators A: Physical 159, no. 1 (2010): 64–68. http://dx.doi.org/10.1016/j.sna.2010.02.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Jinghua, and Charles B. Owen. "Octree-based animated geometry compression." Computers & Graphics 31, no. 3 (2007): 463–79. http://dx.doi.org/10.1016/j.cag.2006.12.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

VINACUA, A., I. NAVAZO, and P. BRUNET. "OCTREE DETECTION OF CLOSED COMPARTMENTS." International Journal of Computational Geometry & Applications 01, no. 03 (1991): 263–80. http://dx.doi.org/10.1142/s0218195991000190.

Full text

Abstract:

The present paper addresses the problem of detecting closed compartments produced by a set of planar faces in the space. The topology of the set is general, and edges in the final piecewise planar surface can belong to one, two or more faces; boundary representations for non-manifold solids are an example. An octree structure (dubbed eightit compartment Octree) that defines a 3D graph through the volume defined by the set of faces is proposed, and it is shown that a seed propagation algorithm on the graph can be used to detect the existing closed compartments. The algorithm can either compute

APA, Harvard, Vancouver, ISO, and other styles

35

Elber, Gershon, and Moshe Shpitalni. "Octree creation via C.S.G. definition." Visual Computer 4, no. 2 (1988): 53–64. http://dx.doi.org/10.1007/bf01905558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Shibliyev, Orxan, and Ibrahim Sezai. "Overset Grid Assembler and Flow Solver with Adaptive Spatial Load Balancing." Applied Sciences 11, no. 11 (2021): 5132. http://dx.doi.org/10.3390/app11115132.

Full text

Abstract:

An overset mesh approach is useful for unsteady flow problems which involve components moving relative to each other. Since the generation of a single mesh around all components is prone to mesh stretching due to the relative motion of bodies, using the overset grid methodology, an individual mesh can be generated for each component. In this study, a parallel overset grid assembler was developed to establish connectivity across component meshes. Connectivity information was transferred to the developed parallel flow solver. The assembler uses multiple methods such as alternating digital tree a

APA, Harvard, Vancouver, ISO, and other styles

37

Wang, Wenju, Zhang Xuan, Liujie Sun, Zhongmin Jiang, and Jingjing Shang. "BRLO-Tree: A Data Structure Used for 3D GIS Dynamic Scene Rendering." Cybernetics and Information Technologies 15, no. 4 (2015): 124–37. http://dx.doi.org/10.1515/cait-2015-0059.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

38

Hou, J., M. Goebel, P. Hübner, and D. Iwaszczuk. "OCTREE-BASED APPROACH FOR REAL-TIME 3D INDOOR MAPPING USING RGB-D VIDEO DATA." International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLVIII-1/W1-2023 (May 25, 2023): 183–90. http://dx.doi.org/10.5194/isprs-archives-xlviii-1-w1-2023-183-2023.

Full text

Abstract:

Abstract. 3D indoor mapping is becoming increasingly critical for a variety of applications such as path planning and navigation for robots. In recent years, there is a growing interest in how low-cost sensors, such as monocular or depth cameras, can be used for 3D mapping. In our paper, we present an octree-based approach for real-time 3D indoor mapping using a handheld RGB depth camera. One benefit of the generated octree map is that it requires less storage and computational resources than point cloud models. Moreover, it explicitly represents free space and unmapped areas, which are essent

APA, Harvard, Vancouver, ISO, and other styles

39

Khorshidiyeh, Heidar, Branislav Madoš, and Dávid Vaľko. "Spatio-Temporal Hierarchical Data Structure Based on Sparse Voxel Octrees for Representation of the Geometry of Time-Variable Three-Dimensional Scenes." Acta Electrotechnica et Informatica 24, no. 2 (2024): 3–7. http://dx.doi.org/10.2478/aei-2024-0004.

Full text

Abstract:

Abstract The paper deals with the problematics of representation of the geometry of three-dimensional scenes in computer graphics using domain-specific hierarchical data structures based on octant trees or directed acyclic graphs as the means of space saving binary representation of this information. Several hierarchical data structures were introduced in this field in past decades. In this paper we are moving this problematic to the field of the representation of three-dimensional scenes which are rather dynamic in time, so their geometry is changing on the regular basis. We are investigating

APA, Harvard, Vancouver, ISO, and other styles

40

Li, Chun Ming, Zhuo Yang, and Min Wang. "Interference Detection in Numerical Control Simulation Based on Octree Sphere Model." Advanced Materials Research 645 (January 2013): 430–34. http://dx.doi.org/10.4028/www.scientific.net/amr.645.430.

Full text

Abstract:

This paper presentes an interference detection method for workpiece and tool in numerical control machining simulation process.In this method the workpiece is presented by an octree hierarchy sphere model, and outside surfaces of the machining tool are presented by some simple curved surfaces. Using the minimum touching moment between these spheres and surfaces to detect the interference between the workpiece and the machining tool，the judgement problem of the interference in NC simulation is solved. Through this method, the interference judgment becomes convenient and effective after the octr

APA, Harvard, Vancouver, ISO, and other styles

41

Au, Kin Man, and Kai Ming Yu. "Balanced Octree for Tetrahedral Mesh Generation." Materials Science Forum 471-472 (December 2004): 608–12. http://dx.doi.org/10.4028/www.scientific.net/msf.471-472.608.

Full text

Abstract:

Nowadays, with the advances of Finite Element Analysis (FEA) packages, some of the engineering and design problems such as stress or thermal deformation can be successfully solved. These are convenient for better incorporating the design constraints of various tasks such as injection molded parts, or rapid prototyping and tooling. Mesh generation is the major step of finite element method for numerical computation. Common types of mesh include triangulation or tetrahedralization. During the mesh generation process, we always find difficulty in the formation of a uniform, non-conformal mesh. Th

APA, Harvard, Vancouver, ISO, and other styles

42

Schütz, Markus, Lukas Herzberger, and Michael Wimmer. "SimLOD: Simultaneous LOD Generation and Rendering for Point Clouds." Proceedings of the ACM on Computer Graphics and Interactive Techniques 7, no. 1 (2024): 1–20. http://dx.doi.org/10.1145/3651287.

Full text

Abstract:

LOD construction is typically implemented as a preprocessing step that requires users to wait before they are able to view the results in real time. We propose an incremental LOD generation approach for point clouds that allows us to simultaneously load points from disk, update an octree-based level-of-detail representation, and render the intermediate results in real time while additional points are still being loaded from disk. LOD construction and rendering are both implemented in CUDA and share the GPU's processing power, but each incremental update is lightweight enough to leave enough ti

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Rui. "An Energy Based Octree Streamline Algorithm of Mass Point Cloud." Applied Mechanics and Materials 635-637 (September 2014): 1508–11. http://dx.doi.org/10.4028/www.scientific.net/amm.635-637.1508.

Full text

Abstract:

Based on the classic octree streamline algorithm, an adaptive octree streamline algorithm was put out based on energy criterion in this paper. By comparing the energy in each grid, the grid was reserved that the energy was less than the set, and the grid was meshed to smaller that the energy was more than the set until the energy of every grid was less than the set. Then the points within the grid were deleted except the central point of the grid, and the streamlined data were obtained. Experiments showed that by this streamlined approach, better streamline point of cloud data could be achieve

APA, Harvard, Vancouver, ISO, and other styles

44

Fernando, Milinda, and Hari Sundar. "Scalable Local Timestepping on Octree Grids." SIAM Journal on Scientific Computing 44, no. 2 (2022): C156—C183. http://dx.doi.org/10.1137/20m136013x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

SU, Chao-shi. "GPU acceleration for octree volume rendering." Journal of Computer Applications 28, no. 5 (2008): 1232–35. http://dx.doi.org/10.3724/sp.j.1087.2008.01232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Pan, Dartzi, and Maw-Jyi Chao. "Octree-Based Implicit Agglomeration Multigrid Method." AIAA Journal 37, no. 8 (1999): 1002–5. http://dx.doi.org/10.2514/2.7561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Lewiner, Thomas, Vinícius Mello, Adelailson Peixoto, Sinésio Pesco, and Hélio Lopes. "Fast Generation of Pointerless Octree Duals." Computer Graphics Forum 29, no. 5 (2010): 1661–69. http://dx.doi.org/10.1111/j.1467-8659.2010.01775.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Veenstra, Jack, and Narendra Ahuja. "Line drawings of octree-represented objects." ACM Transactions on Graphics 7, no. 1 (1988): 61–75. http://dx.doi.org/10.1145/42188.42189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Lam, T. W., K. M. Yu, K. M. Cheung, and C. L. Li. "Octree reinforced thin-shell rapid prototyping." Journal of Materials Processing Technology 63, no. 1-3 (1997): 784–87. http://dx.doi.org/10.1016/s0924-0136(96)02724-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Gao, Xifeng, Hanxiao Shen, and Daniele Panozzo. "Feature Preserving Octree‐Based Hexahedral Meshing." Computer Graphics Forum 38, no. 5 (2019): 135–49. http://dx.doi.org/10.1111/cgf.13795.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!