• Title/Summary/Keyword: Octant

Search Result 11, Processing Time 0.02 seconds

A Study on Octree Conversion Algorithm from Boundary Representation (경계선 표현에 대한 8진 트리변환 방법에 관한 연구)

  • 최윤호;김재현;박상희
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.8
    • /
    • pp.922-931
    • /
    • 1992
  • This paper presents an efficient algorithm for converting the boundary representation of a polyhedron to its corresponding octree representation which is convenient for detecting intersection between objects. In order to determine the states of octants efficiently and quickly, our algorithm consists of three basic processes which use the bounding box, the infinite plane and the projection. In our conversion algorithm, the states of octants are determined by performing one of these three processes according to the intersecting pattern of an octant with a polyhedron, instead of by performing only a face-to-face intersection test repeatedly. In particular, states of 8 suboctants are determined completely by performing the process using only the infinite plane, when the given octant is intersected with only a patch of the polyhedron. Finally, by using a 3D display method and a volume ratio method, it is confirmed that the octree converted by out algorithm is accurate. It is also confirmed that the conversion time is reduced in our algorithm.

A Study on the Relationships between the Palmette Patterns on Carpets of Sassanid Persia and Silla Korea

  • Hyunjin, CHO
    • Acta Via Serica
    • /
    • v.7 no.2
    • /
    • pp.153-178
    • /
    • 2022
  • This study analyzes the traces of East-West cultural exchange focusing on the palmette pattern expressed on Sassanid Persian and Silla Korean carpets. The results of the study are as follows. The palmette, which originated in ancient Egypt, is an imaginary flower made up of the transformation of a lotus, which combined with the Mesopotamian quadrant (四分法) and expanded to a four-leaf palmette and further to an eight-leaf palmette by applying the octant (八分法). The palmette, which was brought to Assyria, Achaemenid Persia, Parthia, Greece, and Rome, can be seen lavishly decorated with plant motifs characteristic of the region. Sassanid Persia inherited the tradition of the palmette pattern, which applied the quadrant and octant seen in several previous dynasties. On the one hand, it has evolved more splendidly by combining the twenty or twenty-one-leaf palmette and the traditional pearl-rounded pattern decoration of Sassanid Persia. These Sassanid Persian palmette patterns can be found through the palmette patterns depicted on the ceilings of the Dunhuang Grottoes located on the Silk Road. The palmette pattern of the Dunhuang Grottoes was expressed in the form of a fusion of Persian Zoroastrianism, Indian Buddhism, and indigenous religions. In the Tang Dynasty, it shows the typical palmette pattern of four and eight leaves in the medallion composition, which were mainly seen in Persian palmettes. The palmette pattern handed down to Silla can be found on a Silla carpet, estimated to be from around the 8th century, in the collection of Shoso-in (正倉院), Japan. The Silla carpet shows a unique Silla style using motifs such as peonies and young monks, which were popular in Silla while following the overall design of the Persian medallion.

Automatic Generation of 3-D Finite Element Meshes : Part(I) - Tetrahedron-Based Octree Encoding - (삼차원 유한요소의 자동생성 (1) - 사면체 옥트리의 구성 -)

  • 정융호;이건우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.12
    • /
    • pp.3159-3174
    • /
    • 1994
  • A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

Tool Path Generation for Rough Cutting Using Octree (옥트리를 이용한 황삭 가공경로생성)

  • 김태주;이건우;홍성의
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.1
    • /
    • pp.53-64
    • /
    • 1994
  • Rouge cutting process takes the major portion of machining operation using NC milling machine. Especially, most of the machining time is spent in this process when molds are machined. Therefore, an efficient algorithm for generating the tool path for rough cutting is suggested in this paper. The first step of the procedure is getting the volume to be machined by applying the Boolean operation on the finished model and the workpiece which have been modeling system. Basic principle of determining machining procedure is that a large tool should be used at the portion of the simple shape while a small tool should be used at the complex portion. This principle is realized by representing the volume to be machined by an octree, which is basically a set of hexahedrons, and matching the proper tools with the given octants. When the tools are matched with the octants, the tool path can be derived at the same time.

Fast Geometric Transformations of 3D Images Represented by an Octree (8진트리로 표현된 3차원 영상의 빠른 기학학적 변환)

  • Heo, Yeong-Nam;Park, Seung-Jin;Kim, Eung-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.6
    • /
    • pp.831-838
    • /
    • 1995
  • Geometric transformations require many operations in displaying moving 3D objects on the screen and a fast computation is a important problem in CAD or animation applications. The general method to compute the transformation coordinates of an object represented by an octree must perform the operations on every node. This paper proposes an efficient method that computes the rectangular coordinates of the vertices of the octree nodes into the coordinates of the universe space using the basicvectors in order to compute quickly geometric transformations of 3D images represented by an octree. The coordinates of the vertices of each octant are computed by using the formula presented here, which requies additions and multiplications by powers of 2. This method has a very fast execution time and is compared with the general computation method.

  • PDF

First Record of Box Jellyfish, Carybdea brevipedalia (Cnidaria: Cubozoa: Carybdeidae) from Korean Coastal Waters: Morphology and Molecular Descriptions

  • Chae, Jinho;Yoon, Won-Duk;Kim, ByeongHo;Ki, Jang-Seu
    • Animal Systematics, Evolution and Diversity
    • /
    • v.33 no.1
    • /
    • pp.8-16
    • /
    • 2017
  • We firstly described a box jellyfish, Carybdea brevipedalia collected from the southern coasts of Korea. It is morphologically characterized by gastric phacellae, a special digestive system of cubozoan jellyfish, and velarium, the thin muscle flap forming the opening of the subumbrellar cavity. The phacellae are linear-shaped, comprising numerous cirri branched from multiple roots. Each root also has multiple numbers of cirrus bundles. Basis of velarial cannels parts into two branches in each octant of velarium. Its geographic distributions were limited to Jeju-do and the middle-southern coasts where the organisms are seriously hazardous to bathers in summer. Numerous individuals and/or large-sized populations were observed specifically from beaches at Jeju-do, Namhae-do and a small fishing port of Namildae, while only a small amount of the individuals was observed in Gamak Bay, Jaran-Goseung Bay, and Geoje-do. We confirmed molecular identity of the Korean C. brevipedalia with comparison of nuclear ribosomal DNA sequences. Until now, Carybdea brevipedalia is the only cubozoan species reported to be distributed in Korean waters.

Stereoselective Electron Transfer and Ionic Association between Λ$-[Co(EDDS)]^-and [Co(en)_3]^{2+}$ (광학활성인 Λ$-[Co(EDDS)]^-$$[Co(en)_3]^{2+}$간의 입체선택적 전자전달 및 이온회합)

  • Lee, Dong Jin;O, Chang Eon;Do, Myeong Gi
    • Journal of the Korean Chemical Society
    • /
    • v.34 no.2
    • /
    • pp.159-164
    • /
    • 1990
  • Absolute configuration of optically active [Co(EDDS)]- (EDDS = ethylenediaminedisuccinate) complex was determined as Λ-form by octant rule and spectroscopic data, and the stereoselective ionic association of Λ-[Co(EDDS)]- and racemic-$[Co(en)^3]_{3+}$ occurs preferrentially between Λ$-[Co(EDDS)]-$ and Δ$-[Co(en)3]3+$. The stereoselective electron-transfer reaction between Λ-[Co(EDDS)]- and racemic-$[Co(en)_3]^{2+}$ has produced 14% e.e (e.e = enantiomeric excess) of Δ$[Co(en)_3]^{3+}$ through the stereoselective ion pairing.

  • PDF

REYNOLDS NUMBER EFFECTS ON MASS TRANSFER IN TURBULENT PIPE FLOW: PART II. INSTANTANEOUS CONCENTRATION FIELD, HIGHER-ORDER STATISTICS AND MASS TRANSFER BUDGETS (난류 파이프 유동 내 물질전달에 대한 레이놀즈 수 영향: Part II. 순간농도장, 고차 난류통계치 및 물질전달수지)

  • Kang, Chang-Woo;Yang, Kyung-Soo
    • Journal of computational fluids engineering
    • /
    • v.17 no.3
    • /
    • pp.59-67
    • /
    • 2012
  • Large Eddy Simulation(LES) of turbulent mass transfer in fully developed turbulent pipe flow has been performed to study the effect of Reynolds number on the concentration fields at $Re_{\tau}=180$, 395, 590 based on friction velocity and pipe radius. Dynamic subgrid-scale models for the turbulent subgrid-scale stresses and mass fluxes were employed to close the governing equations. Fully developed turbulent pipe flows with constant mass flux imposed at the wall are studied for Sc=0.71. The mean concentration profiles and turbulent intensities obtained from the present LES are in good agreement with the previous numerical and experimental results currently available. The effects of Reynolds number on the turbulent mass transfer are identified in the higher-order statistics(Skewness and Flatness factor) and instantaneous concentration fields. The budgets of turbulent mass fluxes and concentration variance were computed and analyzed to elucidate the effect of Reynolds number on turbulent mass transfer. Furthermore, to understand the correlation between near-wall turbulence structure and concentration fluctuation, we present an octant analysis in the vicinity of the pipe wall.

상수를 염소소독시 생성되는 염소 소독부산물(DBPs)의 생성능에 관한 연구

  • Jeong, Yong;Shin, Dong-Cheon;Lim, Young-Uk;Kim, Jun-Seong;Park, Yeon-Sin
    • Proceedings of the Korea Society of Environmental Toocicology Conference
    • /
    • 1996.12a
    • /
    • pp.75-75
    • /
    • 1996
  • 최근 가장 관심이 집중되고 있는 음용수중의 미량오염물질로는 인위적으로 첨가되는 소독제(disi octant)로 인한 소독부산물(disinfection by-products: DBPs)을 들 수 있다. 1970년대부터 염소소독시 수중의 유기오염물길과 반응하여 발암성물질 과 돌연변이 물질이 다수 함유되어 있는 클로로포름(chloform)을 포함한 트리할로메탄(Trih리omethane: THMs)의 생성이 발견되었으며 이로 인한 건강상의 영향이 지속적으로 보고되고 있다. 염소소독시 780가지 이상의 화합물이 염소와 휴믹산(humic acids)과의 반응에 의해 생성되며, 이중 대부분이 할로겐 화합물로 알려져 있다. 염소 소독부산물로는 인체발암력을 지니고 있는 트리할로메탄(THMs) 이외에도 할로아세틱산(Haloaceticacids: HAAs), 할로아세토나이트릴(Haloacetbnitriles: HANs)등이 주 생성물질인 것으로 알려져 있으나 우러나라의 원수특성에 따른 소독부산물의 생성능 (Formation potential)에 대한 연구가 미흡한 실정이다. 본 연구에서는 우리나라 주요 4대강(한강, 대청호, 영산강, 낙동강)의 원수를 실험실내에서 염소처리하여 생성되는 소독부산물의 생성농과 pH, 체류시간 등의 조건에 따라 생성능을 조사하였다. 각 화합물은 추출 및 농축과정을 거친 후 GC/MSD를 사용하여 물질을 확인한 후 할로겐화합물에 민감한 GC/ECD를 사용하여 시료를 분석하였다. pH와 시간, 원수중의 유기물 함량이 소독부산물의 생성에 많은 영향을 미치는 것으로 나타났다. THMs은 알칼리에서, HAAs의 경우는 약산성에서 접촉시간이 증가할수록 높은 생성능을 보였고, HANs의 경우는 급속히 생성했다가 시간이 경과함에 따라 소멸하며 약산성에서 높은 생성능을 보임을 알 수 있었다, 강별로는 낙동강에서 THMs파 HANs의 생성능이 비교적 높았고, 영산강에서는 HAAs의 생성능이 높았다. 각 원수의 특성에 따른 생성능을 파악함으로써 생성능 저감방안을 마련하며, 소독 부산물질의 인체노출평가에 따른 위해성평가를 통해 관리기준을 설정해야 할 것이다.

  • PDF

A Systematic Demapping Algorithm for Three-Dimensional Signal Transmission (3차원 신호 전송을 위한 체계적인 역사상 알고리즘)

  • Kang, Seog Geun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.8
    • /
    • pp.1833-1839
    • /
    • 2014
  • In this paper, a systematic demapping algorithm for three-dimensional (3-D) lattice signal constellations is presented. The algorithm consists of decision of an octant, computation of a distance from the origin, and determination of the coordinates of a symbol. Since the algorithm can be extended systematically, it is applicable to the larger lattice constellations. To verify the algorithm, 3-D signal transmission systems with field programmable gate array (FPGA) and $Matlab^{(R)}$ are implemented. And they are exploited to carry out computer simulation. As a result, both hardware and software based systems produce almost the same symbol error rates (SERs) in an additive white Gaussian noise (AWGN) environment. In addition, the hardware based system implemented with an FPGA generates waveforms of 3-D signals and recovers the original binary sequences perfectly. Those results confirm that the algorithm and the implemented 3-D transmission system operate correctly.