• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• 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.

• 한국지능시스템학회논문지
• /
• 제13권4호
• /
• pp.381-385
• /
• 2003

본 논문에서는 다면체의 인식을 위하여 사용되는 여러-방향-보기 방법 (multiple-view approach)에서, ART-1 신경망을 이용하여 모델베이스의 탐색공간 크기를 줄이기 위한 방법을 제안한다. 이 방법에서 모델베이스는 물체를 둘러싸고 있는 보기 구체의 미리 정해진 시점에서 관측된 2차원 투영체에서 추출된 특징들로 구성된다.

• 대한토목학회논문집
• /
• 제34권3호
• /
• pp.723-728
• /
• 2014

세굴방지를 위하여 설치하는 해안구조물의 쇄파효과를 검증하기 위하여 수리조파실험이 실시된다. 하지만 수리조파실험을 실시하기 위해서 사용되는 실험 장치와 해안구조물의 제작에 많은 비용과 시간이 소요된다. 수치해석모델과 수리조파실험의 해석결과를 비교하여 검증하면, 수치모델을 활용하여 쇄파효과를 예측할 수 있고 실험 장치와 해안구조물 제작에 소요되는 비용과 시간을 절약할 수 있다. 본 연구에서는 다면체 사석 구조물을 대상으로 수치해석결과와 수리조파실험 결과의 처오름 및 처내림 높이 비교분석을 수행하였고 해석적 모의 조파실험 모델링 기법을 검증하였다. 또한, 사용한 수치해석 접근 방법을 활용하여 사석의 부피비와 마찰면적을 변화시켜 쇄파효과를 예측하였다.

• 전자공학회논문지S
• /
• 제34S권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.

• 한국CDE학회논문집
• /
• 제5권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.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2005년도 학술발표회(1)
• /
• pp.145-146
• /
• 2005

• 한국CDE학회논문집
• /
• 제7권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.

• 한국정밀공학회지
• /
• 제10권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.

• Journal of Computational Design and Engineering
• /
• 제2권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• 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.