• 제목/요약/키워드: Polygon Clipping Algorithm

검색결과 3건 처리시간 0.019초

다각형 클리핑 알고리즘(Polygon Clipping Algorithm)을 이용한 배구경기 분석 프로그램 개발 (Development of Volleyball Match Analysis Program through Polygon Clipping Algorithm)

  • 홍성진;이기청
    • 한국운동역학회지
    • /
    • 제23권1호
    • /
    • pp.45-51
    • /
    • 2013
  • The current study developed the analysis program by employing the Polygon Clipping Algorithm to calculate the open area on the court when players try to spike a ball. The program consists of two kinds of output screen. First, on the main output screen, it is possible to calculate both blocked area by net and blockers, and opened area to avoid the blocked area when players spike the ball. Additionally, the secondary output screen shows the moving path of setter and the location of set. Main output screen indicates hitting points of spiking, blocking, and open area. Also, it is possible to analyze the movement of setter, location of set, and hitting point of attacker. The program was tested by comparing real coordinate value and location coordinate value which is operated on the program. To apply this program in the field, future study needs to develop the program that can calculate three dimensions coordinate fast by tracking the location of players or ball in real time.

공차를 고려한 다각형 영역의 내외부 판별 알고리즘 (Tolerance-based Point Classification Algorithm for a Polygonal Region)

  • 정연찬;박준철
    • 한국CDE학회논문집
    • /
    • 제7권2호
    • /
    • pp.75-80
    • /
    • 2002
  • This paper details a robust and efficient algorithm for point classification with respect to a polygon in 2D real number domain. The concept of tolerance makes this algorithm robust and consistent. It enables to define‘on-boundary’ , which can be interpreted as either‘in-’or‘out-’side region, and to manage rounding errors in floating point computation. Also the tolerance is used as a measure of reliability of point classifications. The proposed algorithm is based on a ray-intersection technique known as the most efficient, in which intersections between a ray originating from a given test point and the boundary of a region are counted. An odd number of intersections indicates that the point is inside region. For practical examples the algorithm is most efficient because most edges of the polygon region are processed by simple bit operations.

An Effective Algorithm for Transmitted Solar Radiation Calculation through Window Glazing on a Clear Day

  • Oh, John Kie-Whan
    • KIEAE Journal
    • /
    • 제14권4호
    • /
    • pp.35-45
    • /
    • 2014
  • The main objective of this study is to provide an effective algorithm of the transmitted solar radiation calculation through window glazing on a clear day. This algorithm would be used in developing a computer program for fenestration system analysis and shading device design. Various simulation methods have been evaluated to figure out the most accurate and effective procedure in estimation of transmitted solar radiation on a tilted surface on a clear day. Characteristics of simulated results of each step have been scrutinized by comparing them with measured results of the site as well as results from other simulation programs. Generally, the Duffie & Beckman's solar calculation method introducing the HDKR anisotropic model provided the most reliable simulation results. The DOE-2 program usually provided over-estimated simulation results. The estimation of extraterrestrial solar radiation and beam normal radiation were conducted pretty accurately. However, the solar radiation either on horizontal surface or on tilted surface involves complicated factors in estimation. Even though the estimation results were close to the real measured data during summer when solar intensity is getting higher, the estimation provided more error when solar intensities were getting weaker. The convex polygon clipping algorithm with homogeneous coordinates was fastest model in calculation of sunlight to shaded area ratio. It could not be applied because of its shape limitation.