• Title/Summary/Keyword: polyhedral model

Search Result 32, Processing Time 0.026 seconds

Approximation of a compound surface to polyhedral model (복합곡면의 다면체 곡면 근사)

  • 김영일;전차수;조규갑
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.100-103
    • /
    • 1996
  • Presented in this study is an algorithmic procedure to obtain polyhedral model from a compound surface. The compound surface in this study denotes a collection of trimmed surfaces without topological relations. The procedure consists of two main modules: CAD data interface, and surface conversion to polyhedral model. The interface module gets geometric information from CAD databases, and makes topological information by scanning the geometric information. We are investigating CATIA system as a data source system. In the surface conversion module, a shell(compound surface with topological information) is approximated to a triangular-faceted polyhedral surface model through node sampling and triangulation steps. The obtained polyhedral model should obey the vertex-to-vertex rule and meet tolerance requirements. Since the polyhedral model has a simple data structure and geometry processing for it is very efficient and robust, the polyhedral model can be used in various applications, such as surface rendering in computer graphics, FEM model for engineering analysis, CAPP for surface machining, data generation for SLA, and NC tool path generation.

  • PDF

A Reduction Method of Search Space for Polyhedral Object Recognition (다면체 인식을 위한 탐색 공간 감소 기법)

  • Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.4
    • /
    • pp.381-385
    • /
    • 2003
  • We suggest a method which reduces the search space of a model-base on multiple-view approach for polyhedral object recognition using the ART-1 neural network. In this approach, the model-base is consisted of extracted features from two-dimensional projections observed at the predetermined viewpoints of a viewing sphere enclosing the object.

Validating Numerical Analysis Model Modeling Method by Polyhedral Rubble Mound Structure Arrays (다면체 사석배열 해안구조물에 대한 수치해석모델의 모델링 기법 검증)

  • Choi, Woong-Sik;Kim, Kee-Dong;Han, Tong-Seok
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.34 no.3
    • /
    • pp.723-728
    • /
    • 2014
  • Hydraulic experiments are performed in order to verify the swash effect of seashore structures installed to prevent scouring. However, a great deal of investment and time are required for producing the test apparatus and seashore structure used to perform the hydraulic experiment. The swash effect can be predicted, however, by using a numerical model and validation can be done based on comparisons of the numerical model and hydraulic experiment analysis results, thereby saving the cost and time required for producing the test apparatus and seashore structure. Taking a polyhedral rubble mound structure as the subject, this study performed a comparative analysis of wave run-up and run-down height of the numerical model interpretative results and the hydraulic experiment results, and validated the interpretative simulation wave test modeling technique. The study also predicted the swash effect by using the numerical interpretation approach method, whereby the volume ratio and friction area of the rubble mound were varied for different results.

Representation and recognition of polyhedral objects in a single 2-D image using the signature technique (하나의 2차원 영상에서 표면의 signature를 이용한 다면체의 표현 및 인식 알고리즘)

  • 이부형;한헌수
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.63-70
    • /
    • 1997
  • This paper proposes a new algorithm for recognizing polyhedral objects using a single 2-D image. It is base don a new representation scheme having two level hierarchey. In the lower level, geometrical features of each primitive surface are represented using their signatures and the variation of signature due to rotation is represented suing the rotation map. In the higher level, topological features are represented in the inter-surface description table(SDT). Based on the proposed representaton scheme, loer level database searched to find a matching primitive surface. The srotation map determines the degree of rotation as well as the matchness. If all surfaces in a test object find their matching primitive surfaces, its structural information is compared with the SDTs of object models. If primitive surfaces of a test object equal to tha tof certain model and satisfy inter-surfaces relationship in SDT, a test object is recognized as the model.

  • PDF

Optimal Tool Positions in 5-axis NC Machining of Sculptured Surface (복합곡면의 5축 NC 가공을 위한 공구자세 최척화)

  • 전차수;차경덕
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.4
    • /
    • pp.393-402
    • /
    • 2000
  • Recently 5-axis NC machines are widely used in Korea. Since 5-axis machines have two more degrees of freedom than 3-axis machines, it is very important to find desirable tool positions(locations and orientations) in order to make an efficient use of expensive 5-axis NC machines. In this research an algorithm to determine “optimal” tool positions for 5-axis machining of sculptured surfaces is developed. For given CC(Cutter Contact) points, this algorithm determines the cutter axis vectors which minimize cusp heights and satisfy constraints. To solve the optimal problem, we deal with following major issues: (1) an approximation method of a cusp height as a measure of optimality (2) Identifying some properties of the optimal problem (3) a search method for the optimal points using the properties. By using a polyhedral model as a machining surface, this algorithm applies to sculptured surfaces covering: overhanged surface.

  • PDF

A Method for Automatic Generating Check Sheet of Jig and Die in Automobile Components Using CAD Model (CAD모델을 이용한 자동차 프레스 부품 검사 치구 체크 시트의 자동 생성방법)

  • 박성도;이철수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.7 no.2
    • /
    • pp.102-109
    • /
    • 2002
  • This paper presents a method for automatic generating of check sheet to measure deep-drawn sheet metal. By using polyhedral model of CAD, the proposed procedure calculates measuring points automatically. The results of measure are exported to MS-Excel. The proposed method is implemented by API functions and C language using SPEED plus CAD/CAM system and MS-Window OLE.

3D Shape Reconstruction from 2D Cross-Sections (단면 정보를 이용한 형상의 재구성)

  • Park, H.J.;Kim, K.S.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.10 no.4
    • /
    • pp.81-93
    • /
    • 1993
  • The three dimensional(3D) shape reconstruction from two dimensional(2D) cross-sections can be completed through three main phases : the input compilation, the triangular grid formation, and the smooth surface construction. In the input compilation phase, the cross-sections are analyzed to exctract the input data required for the shape reconstruction. This data includes the number of polygonized contours per cross-section and the vertices defining each polygonized contour. In the triangular grid formation phase, a triangular grid, leading to a polyhedral approximations, is constructed by extracting all the information concerning contour links between two adjacent cross- sections and then performing the appropriate triangulation procedure for each contour link. In the smooth surface construction phase, a smooth composite surface interpolating all vertices on the triangular grid is constructed. Both the smooth surface and the polyhedral approximation can be used as reconstructed models of the object. This paper proposes a new method for reconstructing the geometric model of a 3D objdect from a sequence of planar contours representing 2D cross-sections of the objdect. The method includes the triangular grid formation algorithms for contour closing, one-to-one branching, and one-to-many braanching, and many-to-many branching. The shape reconstruction method has been implemented on a SUN workstation in C.

  • PDF

Thickness and clearance visualization based on distance field of 3D objects

  • Inui, Masatomo;Umezun, Nobuyuki;Wakasaki, Kazuma;Sato, Shunsuke
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.183-194
    • /
    • 2015
  • This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a polyhedral representation. The proposed method uses the distance field of the objects in the visualization. A parallel algorithm is developed for constructing the distance field of polyhedral objects using the GPU. The distance between a voxel and the surface polygons of the model is computed many times in the distance field construction. Similar sets of polygons are usually selected as close polygons for close voxels. By using this spatial coherence, a parallel algorithm is designed to compute the distances between a cluster of close voxels and the polygons selected by the culling operation so that the fast shared memory mechanism of the GPU can be fully utilized. The thickness/clearance of the objects is visualized by distributing points on the visible surfaces of the objects and painting them with a unique color corresponding to the thickness/clearance values at those points. A modified ray casting method is developed for computing the thickness/clearance using the distance field of the objects. A system based on these algorithms can compute the distance field of complex objects within a few minutes for most cases. After the distance field construction, thickness/clearance visualization at a near interactive rate is achieved.

The Measurement of the Volume and Surface Area of an Object based on Polyhedral Method (다면체기법에 의한 입체의 최적 체적 및 표면적 측정)

  • Woo, Kwang-Bang;Chin, Young-Min;Park, Sang-On
    • Proceedings of the KIEE Conference
    • /
    • 1987.07a
    • /
    • pp.311-315
    • /
    • 1987
  • In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

  • PDF