A Reliable Extended Octree Representation of CSG Objects with an Adaptive Subdivision Depth

2008 ◽  
pp. 1341-1350 ◽  
Author(s):  
Eva Dyllong ◽  
Cornelius Grimm
Keyword(s):  
Adaptive Subdivision ◽  
Subdivision Depth ◽  
Octree Representation

Estimating subdivision depth of Catmull-Clark surfaces

2004 ◽  
Vol 19 (5) ◽  
pp. 657-664 ◽  
Author(s):  
Hua-Wei Wang ◽  
Kai-Huai Qin
Keyword(s):  
Subdivision Depth

scholarly journals A New Computational Approach to Estimate the Subdivision Depth of n-Ary Subdivision Scheme

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 187146-187155
Author(s):  
Ghulam Mustafa ◽  
Aamir Shahzad ◽  
Faheem Khan ◽  
Dumitru Baleanu ◽  
Yuming Chu
Keyword(s):  
Computational Approach ◽  
Subdivision Scheme ◽  
Subdivision Depth

Shape Similarity Matching With Octree Representations

2009 ◽  
Vol 9 (3) ◽  
Author(s):  
Jingsheng Zhang ◽  
Shana Smith
Keyword(s):  
Shape Matching ◽  
Data File ◽  
Markup Language ◽  
3D Shape Retrieval ◽  
3D Shape ◽  
Space Efficiency ◽  
Extensible Markup ◽  
Octree Representation ◽  
3D Shape Matching ◽  
Mesh Models

To achieve effective 3D shape retrieval, there is a crucial need for efficient shape matching methods. This paper introduces a new method for 3D shape matching, which uses a simplified octree representation of 3D mesh models. The simplified octree representation was developed to improve time and space efficiency over prior representations. The proposed method also stores octree information in extensible markup language format, rather than in a new proprietary data file type, to facilitate comparing models over the Internet.

Octree Based Recognition of Assembly Features

2000 ◽  
Author(s):  
Raymond C. W. Sung ◽  
Jonathan R. Corney ◽  
Doug E. R. Clark
Keyword(s):  
Geometric Reasoning ◽  
Wide Range ◽  
Assembly Features ◽  
Form Features ◽  
Octree Representation

Abstract This paper reviews the nature and use of assembly features. One of the conclusions drawn from this survey is that the majority of assembly features involve sets of spatially adjacent faces. Two principle types of adjacency relationships are identified and an algorithm is presented for identifying assembly features, these are features which arise from these “spatial” and “contact” face adjacency relationships (known as s- and c-adjacency respectively). The algorithm uses an octree representation of a B-rep model to support the geometric reasoning required to locate assembly features on disjoint bodies. Once all the adjacent faces which form features have been located, they are used to partition the original faces of the assembly into adjacent and non-adjacent portions. The resulting system can locate and partition spatially adjacent faces in a wide range of situations and at different resolutions. By way of illustration, the algorithm is applied to a trial component.

scholarly journals A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 66 ◽  
Author(s):  
Aamir Shahzad ◽  
Faheem Khan ◽  
Abdul Ghaffar ◽  
Ghulam Mustafa ◽  
Kottakkaran Sooppy Nisar ◽  
...  
Keyword(s):  
Numerical Algorithm ◽  
Subdivision Schemes ◽  
Practical Applications ◽  
Curves And Surfaces ◽  
Geometrical Shapes ◽  
Subdivision Depth ◽  
Subdivision Curves

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.

Sign in / Sign up

Export Citation Format

Share Document