• 한국정밀공학회지
• /
• 제15권11호
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• Journal of information and communication convergence engineering
• /
• 제8권1호
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• Proceedings of the National Institute of Ecology of the Republic of Korea
• /
• 제3권4호
• /
• pp.199-203
• /
• 2022

The spring home range and habitat use of the spot-billed duck in Korea were studied using GPS-mobile phone-based telemetry (WT-300). The study areas were Anseong-si, Seosan-si, Nonsan-si, and Sejong-si. Analysis was performed using minimum convex polygon (MCP) and kernel density estimation (KDE) spot-billed ducks had an average home range of 70.28 km² (standard deviation [SD]=84.50, n=6), and a core habitat (50%) 2.66 km² (SD=2.60, n=6), according to MCP and KDE, respectively. Wetlands (41.5%) and rice fields (35.7%) were highly used as habitats. The rice field use rate was high during the day, and the wetland utilization rate was high at night. Rice fields and wetlands were the primary habitats in spring.

• 호남수학학술지
• /
• 제31권3호
• /
• pp.315-321
• /
• 2009

Erd$\"{o}$s posed the problem of determining the minimum number g(n) such that any set of g(n) points in general position in the plane contains an empty convex n-gon. In 1978, Harborth proved that g(5) = 10. We reprove the result in a geometric approach.

• 한국정보통신학회논문지
• /
• 제14권2호
• /
• pp.369-374
• /
• 2010

다각형 내부에 위치한 두 점 사이의 최단 경로는 다각형의 외부를 지나지 않는 경로 중에서 길이가 가장 짧은 경로를 말한다. 일반적인 단순 다각형에서 최단 경로를 구하는 선형 시간 알고리즘은 매우 복잡한 과정으로 알려진 삼각분할을 전처리과정으로 수행해야 한다. 따라서 이론적으로는 최적인 시간복잡도를 갖지만, 실제적으로는 구현이 어려울 뿐만 아니라 입력의 크기가 매우 크지 않은 한 수행 시간이 효율적이지 못하다. 본 논문에서는 다각형 내부의 모든 점들을 볼 수 있는 선분이 존재하는 다각형 부류인 선분가시 다각형의 내부에 위치한 두 점 사이의 최단 경로를 구하는 선형 시간 알고리즘을 제시한다. 이 알고리즘은 삼각 분할을 필요로 하지 않으며, 볼록 외피 구축 등 단순한 절차만으로 구성되어 있어 구현이 용이할 뿐만 아니라 수행 속도도 빠르다

• 한국환경생태학회지
• /
• 제28권6호
• /
• pp.642-649
• /
• 2014

청둥오리는 대표적인 한국내 월동 수조류로 넓은 농경지를 월동지로 이용한다. 한국의 중부지역에 위치한 만경강 하류지역에서 청둥오리 월동 행동권 및 월동지에서 이동거리를 파악하고자 하였다. 2011-2013년 월동기에 Cannon-net을 이용하여 포획된 청둥오리 7개체에 GPS-이동통신 시스템을 기반으로 하는 야생동물위치추적장치(WT-200)를 부착하였다. 청둥오리 행동권 분석은 GIS용 SHP 파일과 ArcGIS 9.0 Animal Movement Extension을 이용하였으며, 커널밀도측정법(Kernel Density Estimation : KDE)과 최소볼록다각형법(Minimum Convex Polygon Method : MCP)을 이용하여 분석하였다. 청둥오리 행동권은 최소볼록다각형법(MCP)에 의해서 $118.8km^2$(SD=70.1, n=7) 이었으며, 커널밀도측정법(KDE)으로는 $60.0km^2$(KDE 90%), $23.0km^2$(KDE 70%) and $11.6km^2$(KDE 50%)이었다. 야생동물위치추적장치(WT-200) 부착지점으로부터 이동거리는 평균 19.4km이었으며, 최대이동거리는 33.2km, 최소이동거리는 9.4km이었다. GPS좌표가 획득된 정점간 거리는 평균 0.8km이었으며, 정점간 이동거리는 최소 6.5km에서 최대 19.7km이었다. 청둥오리는 월동기 동안 매우 짧은 거리를 이동하였으며, 월동지에서 수계 의존성이 매우 높은 경향을 보였다.

• 대한전기학회논문지
• /
• 제43권5호
• /
• pp.848-860
• /
• 1994

Generally, to get the minimum distance between two arbitrary shapes that are composed of circular arcs and lines, we must calculate distances for all the possible pairs of the components from two given shapes. In this paper, we propose an efficient method for the minimum distance problem between two shapes by using their structural features after extracting the reduced component lists which are essential to calculate the minimum distance considering the relationship of shape location. Even though the reduced component lists may contain all the components of the shapes in the worst case, in the average we can reduce the required computation much by using the reduced component lists. This method may be efectively applied to calculating the minimum distance between two shapes which are generated by the CAD tool, like in the nesting system.

• 한국환경복원기술학회지
• /
• 제21권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.

• Journal of Ecology and Environment
• /
• 제29권3호
• /
• pp.259-263
• /
• 2006

본 연구의 목적은 농촌지역의 너구리 행동권과 핵심지역의 면적을 분석하는 것으로서, 이를 위해 22개체를 포획하여 원격 무선추적을 실시하였다. 이 중 3개월 이상 무선 추적이 실시된 9개체의 행동권을 분석한 결과 평균 $0.80km^2$ (100% MCP)를 나타내었다. 성별 행동권은 수컷이 평균 $0.98km^2$ (100% MCP)를 나타내었고, 암컷은 평균 $0.58km^2$ (100% MCP)를 나타내어 수컷의 행동권이 넓었다. 그러나 95% MCP (Minimum Convex Polygon)를 적용했을 경우 수컷이 평균 $0.63km^2$, 암컷이 $0.42km^2$로서 차이가 많이 줄었다. 또한 암수 쌍이 함께 무선 추적된 두 쌍의 행동권은 95% MCP를 적용했을 경우 암수가 각각 $0.26km^2$와 $0.28km^2$로서 차이가 매우 적거나, $0.36km^2$와 $0.36km^2$로 통일했으며, 4 계절 모두 짝을 지어 함께 지냈다. 따라서 짝이 없거나 영역이 정해지지 않은 등의 경우를 제외하고 정상적으로 암수가 한 쌍이 되어 지내는 일상의 경우에는 암수의 행동권이 같다고 판단되어진다. 원격 무선 추적된 너구리 중 4 개체는 암수 쌍을 이루고 있었으며, 이들 두 쌍 모두 일부 일처제를 이루고 함께 이동하며 생활하였다.