• Title/Summary/Keyword: 삼각화

Search Result 255, Processing Time 0.029 seconds

Optical Coherence Tomography with Sinusoidal-Wave Drive an Optical Delay Line using Piezoelectrics Strecher (정현파로 구동되는 PZT 광경로 지연기를 이용한 광 간섭 단층촬영시스템)

  • Kim, Young-Kwan;Kim, Yong-Pyung
    • Korean Journal of Optics and Photonics
    • /
    • v.18 no.4
    • /
    • pp.274-279
    • /
    • 2007
  • We fabricated and characterized an optical delay line for optical coherence tomography (OCT). The delay line was composed of a cylindrical piezoelectric transduce (PZT) and a single mode optical fiber. The OCT system used a duplex scanning optical delay line which was symmetrically driven in the reference and sample arms. We showed that the sinusoidal-wave was superior to a triangular-wave for driving the optical delay line for scanning depth and repeatability.

On Quality Triangulation in Three-Dimensional Space (삼차원 공간상에서의 질적인 삼각화에 관한 연구)

  • Park, Joon-Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.215-222
    • /
    • 1997
  • This paper deals with the problem of generating a uniform tetrahedral mesh which fills a 3-D space with the tetrahedra which are close to the equilateral tetrahedra as possible. This problem is particularly interesting in finite element modeling where a fat triangulation minimizes the error of an analysis. Fat triangulation is defined as a scheme for generating an equilateral triangulation as possible in a given dimension. In finite element modeling, there are many algorithms for generating a mesh in 2-D and 3-D. One of the difficulties in generating a mesh in 3-D is that a 3-D object can not be filled with uniform equilateral tetrahedra only regardless of the shape of the boundary. Fat triangulation in 3-D has been proved to be the one which fills a 3-D space with the tetrahedra which are close to the equilateral as possible. Topological and geometrical properties of the fat triangulation and its application to meshing algorithm are investigated.

  • PDF

Study out Antenna Analysis Program of User Interface Using a Moment Method (Moment법을 이용한 사용자 중심의 Antenna 해석 프로그램에 관한 연구)

  • Lim Tae-Seo;Lee Dal-Ho;Kim Hyeong-Seok
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.185-188
    • /
    • 2006
  • 본 논문에서는 Moment 법을 이용한 안테나 해석 프로그램에 대해 다룬다. Delaunay 삼각화 알고리즘에 근거하여 pre-processor를 구현한다. Moment법을 이용하여 main-processor를 구현한다. S-parameter를 주파수 영역과 Smith Chart에 표시하고, 방사패턴을 다양한 각도에서 확인 할 수 있도록 post-processor를 구현한다. 해석 결과의 신뢰성을 위해 20GHz 에서 동작하는 고 이득 및 고지향성을 갖는 마이크로스트립 패치 안테나 어레이를 설계하고 이를 제작 및 측정한다. 측정결과와 상용 툴의 결과와 구현한 프로그램의 결과를 비교 및 분석한다.

  • PDF

Automatic Multi-Block Grid Generation Technique Based on Delaunay Triangulation (Delaunay 삼각화 기법을 활용한 다중-블록 정렬 격자의 자동 생성 기법)

  • Kim Byoungsoo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.11a
    • /
    • pp.108-114
    • /
    • 1999
  • In this paper. a new automatic multi=block grid generation technique for general 2D regions is introduced. According to this simple and robust method, the domain of interest is first triangulated by using Delaunay triangulation of boundary points, and then geometric information of those triangles is used to obtain block topology. Once block boundaries are obtained. structured grid for each block is generated such that grid lines have $C^0-continuity$ across inter-block boundaries. In the final step of the present method, an elliptic grid generation method is applied to smoothen grid distribution for each block and also to re-locale the inter-block boundaries, and eventually to achieve a globally smooth multi-block structured grid system with $C^1-continuity$.

  • PDF

Code Development of Automatic Mesh Generation for Finite Element Method Using Delaunay Triangulation Method (Delaunay 삼각화에 의한 유한요소 자동 생성 코드 개발에 관한 연구)

  • Park Pyong-Ho;Sah Jong-Youb
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1996.05a
    • /
    • pp.111-117
    • /
    • 1996
  • The Delaunay triangulation technique was tested for complicated shapes of computational domain. While a simple geometry, both in topology and in geometry, was discretized well into triangular elements. a complex geometry often failed in triangularization. A complex geometry should be devided into smaller sub-domains whose shape is simple both topologically and geometrically. The present study developed the data structures not only for relationships among neibering elements but also for shape information, and coupled these into the Delaunay triangulation technique. This approach was able to enhance greatly the reliability of triangularization specially in complicated shapes of computational domains. The GUI (Graphic User Interface) and OOP (Object-Oriented Programming) were used in order to develop the user-friendly and efficient computer code.

  • PDF

Study on the Natural Element Method using Petrov-Galerkin Concepts (페트로프-갤러킨 개념에 기초한 자연요소법에 관한 연구)

  • Lee, Hong-Woo;Cho, Jin-Rae
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1274-1279
    • /
    • 2003
  • In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called the Petrov-Galerkin natural element(PG-NE) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element(BG-NE). But, unlike BG-NE method, the test shape function is differently chosen from the trial shape function. The proposed technique ensures that the numerical integration error is remarkably reduced.

  • PDF

Automatic Three Dimensional Mesh Generation using Delaunay's Triangulation (Delaunay's 삼각화를 이용한 3차원 자동요소분할)

  • 김형석;정현교;이기식;한송엽
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.12
    • /
    • pp.847-853
    • /
    • 1988
  • A method of three-demensional finite element mesh generation is presented in this paper. This method is based on the Delaunay's triangulation whose dual is Voronoi's diagram. A set of points is given on the boundary surface of the concerning domain and the initial tetrahedra are generated by the given set of points. Then, the quality of every tetrahedron is investigated and the interior points are generated near the tetrahedra which are inferior in quality and the tetrahedra of good quality can be controlled by the density of the initial boundary points. Regions with different material constant can be refined in tetrahedra respectively. To confirm the effectiveness of this algorithm,the total volume of tetrahedra was compared to the true volume and this mesh generator was applied to a three-dimensional electostatic problem.

  • PDF

Reverse Engineering of 3D Compound Shapes using Delaunay Triangulation (Delaunay 삼각형분할법을 이용한 3차원복합형상의 역공학)

  • 조승현;조명우;김재도
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.7
    • /
    • pp.181-188
    • /
    • 2000
  • The objective of this research is to develop an efficient reverse engineering method of 3-dimensional compound surfaces for raped prototyping process. As a first step, several image processing techniques were applied to the measured data obtained using laser scanner. And the boundary information of the compound surface were extracted to divide the surface into several separate regions. As a next step, the Delaunay triangulation method were applied to reconstruct the surface based on the measured data and the boundary information. Finally, the STL file were created for the rapid prototyping process. Required simulations and experiments were performed and the results were analyzed to show the effectiveness of the proposed methods.

  • PDF

Development of Delaunay triangulation algorithm using quad subdivision (Quad-Subdivision을 이용한 Delaunay 삼각화 알고리즘 개발)

  • 박시형;이성수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.10a
    • /
    • pp.151-156
    • /
    • 2000
  • Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as shape reconstruction, solid modeling and volume rendering. In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are non-uniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

  • PDF

Pole Selection Method for Delaunay Triangulation (Delaunay 삼각화 시 Pole 선택 방법)

  • Park, Tae-Jong;Park, Hyeong-Tae;Park, Sang-Chul;Chang, Min-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.6
    • /
    • pp.422-428
    • /
    • 2007
  • Presented in the paper is a procedure to reconstruct a triangular mesh from a point cloud. Although, the proposed procedure is based on the well-known Voronoi diagram approach, it introduces a selection method of 'Pole' to improve the quality of resulting mesh. To select the appropriate Poles for high quality of Triangular mesh, the patterns that the Poles affect to the mesh quality are carefully analyzed. It is possible to improve the mesh quality by controlling the selection method of 'Pole' in terms of distance limit. The initial mesh obtained by the proposed procedure may include invalid triangles. To relieve this problem, a slicing method is proposed to remove invalid triangles from the initial mesh. At last, correcting technique of normal vectors of generated mesh is introduced.