• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.594-603
• /
• 2007

This paper proposes a watermarking scheme for 3D CAD design drawing. In the proposed scheme, we embed binary watermarks into line, arc, and polygon face components that are the basic component of 3D CAD design drawing. The embedding target component can be selected randomly among three components or by the component distribution in drawing. In line components, a watermark bit is embedded into the ratio of the length of a target line and an average length of lines that are connected into a target line. Furthermore, a watermark bit is embedded into a curvature radius on the basis of a center point in a arc component and also is embedded into a ratio of two sides in a polygonal face component. Experimental results verified that the proposed watermarking has the robustness against Format conversion, rotation translation, scaling, cropping, and layer cutting and also SNR of watermarked component is about 39.89-42.50 dB.

• Journal of Educational Research in Mathematics
• /
• v.14 no.1
• /
• pp.19-37
• /
• 2004

In school mathematics, polygon and polyhedron are defined by vague terms such as "surrounded" or "formed" Moreover, the inclusion of boundary and interior in the definition of polygon and polyhedron is varied according to the context. Polygon and polyhedron are considered as "context-dependent concept" in school mathematics. Elementary school mathematics introduces a surface only in the context of solid, yet secondary school mathematics explains a surface as the trace of the line movement. From the perspective of fallabilism, it is possible and desirable to lead students to revise and improve their conceptions on polygon, polyhedron, and surface. It is more appropriate to name a face, an edge, and a vertex rather than to express a face of polyhedron, an edge of polyhedron, and a vertex of polyhedron in textbooks. The term "surface as a polygon" in secondary mathematics textbooks shows a conflict between intuitive approach in elementary school and logical approach in secondary school.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.667-669
• /
• 2003

특징 형상의 조합으로 표현될 수 없는 자유 형상을 가진 제품이 늘어남에 따라 자유형상을 효율적으로 변형시키는 기법이 필요하다. 여러 가지 자유형상 변형기법(FFD) 가운데에서 자유 형상을 파라메트릭하게 컨트롤하기 위해서는 조정 다각형 기반의 형상 변형 기법이 적합하다. 이에 따라 본 연구에서는 FFD 기법을 적용하여 자유형상 모델을 파라메트릭하게 컨트롤하기 위해 입력 모델에 대한 조정 다각형을 자동으로 생성하는 알고리즘을 제안하였다. 제안된 알고리즘은 크게 기본 조정 다각형 생성과 조정 다각형 최적화 단계로 나누어진다. 기본 다각형 생성에서는 1)입력모델을 직교 3방향에 투영, 2)투영된 결과에 대해 2차원 조정 다각형을 생성, 3)2차원 조정 다각형을 조합하여 3차원 기본 조정 다각형 생성의 단계를 거친다. 조정 다각형 최적화 단계에서는 기본 조정 다각형에 에지 및 면 연산자를 적용하여 입력 모델에 더욱 근사하는 최종 조정 다각형을 생성한다. 예제에서는 제안된 알고리즘을 통해 자동으로 생성된 조정다각형을 자동차 모델에 적용하여 모델의 형상을 변화시킨 결과를 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.181-183
• /
• 2003

MRI 나 CT 스캔에 의해 생성된 볼륨 데이터는 일반적으로 설러 샘플 지점에서의 이산적인 수치 데이터 일뿐 데이터 상호간의 함수적 연속성은 제공되지 않고 있다. 이러한 데이터로부터 우리가 원하는 임계값(threshold)에 의한 등가면(isosurface)을 렌더링하는 방법은 보통 Marching Cube에서처럼 많은 다각형을 생성해서 렌더링 하는 방법에 의존해 왔다. 그러나 원하는 등가면을 직접 표현할 수 있는 함수가 존재할 경우 많은 양의 다각형을 추출하고 보관해야 하는 시공간적 부담이 없게 된다. 본 논문에서는 각 Cube별로 정의되는 Tri-linear Interpolation 함수를 기반으로 하여 Interval Method 에 의한 등가면 렌더링 알고리즘을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.374-377
• /
• 2004

Existing Clustering Methods for spatial data mining process only point objects, not objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonomery for clustering is more complex than point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it refutes cost and time for distance computation using cell relationships in grid cell structures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.955-959
• /
• 2004

Existing Clustering Methods for spatial data mining process only Point objects, not spatial objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonometry for clustering is more complex than distance computation between point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it reduces cost and time for distance computation using cell relationships in grid cell structures.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.9-23
• /
• 1999

Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelpiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. This is inherently a four-dimensional problem. We efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree, which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. The proposed method is able to efficiently handle more general environments like urban scenes, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m, users can select a suitable level of trade-off between the preprocessing time and the quality of the computational result.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.479-490
• /
• 2001

In this paper, we consider the method of partitioning a sphere into faces with a set of spherical convex polygons $\Gamma$=$｛P_1...P_n｝$ for determining the maximum of minimum intersection. This problem is commonly related with five geometric problems that fin the densest hemisphere containing the maximum subset of $\Gamma$, a great circle separating $\Gamma$, a great circle bisecting $\Gamma$ and a great circle intersecting the minimum or maximum subset of $\Gamma$. In order to efficiently compute the minimum or maximum intersection of spherical polygons. we take the approach of edge-based partition, in which the ownerships of edges rather than faces are manipulated as the sphere is incrementally partitioned by each of the polygons. Finally, by gathering the unordered split edges with the maximum number of ownerships. we approximately obtain the centroids of the solution faces without constructing their boundaries. Our algorithm for finding the maximum intersection is analyzed to have an efficient time complexity O(nv) where n and v respectively, are the numbers of polygons and all vertices. Furthermore, it is practical from the view of implementation, since it computes numerical values. robustly and deals with all the degenerate cases, Using the similar approach, the boundary of a general intersection can be constructed in O(nv+LlogL) time, where : is the output-senstive number of solution edges.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.86-90
• /
• 1992

스크류 압축기는 진동이 작고 맥동이 적으며, 소형이고 고효율이라는 특징이 있다. 또한 식품, 화학, 전자공업 등에서 무윤활식 압축기로 사용되어지고 있다. 본 연구에서는 호프로 자른 것과 같은 다각형 오차를 만들지 않고 매끄러운 면을 얻을 수 있는 스크류 로터의 축직각 단면좌표를 이용한 cutter의 형상을 설계하는 것을 목적으로 한다.

• Tunnel and Underground Space
• /
• v.26 no.3
• /
• pp.235-252
• /
• 2016

This study presents a methodology to reproduce the mechanical behavior of isotropic or transversely isotropic rock using the polygonal grain-based distinct element model. A numerical technique to monitor the evolution of micro-cracks during the simulation was developed in the present study, which enabled us to examine the contribution of tensile cracking and shear cracking to the progressive process of the failure. The numerical results demonstrated good agreement with general observations from rock specimens in terms of the behavior and the evolution of micro-cracks, suggesting the capability of the model to represent the mechanical behavior of rock. We also carried out a parametric study as a fundamental work to examine the relationships between the microscopic properties of the constituents and the macroscopic behavior of the model. Depending on the micro-properties, the model exhibited a variety of responses to the external load in terms of the strength and deformation characteristics. In addition, a numerical technique to reproduce the transversely isotropic rock was suggested and applied to Asan gneiss from Korea. The behavior of the numerical model was in good agreement with the results obtained in the laboratory-scale experiments of the rock.