• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.1-19
• /
• 1996

Non-manifold topological representations can provide a single unified representation for mixed dimensional models or cellular models and thus have a great potential to be applied in many application areas. Various boundary representations for non-manifold topology have been proposed in recent years. These representations are mainly interested in describing the sufficient adjacency relationships and too redundant as a result. A model stored in these representations occupies too much storage space and is hard to be manipulated. In this paper, we proposed a compact hierarchical non-manifold boundary representation that is extended from the half-edge data structure for solid models by introducing the partial topological entities to represent some non-manifold conditions around a vertex, edge or face. This representation allows to reduce the redundancy of the existing schemes while full topological adjacencies are still derived without the loss of efficiency. To verify the statement above, the storage size requirement of the representation is compared with other existing representations and present some main procedures for querying and traversing the representation. We have also implemented a set of the generalized Euler operators that satisfy the Euler-Poincare formula for non-manifold geometric models.

• Korean Journal of Remote Sensing
• /
• v.21 no.5
• /
• pp.393-404
• /
• 2005

As multi-source spatial data fusion mainly deal with various types of spatial data which are specific representations of real world with unequal reliability and incomplete knowledge, proper data representation and uncertainty analysis become more important. In relation to this problem, this paper presents and applies an advanced data representation methodology for different types of spatial data such as categorical and continuous data. To account for the uncertainties of both categorical data and continuous data, fuzzy boundary representation and smoothed kernel density estimation within a fuzzy logic framework are adopted, respectively. To investigate the effects of those data representation on final fusion results, a case study for landslide hazard mapping was carried out on multi-source spatial data sets from Jangheung, Korea. The case study results obtained from the proposed schemes were compared with the results obtained by traditional crisp boundary representation and categorized continuous data representation methods. From the case study results, the proposed scheme showed improved prediction rates than traditional methods and different representation setting resulted in the variation of prediction rates.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.3
• /
• pp.209-216
• /
• 1989

A method for extracting the elemental information for an efficient representation of the boundary of industrial parts, from the contours of the mechanical parts, is presented. We have analyzed the performance of the boundary representation using lines and circles. We have also analyzed and compared the performance of the proposed method with that of CW tracking-RL searching method. The result of the analysis has shown that the method suggested in this paper is twice faster than CW tracking-RL searching method. The same result could also be observed in experiments.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.151-157
• /
• 1990

This paper presents a method for rapid wire frame drawing of the 3D objects represented by the CSG scheme. When the two CSG trees are combined into one, the intersection parts of the polygons constituting the object corresponds to each subtree are computed, and the boundary representation of the combined object is obtained according to the given combinational operator and stored in the root node. The boundary representation in the root node is used in the wireframe drawing of the object and later computation of boundary representation. Bezier surface is taken as one of the primitive object the scan-line algorithm is used, which subdivides each scan-line into the spans where no polygon is intersected, and renders each span with the CSG representation of the object.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.10
• /
• pp.1305-1313
• /
• 2013

In this study, a method to apply feature-based simplification to boundary representation models is proposed. For feature-based simplification, a volume decomposition tree is created from a boundary representation model. The volume decomposition tree is represented by regularized Boolean operations of additive volumes, subtractive volumes, and fillet/round/chamfer volumes, and it is generated by stepwise volume decomposition, which consists of fillet/round/chamfer decomposition, wrap-around decomposition, volume split decomposition, and cell-based decomposition. After the volume decomposition tree is transformed to an infix expression, the CAD model can be simplified by reordering the volumes. To verify the proposed method, a prototype system was implemented, and experiments on test cases were conducted. From the results of the experiments, it is verified that the proposed method is useful for simplifying CAD models based on boundary representation.

• Honam Mathematical Journal
• /
• v.31 no.4
• /
• pp.579-590
• /
• 2009

The precise form of singular functions, singular function representation and the extraction form for the stress intensity factor play an important role in the singular function methods to deal with the domain singularities for the Poisson problems with most common boundary conditions, e.q. Dirichlet or Mixed boundary condition [2, 4]. In this paper we give an elementary step to get the singular functions of the solution for Poisson problem with Neumann boundary condition or Robin boundary condition. We also give singular function representation and the extraction form for the stress intensity with a result showing the number of singular functions depending on the boundary conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.185-192
• /
• 1997

We propose a method of paramete estimation using order-of-magnitude analysis for optimal boundary smoothing in Mean Field Annealing(MFA) technique in this paper. We previously proposed two boundary smoothing methods for consistent object representation in the previous paper, one is using a constratined regulaization(CR) method and the other is using a MFA method. The CR method causes unnecessary smoothing effects at corners. On the other hand, the MFA method method smooths our the noise without losing sharpness of corners. The MFA algorithm is influenced by several parameters such as standard deviation of the noise, the relativemagnitude of prior ter, initial temperature and final temperature. We propose a general parameter esimation method for optimal boundary smoothing using order-of-magnitude analysis to be used for consistent object representation in this paper. In addition, we prove the effectiveness of our parameter estimation and also show the temperature parameter sensitivities of the algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.235-244
• /
• 2000

This paper addresses a new method for constructing surface representation of 3D structures from a sequence of tomographic cross-sectional images, Firstly, we propose cell-boundary representation by transforming the cuberille space into cell space. A cell-boundary representation consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Comparing with previous method such as Marching Cube or PVP algorithm, our method is robust and does not make any crack in resulting surface model. Hardware implementation is expected to be easy because our algorithm is simple(scan-line), efficient and guarantees data locality in computation time.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.9
• /
• pp.2138-2144
• /
• 1993

An integral equation representation of cracks was presented which differs from well-known "dislocation layer" representation. In this new representation, the equations are written in terms of the displacement discontinuity across the crack surfaces rather than derivatives of the displacement-discontinuity. It was shown in that the new technique is well-suited to the treatment of kinked cracks. In the present paper, this integral equation representation is coupled to the direct boundary-element method for the treatment of finite bodies containing kinked cracks. The method is demonstrated for two-dimensional finite domains but extension to three-dimensional problems would appear to be possible. The resulting approach is shown to be simple, yet very accurate. accurate.