• 제목/요약/키워드: Surface mesh

검색결과 803건 처리시간 0.026초

계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성 (Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm)

  • 최영규;박은진
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제36권6호
    • /
    • pp.511-520
    • /
    • 2009
  • 본 논문에서는 입력 볼륨 데이터와 출력 메쉬 데이터에서 모두 계층성을 지원하는 새로운 등밀도 표면의 재구성 방법을 제안한다. 제안된 방법은 먼저 입력 볼륨 데이터로부터 3차원 팽창 필터를 사용하여 볼륨 피라미드라 불리는 볼륨의 계층구조를 만든다. 볼륨 피라미드가 만들어진 후 해상도가 최저인 피라미드의 최상단 볼륨에서부터 셀경계표현 방법을 이용하여 조악한 초기 메쉬를 생성한다. 이러한 메쉬를 반복적으로 변형하여 O(3)-인접성 조건하에서 추출한 등밀도점을 잘 근사하도록 하는데, 이를 위해 SWIS (표면축소기반의 등밀도면 재구성법[6]) 알고리즘에서 사용되었던 표면 축소 단계와 평활화 단계를 사용한다. 또한 최종등밀도면의 정밀한 표면을 만들 수 있도록 메쉬를 반복적으로 분할(subdivision)한다. 제안된 방법은 생성되는 표면이 표면의 압축이나 점진적인 전송 등과 같은 다중 해상도 알고리즘에 활용될 수 있다는 장점이 있다.

근사 함수를 이용한 Point-Based Simplification (Point-Based Simplification Using Moving-Least-Squrares)

  • 조현철;배진석;김창헌
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2004년도 추계학술대회 논문집
    • /
    • pp.1312-1314
    • /
    • 2004
  • This paper proposes a new simplification algorithm that simplifies reconstructed polygonal mesh from 3D point set considering an original point set. Previous method computes error using mesh information, but it makes to increase error of difference between an original and a simplified model by reason of implementation of simplification. Proposed method simplifies a reconstructed model using an original point data, we acquire a simplified model similar an original. We show several simplified results to demonstrate the usability of our methods.

  • PDF

새로운 분할법에 의한 평면 및 곡면의 삼각형 요소망 자동생성 (Triangular Mesh Generation on Places or Surfaces by a New Looping Method)

  • 이민철;전만수;임우섭
    • 한국CDE학회논문집
    • /
    • 제4권2호
    • /
    • pp.79-86
    • /
    • 1999
  • A general approach to automatic generation of triangular meshes on three-dimensional surfaces is presented in this paper. The approach, developed with emphasis on program generality and interface with CAD/CAM systems, is based on the double mapping method and the looping method. The double mapping method is introduced and anew splitting scheme is proposed for the looping method employed for triangular mesh generation on the parametric domain. Several application examples are given.

  • PDF

CAD 형상 데이터를 이용한 비정렬 격자 자동 생성을 위한 격자셀 크기 지정 기법 (A NEW CELL SIZING METHOD FOR AUTOMATIC UNSTRUCTURED GRID GENERATION USING CAD SURFACE DATA)

  • 이봉주;김병수
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2007년도 추계 학술대회논문집
    • /
    • pp.120-125
    • /
    • 2007
  • In this paper a new cell sizing method is proposed. The new method calculates cell size at a point using given size control elements directly without the aid of background grid as other cell sizing algorithms do. The calculation method and related definitions are described in detail, and typical cell sizing results are given.

  • PDF

탄소섬유강화 플라스틱의 경면연삭가공 특성 (Mirror Surface Grinding Characteristics and Mechanism of Carbon Fiber Reinforced Plastics)

  • 박규열;이대길;중천위웅
    • 대한기계학회논문집
    • /
    • 제18권10호
    • /
    • pp.2514-2522
    • /
    • 1994
  • The mirror surface grinding of carbon fiber reinforced plastics(CFRP) was realized by using the metal bonded super-abrasive micro grain wheel with electrolytic in-process dressing(ELID). The maximum surface roughness $R_{max}$ of CFRP which was obtained with #6,000 wheel, was 0.65 $\mu{m}$, which was rougher surface finish compared to those of hard and brittle materials with the same mesh number wheel with ELID. The grinding performance was much dependent on the grinding direction and the best surface roughness was obtained at $90^{\circ}C$ grinding with fiber direction. The spark-out effect on the surface improvement was significant when smaller mesh number grinding wheels were used. From the surface observations of CFRP with scanning electron microscope(SEM) and Auger electron spectroscopy(AES), it was found that the mirror surface grinding of CFRP was generated by the homogenization due to carbonization of the ground surface and smearing of chips composed of the carbon fiber and carbonized epoxy resin into the ground surface.

A High Quality Mesh Generation with Automatic Differentiation for Surfaces Defined by Hamiltonian Lie Algebra

  • Sagara, Naoya;Makino, Mitsunori
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • pp.1141-1144
    • /
    • 2002
  • The research on computer graphics(CG) has been actively studied and developed. Namely, many surface/solid models have been proposed in the field of computer aided geometric design as well as the one of CG. Since it is difficult to visualize the complex shape exactly, an approximation by generating a set of meshes is usually used. Therefore it is important to guarantee the quality of the approximation in consideration of the computational cost. In this paper, a mesh generation algorithm will be proposed for a surface defined by Lie algebra. The proposed algorithm considers the quality in the meaning of validation of invariants obtained by the mesh, using automatic differentiation.

  • PDF

불균일한 매개변수로 정의된 NURBS 곡면에서의 요소망 자동 생성 (Automatic Mesh Generation on Poorly Parameterized NURBS Surfaces)

  • 채수원;박정민
    • 한국정밀공학회지
    • /
    • 제20권6호
    • /
    • pp.189-196
    • /
    • 2003
  • The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate points are sampled on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then, mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

Submesh Splines over Hierarchical T-meshes

  • Jin, Liangbing;Deng, Jiansong;Chen, Falai
    • International Journal of CAD/CAM
    • /
    • 제9권1호
    • /
    • pp.47-53
    • /
    • 2010
  • In this paper we propose a new type of splines-biquadratic submesh splines over hierarchical T-meshes. The biquadratic submesh splines are in rational form consisting of some biquadratic B-splines defined over tensor-product submeshes of a hierarchical T-mesh, where every submesh is around a cell in the crossing-vertex relationship graph of the T-mesh. We provide an effective algorithm to locate the valid tensor-product submeshes. A local refinement algorithm is presented and the application of submesh splines in surface fitting is provided.

자유 곡면으로 구성되는 3차원 구조물에 대한 자동 요소 분할 (Automatic Mesh Generation for Three-Dimensional Structures Consisting of Free-Form Surfaces)

  • 이준성;;박면웅
    • 한국CDE학회논문집
    • /
    • 제1권1호
    • /
    • pp.65-75
    • /
    • 1996
  • This paper describes an automatic finite element(FE) mesh generation for three-dimensional structures consisting of free-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid and shell structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid and shell structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

  • PDF