• Title/Summary/Keyword: convex polygon

Search Result 78, Processing Time 0.022 seconds

VARIOUS CENTROIDS OF POLYGONS AND SOME CHARACTERIZATIONS OF RHOMBI

  • Kim, Dong-Soo;Kim, Wonyong;Lee, Kwang Seuk;Yoon, Dae Won
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.135-145
    • /
    • 2017
  • For a polygon P, we consider the centroid $G_0$ of the vertices of P, the centroid $G_1$ of the edges of P and the centroid $G_2$ of the interior of P. When P is a triangle, (1) we always have $G_0=G_2$ and (2) P satisfies $G_1=G_2$ if and only if it is equilateral. For a quadrangle P, one of $G_0=G_2$ and $G_0=G_1$ implies that P is a parallelogram. In this paper, we investigate the relationships between centroids of quadrangles. As a result, we establish some characterizations for rhombi and show that among convex quadrangles whose two diagonals are perpendicular to each other, rhombi and kites are the only ones satisfying $G_1=G_2$. Furthermore, we completely classify such quadrangles.

Point Pattern Matching Algorithm Using Unit-Circle Parametrization

  • Choi, Nam-Seok;Lee, Byung-Gook;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.825-832
    • /
    • 2010
  • This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

A Study on the Synthesis of Four-Bur Linkage Generating Automatic Path by Using B-Spline Interpolation (B-스플라인 보간법에 의한 자동 경로 생성이 가능한 4절링크의 합성에 관한 연구)

  • Kim, Jin-Su;Yang, Hyun-Ik
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.10
    • /
    • pp.126-131
    • /
    • 1999
  • Up until now, it is said that no satisfactory computer solutions have been found for synthesizing four-bar linkage based on the prescribed coupler link curve. In our study, an algorithm has been developed to improve the design synthesis of four-bar linkage automatically generating prescribed path by using B-spline interpolation. The suggested algorithm generates the desired coupler curve by using B-spline interpolation, and hence the generated curve approximates as closely as to the desired curve representing coupler link trajectory. Also, when comparing each generated polygon with the control polygon, rapid comparison by applying convex hull concept. finally, optimization process using ADS is incorporated into the algorithm based on the 5 precision point method to reduce the total optimization process time. As for examples, three different four-bar linkages were tested and the results showed the effectiveness of the algorithm.

  • PDF

Synthesis of Automatically Path-Generating Four-Bar Linkage Using NURBS (NURBS를 이용한 4절 링크의 자동 경로 생성)

  • Hwang, Deuk-Hyun;Yang, Hyun-Ik
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.18 no.6
    • /
    • pp.576-584
    • /
    • 2009
  • Up to now, it has been said that no satisfactory computer solution has been found for synthesizing four-bar linkage based on the prescribed coupler link curve. In our study, an algorithm has been developed to improve the design synthesis of four bar linkage based on the 5 precision points method. The suggested algorithm generates the desired coupler curve by using NURBS, and then the generated curve approximates as closely as possible to the desired curve representing coupler link trajectory. Also, when comparing each generated curve by constructing the control polygon, rapid comparison is easily achieved by applying convex hull of the control polygon. Finally, an optimization process using ADS is incorporated into the algorithm based on the 5 precision point method to reduce the total optimization process time. As for examples, two four bar linkages were tested and the result well demonstrated the effectiveness of the algorithm.

  • PDF

Home-range of Raccoon Dog Nyctereutes procyonoides Living in the Rural Area of Korea (농촌 지역의 너구리 Nyctereutes procyonoides 행동권)

  • Choi, Tae-Young;Park, Chong-Hwa
    • Journal of Ecology and Environment
    • /
    • v.29 no.3
    • /
    • pp.259-263
    • /
    • 2006
  • The objectives of this paper are to estimate home range and core habitat area of raccoon dog living in the rural area of Korea. A radio-telemetry study was carried out on 22 raccoon dog individuals. Among these individuals, 4 raccoon dogs made 2 pairs and they were monogamous and moved together all the year round. Mean home-range size of 9 individuals which were radio-tracked more than 3 months was $0.80km^2$ (100% MCP). The mean home range size of male individuals was $0.98km^2$ (N=5, 100% MCP) and that of female individuals was $0.58km^2$ (N=4, 100% MCP). On the other hand, in case 95% MCP(Mininlum Convex Polygon) was applied, the gap of home-range size between sex distinction was closed to $0.63km^2$ (male) and $0.42km^2$ (female). The home range size of two pairs of which the male and the female were radio-tracked at the same time showed little difference. In case of one pair, the home range size(95% MCP) was $0.28km^2$ (male) and $0.26km^2$ (female) and in case of the other pair, it was $0.36km^2$ each (male and female). Consequently there seems no significant difference in the home-range size between a male and a female racoon dog except the unusual cases such as unpaired individuals or the ones with no fixed territory.

Movements and Home-range of Mallards by GPS-Mobile based Telementary (WT-200) in Korea (야생동물위치추적기(WT-200)를 이용한 청둥오리의 이동거리 및 행동권 연구)

  • Kang, Tehan;Kim, Dal-Ho;Cho, Hae-Jin;Shin, Young-Un;Lee, Hansoo;Suh, Jae-Hwa;Hwang, Jongkyung
    • Korean Journal of Environment and Ecology
    • /
    • v.28 no.6
    • /
    • pp.642-649
    • /
    • 2014
  • Mallard (Anas platyrhynchos) is the abundant winter visitor in South Korea. Mallard migrates long distances between Russian Siberia and Korea. This species prefers a rice paddy area as their winter habitat. We captured birds using cannon-net, and attached the GPS-Mobile phone based Telemetry(WT-200) on Seven Mallards in the winter of 2011~2013. We were monitored wintering home-range and movement distance. We analyzed the tracking location data using ArcGIS 9.0 and calculated Kernel Density Estimation (KDE) and Minimum Convex Polygon (MCP). The average home-range in the wintering ground by MCP was $118.8km^2$(SD=70.1, n=7)and the maximum home-rang was $221.8km^2$ and the minimum was $27.7km^2$. Extents of home-range by KDE were $60.0km^2$(KDE 90%), $23.0km^2$(KDE 70%) and $11.6km^2$(KDE 50%). Mallard moved an average of 19.4 km from start site(attach to WT-200 site), maximum moved was 33.2 km and minimum moved was 9.4 km. The average distance of 0.8 km between GPS fixed point(range 0.2~1.6 km), maximum moved was 19.7 km. Mallard moved a very short distance in wintering season and showed a very high water-dependent trends in wintering site.

An Inquiry into Convex Polygons which can be made by Seven Pieces of Square Seven-piece Puzzles (정사각형 칠교판의 일곱 조각으로 만들 수 있는 볼록 다각형의 탐색)

  • Park, Kyo-Sik
    • Journal of Educational Research in Mathematics
    • /
    • v.17 no.3
    • /
    • pp.221-232
    • /
    • 2007
  • In school mathematics, activities to make particular convex polygons by attaching edgewise some pieces of tangram are introduced. This paper focus on deepening these activities. In this paper, by using Pick's Theorem and 和 草's method, all the convex polygons by attaching edgewise seven pieces of tangram, Sei Shonagon(淸少納言)'s tangram, and Pythagoras puzzle are found out respectively. By using Pick's Theorem to the square seven-piece puzzles satisfying conditions of the length of edge, it is showed that the number of convex polygons by attaching edgewise seven pieces of them can not exceed 20. And same result is obtained by generalizing 和 草's method. The number of convex polygons by attaching edgewise seven pieces of tangram, Sei Shonagon's tangram, and Pythagoras puzzle are 13, 16, and 12 respectively.

  • PDF

Construction of Skin Color Map for Resolving Hand Occlusion in AR Environments (증강현실 환경에서 손 가림 해결을 위한 피부 색상 정보 획득)

  • Park, Sang-Jin;Park, Hyungjun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.2
    • /
    • pp.111-118
    • /
    • 2014
  • In tangible augmented reality (AR) environments, the user interacts with virtual objects by manipulating their physical counterparts, but he or she often encounters awkward situations in which his or her hands are occluded by the augmented virtual objects, which causes great difficulty in figuring out hand positions, and reduces both immersion and ease of interaction. To solve the problem of such hand occlusion, skin color information has been usefully exploited. In this paper, we propose an approach to simple and effective construction of a skin color map which is suitable for hand segmentation and tangible AR interaction. The basic idea used herein is to obtain hand images used in a target AR environment by simple image subtraction and to represent their color information by a convex polygonal map in the YCbCr color space. We experimentally found that the convex polygonal map is more accurate in representing skin color than a conventional rectangular map. After implementing a solution for resolving hand occlusion using the proposed skin color map construction, we showed its usefulness by applying it to virtual design evaluation of digital handheld products in a tangible AR environment.

Constant Time RMESH Algorithms for Polygon Intersection Problems (다각형 교차 문제를 위한 상수 시간 재구성메쉬 알고리즘)

  • Kim, Su-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1344-1352
    • /
    • 1999
  • 본 논문에서는 두 단순 다각형의 교차 영역을 구하는 문제를 재구성메쉬(RMESH) 상에서 상수 시간에 해결하는 두 개의 알고리즘을 제시한다. 먼저, 두 다각형이 모두 볼록 다각형일 때, N$\times$N RMESH에서 상수 시간에 교차 영역을 구하는 알고리즘을 제시한다, 여기서 N은 두 다각형의 정점의 개수의 합이다. 그리고, 두 일반적인 단순 다각형의 교차 영역을 구하는 문제에 대해서 (N+T)$\times$(N+T)2 RMESH에서 수행되는 상수 시간 알고리즘을 제시한다, 여기서 T는 최악의 경우 두 다각형의 경계선 상의 교차점의 개수로서 두 다각형의 정점의 개수가 각각 n과 m일 때 n.m에 해당한다. 두 다각형 중 하나가 볼록 다각형인 경우는 T = 2.max{n, m}이다. 이 알고리즘은 두 다각형의 모든 교차 영역 조각들을 구한 후 RMESH의 0번째 열에 차례로 배치해 준다. Abstract In this paper, we consider two constant time algorithms for polygon intersection problems on a reconfigurable mesh(in short, RMESH). First, we present a constant time algorithm for computing the intersection of two convex polygons on an N$\times$N RMESH, where N is the total number of vertices in both polygons. Second, we present a constant time algorithm for computing the intersection of two simple polygons on an (N+T)$\times$(N+T)2 RMESH, where T is the worstcase number of intersection points between the boundaries of them. T = n m, where n and m are the numbers of vertices of two polygons respectively. If either of them is convex, then T = 2 max{n,m}. The algorithm computes the intersection of them, and then arranges each intersection component onto the 0-th column of the mesh.

Home-range Analysis of Varied Tit(Parus varius) in the Post Fledging Period by Using Radio-tracking (원격무선추적을 이용한 곤줄박이(Parus varius)의 이소(離巢) 직후 행동권 분석)

  • Kim, Seoung-Yeal;Kim, Whee-Moon;Song, Won-Kyong;Hyeong, Eun-Jeong
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.21 no.1
    • /
    • pp.95-102
    • /
    • 2018
  • Only the habitat characteristics and breeding status of Paridae have been studied, in addition to the lack of research on Parus varius varius, there is no study on the home-range in the post fledging period. This study was analyzed the home-range size of Parus varius varius in the post fledging period. The survey was conducted in the site located in Dankook Univ. Cheonan Campus(Middle Chungcheong Province). We captured five newborn Parus varius varius using artificial nest was installed before. Radio-tracking was carried out for analysis of home-range, and MCP (Minimum Convex Polygon) was used for analysis. We analyzed 1 individual tracked 15 days (VT5) and 4 individuals which missing radio-tracking transmitter within 3 days (VT1~VT4). Home-range of VT5 gradually increased to 1,38ha, 1.42ha, 2.14ha in the order of early, middle, late period. On the other hand, moving distance was decreased to 174.558m 125.129m, 120.180m. Home-range of V1~VT4 was estimated as 0.81ha which was 75.3% share of home-range of VT5 in early period. As the result it was found that home-range is formed far apart from artificial nest that has been influenced by human being interference, thereafter gradually adapting to interference and spreading close to artificial nest. through this research, we can construct basic ecological data for protecting habitat of Parus varius varius and increasing life rate. As first radio-tracking study of Parus varius varius home-range in the post fledging period, it is expected to be useful for the future study of home-range.