• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.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
• /
• v.8 no.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.10a
• /
• 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
• /
• v.3 no.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.

• Honam Mathematical Journal
• /
• v.31 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 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 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. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.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.

• 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.

• 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.