• Title/Summary/Keyword: Tiling

Search Result 115, Processing Time 0.028 seconds

First record of Sorbaria kirilowii (Rosaceae-Spiraeoideae) from Korea (쉬땅나무속(장미과-조팝나무아과)의 미기록 식물: 좀쉬땅나무)

  • Song, Jun-Ho;Chang, Chin-Sung;Hong, Suk-Pyo
    • Korean Journal of Plant Taxonomy
    • /
    • v.40 no.3
    • /
    • pp.174-178
    • /
    • 2010
  • We report an unrecorded species of the genus Sorbaria (Rosaceae) in Korea, namely Sorbaria kirilowii (Regel & Tiling) Maxim. This plant was discovered both on Pocheon-si, Naecheon-myeon and Yeoju-gun, Buknae-myeon in Gyeonggi Province. It is distinguishable from Sorbaria sorbifolia (L.) A. Braun var. stellipila Maxim. by characteristics such as presence of hair on leaf and rachis, morphology of inflorescence, length and width of petal, shape of sepal, number and length of stamens, presence of hair upon and size of follicles. This taxon was given the Korean common name 'Jom-swi-ttang-na-mu' based on the small size of floral characters.

East Reconstruction of 3D Human Model from Contour Lines (외곽선을 이용한 고속 3차원 인체모델 재구성)

  • Shin Byeong-Seok;Roh Sung;Jung Hoe-Sang;Chung Min Suk;Lee Yong Sook
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.537-543
    • /
    • 2004
  • In order to create three-dimensional model for human body, a method that reconstructs geometric models from contour lines on cross-section images is commonly used. We can get a set of contour lines by acquiring CT or MR images and segmenting anatomical structures. Previously proposed method divides entire contour line into simply matched regions and clefts. Since long processing time is required for reconstructing cleft regions, its performance might be degraded when manipulating complex data such as cross-sections for human body. In this paper, we propose a fast reconstruction method. It generates a triangle strip with single tiling operation for simple region that does not contain branch structures. If there exist branches in contour lines, it partitions the contour line into several sub-contours by considering the number of vertices and their spatial distribution. We implemented an automatic surface reconstruction system by using our method which reconstructs three-dimensional models for anatomical structures.

A Surface Reconstruction Method from Contours Based on Dividing Virtual Belt (가상벨트 분할에 기반한 등고선으로부터의 표면재구성 방법)

  • Choi, Young-Kyu;Lee, Seung-Ha
    • The KIPS Transactions:PartB
    • /
    • v.14B no.6
    • /
    • pp.413-422
    • /
    • 2007
  • This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

Proposal of 3D Graphic Processor Using Multi-Access Memory System (Multi-Access Memory System을 이용한 3D 그래픽 프로세서 제안)

  • Lee, S-Ra-El;Kim, Jae-Hee;Ko, Kyung-Sik;Park, Jong-Won
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.4
    • /
    • pp.119-128
    • /
    • 2019
  • Due to the nature of the 3D graphics processor system, many mathematical calculations are required and parallel processing research using GPU (Graphics Processing Unit) is being performed for high-speed processing. In this paper, we propose a 3D graphics processor using MAMS, a parallel processor that does not use cache memory, to solve the GPU problem of increasing bandwidth caused by cache memory miss and the problem that 3D shader processing speed is not constant. The 3D graphics processor using MAMS proposed in this paper designed Vertex shader, Pixel shader, Tiling and Rasterizing structure using DirectX command analysis, the FPGA(Xilinx Virtex6@100MHz) board for MAMS was constructed and designed using Verilog. We compared the processing time of the developed FPGA (100Mhz) and nVidia GeForce GTX 660 (980Mhz), the processing time using GTX 660 was not constant and suing MAMS was constant.

TILINGS OF ORTHOGONAL POLYGONS WITH SIMILAR RECTANGLES OR TRIANGLES

  • SU ZHANJUN;DING REN
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.343-350
    • /
    • 2005
  • In this paper we prove two results about tilings of orthogonal polygons. (1) P be an orthogonal polygon with rational vertex coordinates and let R(u) be a rectangle with side lengths u and 1. An orthogonal polygon P can be tiled with similar copies of R(u) if and only if u i algebraic and the real part of each of its conjugates is positive; (2) Laczkovich proved that if a triangle $\Delta$ tiles a rectangle then either $\Delta$ is a right triangle or the angles of $\Delta$ are rational multiples of $\pi$. We generalize the result of Laczkovich to orthogonal polygons.

Legorization from silhouette-fitted voxelization

  • Min, Kyungha;Park, Cheolseong;Yang, Heekyung;Yun, Grim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2782-2805
    • /
    • 2018
  • We present a legorization framework that produces a LEGO model from user-specified 3D mesh model. Our framework is composed of two stages: voxelization and legorization. In the voxelization, input 3D mesh is converted to a voxel model. To preserve the shape of the 3D mesh, we devise a silhouette fitting process for the initial voxel model. For legorization, we propose three objectives: stability, aesthetics and efficiency. These objectives are expressed in a tiling equation, which builds a LEGO model using layer-by-layer approach. We legorize five models including characters and buildings to prove the excellence of our framework.

A Study on the Design of a Current Type ROIC for Uncooled Bolometer Thermal Image Sensor Using Correlated Double Sampling

  • Kwak, Sang-Hyeon;Lee, Po;Jung, Eun-Sik;Sung, Man-Young
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2009.06a
    • /
    • pp.7-8
    • /
    • 2009
  • In the presence of infrared light, a CMOS Readout IC (ROIC) for a microbolometer typed infrared sensor detects the voltage or current that is caused by the changing in resistance in the bolometer sensor. A serious problem in designing the ROIC is how the value of the bolometer and reference resistors vary because of variations in manufacturing process. Since different pixel have different, resistance values, sensor operations must contend with fixed pattern noise (FPN) problems. In this paper, we propose a novel technique to compensate for the fluctuation in reference resistance by tiling into account the process variation. By using constant current source basing and correlated double sampling, we solved FPN.

  • PDF

Locality-Conscious Nested-Loops Parallelization

  • Parsa, Saeed;Hamzei, Mohammad
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.124-133
    • /
    • 2014
  • To speed up data-intensive programs, two complementary techniques, namely nested loops parallelization and data locality optimization, should be considered. Effective parallelization techniques distribute the computation and necessary data across different processors, whereas data locality places data on the same processor. Therefore, locality and parallelization may demand different loop transformations. As such, an integrated approach that combines these two can generate much better results than each individual approach. This paper proposes a unified approach that integrates these two techniques to obtain an appropriate loop transformation. Applying this transformation results in coarse grain parallelism through exploiting the largest possible groups of outer permutable loops in addition to data locality through dependence satisfaction at inner loops. These groups can be further tiled to improve data locality through exploiting data reuse in multiple dimensions.

A study of Running Test for Korean Tiling Train eXpress(TTX) (동력 분산형 한국형 틸팅열차 시험 데이터 연구)

  • Lee, Gi-Sik;Han, Seong-Ho;Song, Yong-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2008.11a
    • /
    • pp.497-499
    • /
    • 2008
  • Tilting train has been developed to increase the operational speed of the trains on conventional lines which have many curves. This train are lilted at curves to compensate for unbalanced carbody centrifugal acceleration to a greater extent than compensation produced by the track cant so that passengers do not feel centrifugal acceleration and thus trains can run at higher speed at curves. This paper developed tilting train to evaluate train performance of TTX(korean tilting train express) with maximum operation speed 160 km/h on Ho_nam Conventional Rail[1].

  • PDF

직접해법에 의한 공기 윤활 틸팅 패드 저어널 베어링의 윤활 해석에 관한 연구

  • 김인식;황명
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1993.04b
    • /
    • pp.121-126
    • /
    • 1993
  • Tiling pad journal bearing that has high stability is analyzed about air-lubricated bearing that is usually used to need high precision by using the Direct analysis. The pressure that supports the shaft is occured by the differences between the shaft and pads radii of curvatures. So the characteristics of load capacity for their variable values is important. In this paper the load capacity is compared with some the eccentricity ratio values of0.1, 0.2, 0.5, 0.8. The large load capacity comes from large eccentricity ratio, highbearing number and high preload. But if the preload become high too much, then the shaft makes contact with pads.