• Title/Summary/Keyword: Triangular Partitioning

Search Result 7, Processing Time 0.03 seconds

Finding Self-intersections of a Triangular Mesh by Using Visibility Maps (가시 정보를 이용한 삼각망의 꼬임 찾기)

  • Park S. C.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.382-386
    • /
    • 2004
  • This paper presents an algorithm for the triangular mesh intersection problem. The key aspect of the proposed algorithm is to reduce the number of triangle pairs to be checked for intersection. To this end, it employs two different approaches, the Y-group approach and the space partitioning approach. Even though both approaches have the same objective of reducing the number of triangular-triangular intersection (TTI) pairs, their inherent characteristics are quite different. While the V-group approach works by topology (reduces TTI pairs by guaranteeing no intersection among adjacent triangles), the space partitioning approach works by geometry (reduces TTI pairs by guaranteeing no intersection among distant triangles). The complementary nature of the two approaches brings substantial improvement in reducing the number TTI pairs.

VVC Intra Triangular Partitioning Prediction for Screen Contents (스크린 콘텐츠를 위한 VVC 화면내 삼각형 분할 예측 방법)

  • Choe, Jaeryun;Gwon, Daehyeok;Han, Heeji;Lee, Hahyun;Kang, Jungwon;Choi, Haechul
    • Journal of Broadcast Engineering
    • /
    • v.25 no.3
    • /
    • pp.325-337
    • /
    • 2020
  • Versatile Video Coding (VVC) is a new video coding standard that is being developed by the Joint Video Experts Team of ISO/IEC/ITU-T and it has adopted various technologies including screen content coding tools. Screen contents have a feature that blocks are likely to have diagonal edges like character regions. If triangular partitioning coding is allowed for screen contents having such the feature, coding efficiency would increase. This paper proposes a intra prediction method using triangular partitioning prediction for screen content coding. Similar to the Triangular Prediction Mode of VVC that supports the triangular partitioning prediction, the proposed method derives two prediction blocks using Horizontal and Vertical modes and then it blends the predicted blocks applying masks with triangle shape to generate a final prediction block. The experimental results of the proposed method showed an average of 1.86%, 1.49%, and 1.55% coding efficiency in YUV, respectively, for VVC screen content test sequences.

Simplified Triangular Partitioning Mode (TPM) in Versatile Video Coding(VVC) (VVC 의 삼각 분할 모드(TPM) 간소화 기법)

  • Park, Dohyeon;Yoon, Yong-Uk;Do, JiHoon;Jeong, Dae-Gwon;Kim, Jae-Gon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.06a
    • /
    • pp.116-117
    • /
    • 2019
  • 새로운 비디오 부호화 표준으로 JVET 에서 표준화 중인 VVC(Versatile Video Coding)에서는 더욱 유연한 화면간 예측을 위해 TPM(Triangular Partitioning Mode)을 채택하여 적용하고 있다. 하지만, TPM을 위한 추가적인 움직임 탐색 및 움직임 정보 저장은 VVC 부/복호화기의 복잡도를 증가시킨다. 본 논문에서는 TPM의 복잡도를 줄이기 위한 간소화 기법을 제안한다. 제안기법은 분할된 두개의 삼각 블록에 대한 움직임 정보 조합의 수를 줄여 움직임 탐색의 수를 줄이고 전송되는 데이터의 오버헤드도 함께 줄이는 TPM 간소화 기법이다. 실험결과, 제안기법은 RA(Random Access)와 LDB(Low-Delay B) 부호화 모드에서 미미한 성능 감소가 있었지만 4~6%의 두드러진 부호화 수행 시간 감소를 확인할 수 있었다.

  • PDF

Data Partitioning for Error Resilience and Incremental Rendering of 3D Model (삼차원 모델의 점진적인 렌더링과 오류 강인을 위한 효율적인 데이터 분할 방법 (CODAP))

  • 송문섭;안정환;김성진;한만진;호요성
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1089-1092
    • /
    • 1999
  • Applications using 3D models are increasing recently. Since 3D polygonal models are structured by a triangular mesh, the coding of polygonal models in strips of triangles is an efficient way of representing the data. These strips may be very long, and may take a long time to render or transmit. If the triangle strips are partitioned, it may be possible to perform more efficient data transmission in an error-prone environment and to display the 3D model progressively. In this paper, we devised the Component Based Data Partitioning (CODAP) which is based on Topological Surgery (TS). In order to support the error resilience and the progressively build-up rendering, we partition the connectivity, geometry, and properties of a 3D polygonal model. Each partitioned component is independently encoded and resynchronization between partitioned components is done.

  • PDF

Extended Additional Layer Method for the Calculation of TM mode coupling coefficient for Trapezoidal Gratings (확장된 새로운 층 방법을 이용한 사다리꼴 회절격자의 TM 모드의 결합계수 계산)

  • 조성찬;이동찬;김부균
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.35D no.9
    • /
    • pp.87-92
    • /
    • 1998
  • TM mode coupling coefficients for a generic five-layer DFB structure with trapezoidal and triangular gratings are calculated using the extended additional layer method. To determine the unperturbed field distributions of TM modes, a grating region is replaced by a new uniform layer whose inverse dielectric constant is the average value of the inverse dielectric constant of grating region in both longitudinal and transverse directions. Based on the self-consistent check, the validity of this method is established by comparing the results calculated by partitioning the grating region up to six uniform layers.

  • PDF

Calculation of the coupling coefficient for trapezoidal gratings using extended additional layer method (확장된 새로운 층 방법을 이용한 사다리꼴 회절격자의 결합계수 계산)

  • 조성찬;김부균;김용곤
    • Korean Journal of Optics and Photonics
    • /
    • v.7 no.3
    • /
    • pp.207-212
    • /
    • 1996
  • We propose an extended additional layer method (EALM) of calculating the coupling coefficient of arbitrary shaped diffraction gratings. In EALM, to determine the unperturbed field distribtution, a grating region is replaced by a new uniform layer whose dielectric constant is the average value of the dielectric constant of a grating region in both longitudinal and transverse directions. Using this method, we calculate the coupling coefficient for a five-layer distributed feedback structure device with trapezoidal and triangular gratings. The validity of this method is established by comparing the results calculated by partitioning the grating region up to five uniform layers.

  • PDF

Mesh Decimation for Polygon Rendering Based Real-Time 3-Axis NC Milling Simulation (실시간 3축 NC 밀링 시뮬레이션을 위한 메쉬 간략화 방법)

  • Joo, S.W.;Lee, S.H.;Park, K.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.4
    • /
    • pp.347-358
    • /
    • 2000
  • The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

  • PDF