• Title/Summary/Keyword: Boolean Operation

Search Result 71, Processing Time 0.02 seconds

An implementation of CSG modeling technique on Machining Simulation using C++ and Open GL

  • Le, Duy;Kim, Su-Jin;Lee, Jong-Min;Nguyen, Anh-Thi;Ha, Vy-Thoai
    • 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.

  • PDF

Sheet Offsetting Algorithms for Efficient Solid Modeling for Thin-Walled Parts (얇은 두께 솔리드의 효율적인 모델링을 위한 박판 옵셋 알고리즘 개발)

  • 김현수;이상헌
    • 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.

  • PDF

Curve Tracing Algorithm for Surface/Surface Intersection Curves in 3D Geomtric Modeling (3차원 기하 모델링에서 곡면간의 교차곡선 추적 알고리즘)

  • Park, Chul-Ho;Hong, Sung-Soo;Sim, Je-Hong
    • 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.

  • PDF

Feedrate Optimization Using CL Surface (공구경로 곡면을 이용한 이송속도 최적화)

  • 김수진;정태성;양민양
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.4
    • /
    • pp.39-47
    • /
    • 2004
  • In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR(material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over loom, so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL (cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants were applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to the machining of speaker and cellular phone mold. The finishing time was reduced to 12.6%, tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were reduced, compared to the machining by constant feedrate. The machining time was shorter to 17% and surface quality and tool was also better than the conventional federate regulation using curvature of the tool path.

New Power Analysis Attack on The Masking Type Conversion Algorithm (마스킹 형태 변환 알고리즘에 대한 새로운 전력 분석 공격)

  • Cho, Young-In;Kim, Hee-Seok;Han, Dong-Guk;Hong, Seok-Hie;Kang, Ju-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.159-168
    • /
    • 2010
  • In the recent years, power analysis attacks were widely investigated, and so various countermeasures have been proposed. In the case of block ciphers, masking methods that blind the intermediate results in the algorithm computations(encryption, decryption, and key-schedule) are well-known. The type conversion of masking is unavoidable since Boolean operation and Arithmetic operation are performed together in block cipher. Messerges proposed a masking type conversion algorithm resistant general power analysis attack and then it's vulnerability was reported. We present that some of exiting attacks have some practical problems and propose a new power analysis attack on Messerges's algorithm. After we propose the strengthen DPA and CPA attack on the masking type conversion algorithm, we show that our proposed attack is a practical threat as the simulation results.

Retrieval methodology for similar NPP LCO cases based on domain specific NLP

  • No Kyu Seong ;Jae Hee Lee ;Jong Beom Lee;Poong Hyun Seong
    • Nuclear Engineering and Technology
    • /
    • v.55 no.2
    • /
    • pp.421-431
    • /
    • 2023
  • Nuclear power plants (NPPs) have technical specifications (Tech Specs) to ensure that the equipment and key operating parameters necessary for the safe operation of the power plant are maintained within limiting conditions for operation (LCO) determined by a safety analysis. The LCO of Tech Specs that identify the lowest functional capability of equipment required for safe operation for a facility must be complied for the safe operation of NPP. There have been previous studies to aid in compliance with LCO relevant to rule-based expert systems; however, there is an obvious limit to expert systems for implementing the rules for many situations related to LCO. Therefore, in this study, we present a retrieval methodology for similar LCO cases in determining whether LCO is met or not met. To reflect the natural language processing of NPP features, a domain dictionary was built, and the optimal term frequency-inverse document frequency variant was selected. The retrieval performance was improved by adding a Boolean retrieval model based on terms related to the LCO in addition to the vector space model. The developed domain dictionary and retrieval methodology are expected to be exceedingly useful in determining whether LCO is met.

Development of Machining Simulation System using Enhanced Z Map Model (Enhanced Z map을 이용한 절삭 공정 시뮬레이션 시스템의 개발)

  • 이상규;고성림
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.551-554
    • /
    • 2002
  • The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

  • PDF

Tool Path Generation for Rough Cutting Using Octree (옥트리를 이용한 황삭 가공경로생성)

  • 김태주;이건우;홍성의
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.1
    • /
    • pp.53-64
    • /
    • 1994
  • Rouge cutting process takes the major portion of machining operation using NC milling machine. Especially, most of the machining time is spent in this process when molds are machined. Therefore, an efficient algorithm for generating the tool path for rough cutting is suggested in this paper. The first step of the procedure is getting the volume to be machined by applying the Boolean operation on the finished model and the workpiece which have been modeling system. Basic principle of determining machining procedure is that a large tool should be used at the portion of the simple shape while a small tool should be used at the complex portion. This principle is realized by representing the volume to be machined by an octree, which is basically a set of hexahedrons, and matching the proper tools with the given octants. When the tools are matched with the octants, the tool path can be derived at the same time.

Computing Reliability Cluster-based in Wireless Distributed Sensor Networks (클러스터 기반의 무선 분산 센서 네트워크에서의 터미널 간 신뢰도 평가)

  • Lee, Jun-Hyuk;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.6 no.4
    • /
    • pp.297-306
    • /
    • 2006
  • In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

  • PDF

Image Encryption using the chaos function and elementary matrix operations (혼돈함수와 기본 행렬 연산을 이용한 영상의 암호화)

  • Kim Tae-Sik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.1
    • /
    • pp.29-37
    • /
    • 2006
  • Due to the spread of mobile communication with the development of computer network, nowadays various types of multimedia data play an important role in many areas such as entertainments, culture contents, e-commerce or medical science. But for the real application of these data, the security in the course of saving or transferring them through the public network should be assured. In this sense, many encryption algorithm have been developed and utilized. Nonetheless, most of them have focused on the text data. So they may not be suitable to the multimedia application because of their large size and real time constraint. In this paper, a chaotic map has been employed to create a symmetric stream type of encryption scheme which may be applied to the digital images with a large amounts of data. Then an efficient algebraic encryption algorithm based on the elementary operations of the Boolean matrix and image data characteristics.

  • PDF