• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.549-557
• /
• 2005

The requirements of multi-resolution models of feature-based solids, which represent an object at many levels of feature detail, are increasing for engineering purposes, such as analysis, network-based collaborative design, virtual prototyping and manufacturing. To provide multi-resolution models for various applications, it is essential to generate adequate solid models at varying levels of detail (LOD) after feature rearrangement, based on the LOD criteria. However, the non-commutative property of the union and subtraction Boolean operations is a severe obstacle to arbitrary feature rearrangement. To solve this problem we propose history-based Boolean operations that satisfy the commutative law between union and subtraction operations by considering the history of the Boolean operations. Because these operations guarantee the same resulting shape as the original and reasonable shapes at the intermediate LODs for an arbitrary rearrangement of its features, various LOD criteria can be applied for multi-resolution modeling in different applications.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.833-835
• /
• 2002

In this paper, we propose multi-resolutional representation of B-rep solid models using the selective Boolean operations on non-manifold geometric models. Since the union and subtraction operations of the selective Boolean operations are commutative, the integrity of the model is guaranteed for reordering design features. A multi-resolution representation is established using a non-manifold merged set model and a feature modeling tree reordered according to some criterion of level of detail (LOD). Then, a solid model for a specified LOD can be extracted from this multi-resolution model using the selective Boolean operations.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.293-300
• /
• 2000

The non-manifold geometric modeling technique is to improve design process and to Integrate design, analysis, and manufacturing by handling mixture of wireframe model, surface model, and solid model in a single data structure. For the non-manifold geometric modeling, Euler operators and other high level modeling methods are necessary. Boolean operation is one of the representative modeling method for the non-manifold geometric modeling. This thesis studies Boolean operations of non-manifold model with the data structure of selective storage. The data structure of selective storage is improved non-manifold data structure in that existing non-manifold data structures using ordered topological representation method always store non-manifold information even if edges and vortices are in the manifold situation. To implement Boolean operations for non-manifold model, intersection algorithm for topological cells of three different dimensions, merging and selection algorithm for three dimensional model, and Open Inventor(tm), a 3D toolkit from SGI, are used.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.301-311
• /
• 2000

For effective part modifications which is necessary in the design process frequently, variational geometric modeling with constraint management being used in a wide. Most variational geometric modeling methods, however, manage just the constraints about sketch elements used for generation of primitives. Thus, not only constraint propagation but also re-build of various modeling operations stored in the modeling history is necessary iota part geometry modifications. Especially, re-build of high-cost Boolean operations is apt to deteriorate overall modeling efficiency abruptly. Therefore, in this paper we proposed an algorithm that can handle all geometric entities of the part directly. For this purpose, we introduced eight type geometric constraints to the various geometric calculations about all geometric entities in sweepings and Boolean operations as well as the existing constraints of the sketch elements. The algorithm has a merit of rapid part geometric modifications through only constraint propagation without rebuild of modeling operations which are necessary in the existing variational geometric modeling method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.836-839
• /
• 2002

This paper describes the selective Boolean operations on non-manifold geometric models whose union and subtraction operations are communicative. These operations guarantee the same resulting shape in spite of change of the order of Boolean operations, and the integrity of the model for omission of some features. In addition, a B-rep model for a modified modeling history is obtained in a short time, as no boundary evaluation is necessary. These features enable easy implementation of multi-resolution representation of B-rep models.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.715-718
• /
• 2002

This paper describes the Boolean and sectioning operations on pseudo-solid models. A pseudo-solid model is defined as a sheet body that looks like a solid model but cannot comprise a solid model due to tolerance. Most of CAD models imported from the other CAD system are pseudo-solid models and have to be repaired for further stolid modeling operations. However, healing a pseudo-solid model is a very tedious and cumbersome process. To solve this problem, we devised and implemented the Boolean and sectioning operations on pseudo-solid models. Using these operations, mold and die design can be performed more efficiently, as healing work is reduced greatly.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.145-153
• /
• 1998

An approach has been developed to generate parametric models with Boolean operations. The approach combines Boolean operations and graph manipulation on the constraints imposed on primitives. A Boolean operation is first performed on two primitives and new geometric elements such as vertices and edges are computed. Then to generate the constraint graph of the polygon the each constraints graph of two primitives are merged by adding the new geometric elements with its corresponding constraints. In the merging process, some of the geometric elements belonging to the primitives may be eliminated based on its contribution to the polygon. A computer implementation in a 2D space is described to illustrate the approach with examples.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.151-161
• /
• 2005

This paper describes the parting and Boolean operations for a pseudo-solid model of a plastic part, and their application to injection mold design. Here, a pseudo-solid model means a sheet model that looks like a solid model, but its boundary is not closed. When a solid model created in a different CAD system is imported through a standard data exchange file format, in most cases, a pseudo-solid model may be created due to tolerance or some other problems. However, most existing mold design systems based on solid modeling kernels require a complete part solid model. Therefore, mold designers have to do time-consuming healing operations to convert a pseudo-solid to solid. To eliminate or reduce the healing pre-process for mold design, in this paper, we proposed the parting and Boolean Operations on pseudo-solid part models. This paper also describes their detailed implementation and a case study.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.137-143
• /
• 2017

In this paper, we investigate static control of Boolean networks described in the framework of semi-tensor product (STP) operation. The control objective is to determine control input nodes and their logical values so as to stabilize the considered Boolean network to a desired fixed point or cycle. Using topology of Boolean networks such as incidence matrix and hub nodes, a set of appropriate control input nodes is selected, and based on STP operations, we assign constant control inputs so that the controlled network can converge to a prescribed fixed point or cycle. To validate applicability of the proposed scheme, we conduct a numerical study on the problem of determining control input nodes for a Boolean network representing hierarchical differentiation of myeloid progenitors.