• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1785-1800
• /
• 2014

In 2011, Chen and Wu proposed their method of sharing n secret images to n+1 shadow images through the concept of a Boolean-based Visual Secret Sharing (VSS) method. However, the shadow images produced by this method are not equally important. If the participant who owns an important shadow image does not want to cooperate with other participants, most secret images can not be reconstructed. In the proposed method, the relationship between the shadows images and secret images are designed in a circular way mostly. Each shadow image only relates to two secret images. This means that if one participant refuses to cooperate with other participants, there are only two secret images which can not be reconstructed. Moreover, our proposed method only needs to produce n shadow images and n secret images can be shared to them.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.242-254
• /
• 2000

This paper describes an efficient solid modeling method for thin-walled plastic or sheet metal parts, based on the non-manifold offsetting operations. Since the previous methods for modeling and converting a sheet into a solid have adopted the boundary representations for solid object as their topological framework, it is difficult to represent the exact adjacency relationship between topological entities of a sheet model and a mixture of wireframe and sheet models that can appear in the meantime of modeling procedure, and it is hard to implement topological operations for sheet modeling and transformation of a sheet into a solid. To solve these problems, we introduce a non-manifold B-rep and propose a sheet conversion method based on a non-manifold offset algorithm. Because the non-manifold offset aigorithm based on mathematical definitions results in an offset solid with tubular and spherical thickness-faces we modify it to generate the ruled or planar thickness-faces that are mostly shown in actual plastic or sheet metal parts. In addition, in order to accelerate the Boolean operations used the offset algorithm, we also develope an efficient face-face intersection algorithm using topological adjacency information.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.1053-1056
• /
• 2008

An application of CSG (Constructive Solid Geometry) modeling technique in Machining Simulation is introduced in this paper. The current CSG model is based on z-buffer CSG Rendering Algorithm. In order to build a CSG model, frame buffers of VGA (Video Graphic Accelerator) should be used in term of color buffer, depth buffer, and stencil buffer. In addition to using CSG model in machine simulation Stock and Cutter Swept Surface (CSS) should be solid. Method to create a solid Cuboid stock and Ball-end mill CSS are included in the present paper. Boolean operations are used to produce the after-cut part, especially the Difference operation between Stock and CSS as the cutter remove materials form stock. Finally, a small program called MaSim which simulates one simple cut using this method was created.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2163-2172
• /
• 1997

SSI(Surface/Surface Intersection)is a fundamental geometric operation which is used in solid and geometric modeling to support trimmed surface and Boolean operations. In this paper, we suggest a new algorithm for tracing along the intersection curve of two regular surfaces. Thus, in this paper, we present a simplicity of computing and second degree continunity. Given a point of intersection curve, it is traced to entire curve of a intersection curve as the initial point of its and the initial point of each of a intersection curve is detected to DFS(Depth First Search) method in the Quadtree and is naturally presented a continuous form.

• Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.55-66
• /
• 2015

To satisfy safety regulations of Economic Commission for Europe (ECE), the surface regions of automobile parts must have a sufficient degree of roundness if there is any chance that they could contact a sphere of 50.0 mm radius (exterior parts) or 82.5 mm radius (interior parts). In this paper, a new offset-based method is developed to automatically detect the possible sphere-contacting shape of such parts. A polyhedral model that precisely approximates the part shape is given as input, and the offset shape of the model is obtained as the Boolean union of the expanded shapes of all surface triangles. We adopt a triple-dexel representation of the 3D model to enable stable and precise Boolean union computations. To accelerate the dexel operations in these Boolean computations, a new parallel processing method with a pseudo-list structure and axis-aligned bounding box is developed. The possible sphere-contacting shape of the part surface is then extracted from the offset shape as a set of points or a set of polygons.

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

This paper introduces non-manifold offsetting operations, which add or remove a uniform thickness from a given non-manifold model. Since these operations can be applied to not only solids but also wireframe or sheet objects, they are potentially useful for pipeline modeling, sheet metal and plastic part modeling, tolerance analysis, clearance checking, constant-radius rounding and filleting of solids, converting of abstracted models to solids, HC too1 path generation and so on. This paper describes mathematical properties and algorithms for non-manifold offsetting. In this algorithm, a sufficient set of tentative faces are generated first by offsetting all or a subset of the vertices, edges and faces of the non-manifold model. And then they are merged into a model using the Boolean operations. Finally topological entities which are within offset distance are removed. The partially modified offsetting algorithms for wireframes or sheets are also discussed in order to provide more practical offset models.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1965-1966
• /
• 2008

The manipulation of Boolean functions is a fundamental part of computer science, and many problems in the design and testing of digital systems can be expressed as a sequence of operations. It is mainly a paper of our research on the techniques of Boolean function manipulation using Binary Decision Diagram(BDDs) and their applications for VLSI CAD System. In many practical applications related to digital system design, it is a basic technique to use ternary-valued functions. In this paper, we discuss the methods for representing logical values.

• Journal of the Optical Society of Korea
• /
• v.9 no.3
• /
• pp.111-118
• /
• 2005

In this paper, a new optical parallel binary arithmetic processor (OPBAP) capable of computing arbitrary n-bit look-ahead carry full-addition is proposed and implemented. The conventional Boolean algebra is considered to implement OPBAP by using two schemes of optical logic processor. One is space-variant optical logic gate processor (SVOLGP), the other is shadow-casting optical logic array processor (SCOLAP). SVOLGP can process logical AND and OR operations different in space simultaneously by using free-space interconnection logic filters, while SCOLAP can perform any possible 16 Boolean logic function by using spatial instruction-control filter. A dual-rail encoding method is adopted because the complement of an input is needed in arithmetic process. Experiment on OPBAP for an 8-bit look-ahead carry full addition is performed. The experimental results have shown that the proposed OPBAP has a capability of optical look-ahead carry full-addition with high computing speed regardless of the data length.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1040-1048
• /
• 1987

We propose a hardware architecture called Multiring which is applicable for various geometrical operations on rectilinear objects such as design rule checking in VLSI layout and many image processing operations including noise suppression and coutour extraction. It has both a fast execution speed and extremely high flexibility. The whole architecture is mainly divided into four parts` I/O between host and Multiring, ring memory, linear processor array and instruction decoder. Data transmission between host and Multiring is bit serial thereby reducing the bandwidth requirement for teh channel and the number of external pins, while each row data in the bit map stored in ring memory is processed in the corresponding processor in full parallelism. Each processor is simultaneously configured by the instruction decoder/controller to perform one of the 16 basic instructions such as Boolean (AND, OR, NOT, and Copy), geometrical(Expand and Shrink), and I/O operations each ring cycle, which gives Multiring maximal flexibility in terms of design rule change or the instruction set enhancement. Correct functional behavior of Multiring was confirmed by successfully running a software simulator having one-to-one structural correspondence to the Multiring hardware.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.10a
• /
• pp.244-248
• /
• 2001

A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While many B-rep modelers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.