• 제목/요약/키워드: convex surfaces

검색결과 75건 처리시간 0.028초

VISUALIZATION OF 3D DATA PRESERVING CONVEXITY

  • Hussain Malik Zawwar;Hussain Maria
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.397-410
    • /
    • 2007
  • Visualization of 2D and 3D data, which arises from some scientific phenomena, physical model or mathematical formula, in the form of curve or surface view is one of the important topics in Computer Graphics. The problem gets critically important when data possesses some inherent shape feature. For example, it may have positive feature in one instance and monotone in the other. This paper is concerned with the solution of similar problems when data has convex shape and its visualization is required to have similar inherent features to that of data. A rational cubic function [5] has been used for the review of visualization of 2D data. After that it has been generalized for the visualization of 3D data. Moreover, simple sufficient constraints are made on the free parameters in the description of rational bicubic functions to visualize the 3D convex data in the view of convex surfaces.

오목면 및 볼록면에 존재하는 난류경계층유동과 경사지게 분사되는 난류제트의 유동특성 (Flow Characteristics of Inclined Turbulent Jet Issuing into Turbulent Boundary Layer Developing on Concave and Convex Surfaces)

  • 이상우;이준식;이택식
    • 대한기계학회논문집
    • /
    • 제16권2호
    • /
    • pp.302-312
    • /
    • 1992
  • Three dimensional velocity measurements of a 35.deg. inclined jet issuing into turbulent boundary layer on both concave and convex surfaces have been conducted. To investigate solely the effect of each curvature on the flow field, streamwise pressure variations are minimized by adjusting the shape of the opposite wall in the curved region. From the measured velocity components, streamwise mean vorticities are calculated to determine jet-crossflow interface. The results on convex surface show that the injected jet is separated from the wall and the bound vortex maintains its structure far downstream. On concave surface, the secondary flow in the jet cross-sections are enhanced and in some downstream region from the jet exit, the flow on the concave surface has been developed to Taylor-Gortler vortices

반구형 소형 간극 내에서의 냉각과정에 관한 실험적 연구 (An Experimental Study on the Quenching Phenomena of Hemispherical Downward Facing Convex Surfaces with Narrow Gaps)

  • 하광순;박래준;김상백;조영로;김희동
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집D
    • /
    • pp.447-452
    • /
    • 2001
  • Quenching phenomena of hemispherical downward facing convex surfaces with narrow gaps have been investigated experimentally. Experiments employed test sections having 1 and 2 mm in gap thickness and 1 atm in system pressure. From interpretations of the temperature and the heat flux history, it was found that the flooding inside the gap was restricted by CCFL phenomena and quenching process was propagated from lower to upper region of the internal copper shell. The ratio of the maximum heat fluxes at 1 mm to 2mm in gap thickness was the almost same that obtained by steady state experiments. The quenching scenario of the hemispherical downward facing surface with narrow gap has been suggested.

  • PDF

토폴로지 정보가 없는 CAD 곡면의 꺾인 모서리 탐색 (Convex Sharp Edge Detection of CAD Surfaces without Topology)

  • 박정환;이정근
    • 한국정밀공학회지
    • /
    • 제17권2호
    • /
    • pp.73-79
    • /
    • 2000
  • The part-surface of mold or stamping-dies consists of a compound surface which consists of lots of composite surfaces, and may have various types of feature shapes including convex sharp edge (CSE). Those CSE features should be considered with care in machining the surface, which necessitates extraction of CSE curves on a compound surface. This work can be done rather easily for a solid model which has a complete topology information. In case of the compound surface without topology information, however, such CSE curves must be gathered through some geometrical calculations paying much computation time. In the paper, extracting CSE curves by the construction of a CSE region-map which can reduce time, and detecting various common edge types are presented.

  • PDF

CONVEX DECOMPOSITIONS OF REAL PROJECTIVE SURFACES. III : FOR CLOSED OR NONORIENTABLE SURFACES

  • Park, Suh-Young
    • 대한수학회지
    • /
    • 제33권4호
    • /
    • pp.1139-1171
    • /
    • 1996
  • The purpose of our research is to understand geometric and topological aspects of real projective structures on surfaces. A real projective surface is a differentiable surface with an atlas of charts to $RP^2$ such that transition functions are restrictions of projective automorphisms of $RP^2$. Since such an atlas lifts projective geometry on $RP^2$ to the surface locally and consistently, one can study the global projective geometry of surfaces.

  • PDF

Gait Planning of Quadruped Walking and Climbing Robot in Convex Corner Environment

  • Loc, Vo Gia;Kang, Tae-Hun;Song, Hyun-Sup;Choi, Hyouk-Ryeol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.314-319
    • /
    • 2005
  • When a robot navigates in the real environment, it frequently meets various environments that can be expressed by simple geometrical shapes such as fiat floor, uneven floor, floor with obstacles, slopes, concave or convex corners, etc. Among them, the convex corner composed of two plain surfaces is the most difficult one for the robot to negotiate. In this paper, we propose a gait planning algorithm to help the robot overcome the convex environment. The trajectory of the body is derived from the maximum distance between the edge boundary of the corner and the bottom of the robot when it travels in the convex environment. Additionally, we find the relation between kinematical structure of the robot and its ability of avoiding collision. The relation is realized by considering the workspace and the best posture of the robot in the convex structure. To provide necessary information for the algorithm, we use an IR sensor attached in the leg of the robot to perceive the convex environment. The validity of the gait planning algorithm is verified through simulations and the performance is demonstrated using a quadruped walking robot, called "MRWALLSPECT III"( Multifunctional Robot for WALL inSPECTion version 3).

  • PDF

곡면의 강성의 역사 (Rigidity of surfaces)

  • 김호범
    • 한국수학사학회지
    • /
    • 제20권4호
    • /
    • pp.49-60
    • /
    • 2007
  • 본 논문에서는 초등기하에 나오는 도형의 합동의 개념으로부터 자연스럽게 얻어지는 3차원 유클리드 공간에 있는 매끄러운 곡면의 강성의 개념을 소개하고 컴팩트 곡면의 강성이론의 발전과정과 그 일반화를 살펴본다.

  • PDF

엄밀한 광선추적법에 의한 푸리에변환 holographic kinoform의 분석 (Analysis of Fourier-transform Holographic Kinoforms Using Exact Ray Tracing)

  • 조두진
    • 한국광학회지
    • /
    • 제4권4호
    • /
    • pp.390-396
    • /
    • 1993
  • 1차원 telecentric paraxial holographic kinoform을 푸리에변환 렌즈로 사용하는 경우에 있어서, 3가지 표면양각형태, 즉 평면-볼록면, 블록면-평면, 좌우대칭 불록면에 대하여 스넬의 법칙을 기반으로 하는 엄밀한 광성추적법을 적용하여 분석하였다. kinoform은 F/8, 초점거리 15mm이며 kinoform과 그 주변 매질의 굴절율을 변화시키므로써 zone수와 두께 그리고 포물면의 경사도를 변화시켰다. 일반적으로 좌우대칭 볼록면 형태가 가장 좋은 성능을 갖는 것으로 나타났고, 모든 경우에 있어서 포물면의 경사도가 증가함에 따라 입사각의 증가에 따른 성능이 저하되었다.

  • PDF

실루엣 기반의 관계그래프 이용한 강인한 3차원 물체 인식 (Robust Recognition of 3D Object Using Attributed Relation Graph of Silhouette's)

  • 김대웅;백경환;한헌수
    • 한국정밀공학회지
    • /
    • 제25권7호
    • /
    • pp.103-110
    • /
    • 2008
  • This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull consists of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.