• 한국학교수학회논문집
• /
• 제17권4호
• /
• pp.613-627
• /
• 2014

2009 초등학교 교육과정에 따라 2014년에 처음으로 출간된 교과서 ${\ll}$수학 4-2${\gg}$에서는 이전 교육과정에 따른 교과서에서는 취급하지 않았던 오목다각형을 새롭게 취급하고 있다. 그러나 본 논문에서는 오목다각형의 취급을 재고할 필요가 있음을 보이기 위해, 먼저 다각형에 관해 논의한 후에, 2009 초등학교 교육과정은 오목다각형의 취급을 허용하고 있는가와 오목다각형의 취급에서 논리적 비약은 없는가의 두 관점에서 오목다각형 취급과 관련한 문제점에 관하여 논의했다. 그리고 다음과 같은 이유에서 오목다각형을 취급하는 것을 재고할 필요가 있다는 것을 결론으로 제시했다. 첫째, 오목다각형의 취급에 관한 공론화 과정이 없었다. 둘째, 2009 초등학교 교육과정에서 오목다각형의 취급을 정당화해 주는 근거를 찾을 수 없다. 셋째, 오목다각형의 취급에 논리적 비약이 있다. 넷째, 오목다각형의 취급에서 일관성이 없다.

• East Asian mathematical journal
• /
• 제31권4호
• /
• pp.483-503
• /
• 2015

While some studies have examined the concave and convex regular polygons respectively, very little work has been done to integrate and restructure polygon shapes. Therefore, this study aims to systematically reclassify the regular polygons on the through a comprehensive analysis of previous studies on the convex and concave regular polygons. For this study, the polygon's consistency with respect to the number of sides and angles was examined. Second, the consistency on the number of diagonals was also examined. Third, the size of the interior and exterior angels of regular polygons was investigated in order to discover the consistent properties. Fourth, the consistency concerning the area in regular polygons was inspected. Last, the consistency of the central figure number in the "k-th" regular polygons was examined. Given these examinations, this study suggests a way to create a concave regular polygon from a convex regular polygon.

• International Journal of Automotive Technology
• /
• 제8권2호
• /
• pp.193-201
• /
• 2007

The present paper deals with the application of the explicit finite element code, PAM-CRASH, to simulate the crash behavior of steel thin-walled tubes with various cross-sections subjected to axial loading. An isotropic elastic, linear strain-hardening material model was used in the finite element analysis and the strain-rate sensitivity of mild steel was modeled by using the Cowper-Symonds constitutive equation with modified coefficients. The modified coefficients were applied in numerical collapse simulations of 11 types of thin-walled polygon tubes: 7 convex polygon tubes and 4 concave polygon tubes. The results show that the thin hexagonal tube and the thick octagonal tube showed relatively good performance within the convex polygon tubes. The crush strengths of the hexagonal and octagonal tubes increased by about 20% and 25% from the crush strength of the square tube, respectively. Among the concave tubes, the I-type tube showed the best performance. Its crush strength was about 50% higher than the crush strength of the square tube.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권1호
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

• 한국정밀공학회지
• /
• 제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.

• 한국학교수학회논문집
• /
• 제15권1호
• /
• pp.183-197
• /
• 2012

평면기하는 가장 오래 된 학교수학 학습내용 중 하나이며, 중등학교에서 학생들의 사고력 및 창의력 신장에 중요한 역할을 한다. 평면기하 학습내용 중 정다각형은 초등학교, 중학교에서 볼록 정다각형을 중심으로 다루어지고 있는데, 본 연구에서는 학교에서 다루어지는 정다각형에 대한 학습내용을 기초지식으로 설정하고, 이를 기초로 정다각형 외연의 확장 과정을 체계적으로 탐색하였다. 특히 기하프로그램을 활용한 귀납적 탐구과정이 기하학습 내용 확장에 유의미한 방향을 제시해 줄 수 있다는 구체적 사례를 제시하였다. 본 연구결과를 통해, 정다각형에 대한 심화학습 자료 개발 및 기하 연구를 위한 바람직한 탐구 방향 제시가 기대되어진다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.527-530
• /
• 1997

An automated process planning system for cold forging of non-axisymmetric parts of comparatively simple shape was developed in this study. Programs for the system have been written with Visual LISP in the AutoCAD using a personal computer and are composed of four main modules such as input module, shape cognition and shape expression module, material diameter determination module and process planning module. The design rules and knowledges for th system are extracted from the plasticity theories. handbook, relevant reference and empirical knowledge of field experts. Generally, in forging, only front view is needed for expression of axisymmetric parts, but non-axisymmetric parts are needed both front view and plane. At the plane, this system cognizes the external shape of non-axisymmetric parts - number of sides of regular polygon and radius of a circle circumscribing the polygon of n sides. At the front view, the system perceives diameter of axisymmetric portions and hight of primitive geometries such as polygon, cylinder, cone, concave, convex, etc.

• 한국정밀공학회지
• /
• 제19권2호
• /
• pp.195-202
• /
• 2002

An automated process planning system for cold forging of non-axisymmetric parts of comparatively simple shape was developed in this study. Programs for the system have been written with Visual LISP in the AutoCAD using a personal computer and are composed of four main modules such as input module, shape cognition and shape expression module, material diameter determination module and process planning module. The design rules and knowledges for the system are extracted from the plasticity theories, handbook, relevant reference and empirical knowledge of field experts. Generally, in forging, only front view is needed for expression of axisymmetric parts, but non-axisymmetric parts need front and plane view. At the plane, this system cognizes the external shape of non-axisymmetric, parts - number of sides of regular polygon and radius of a circle circumscribing the polygon of n sides. At the front view, the system perceives diameter of axisymmetric portions and height of primitive geometries such as polygon, cylinder, cone, concave, convex, etc.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• 대한수학회논문집
• /
• 제31권3호
• /
• pp.637-645
• /
• 2016

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, respectively. When P is a triangle, the centroid $G_0$ always coincides with the centroid $G_2$. For the centroid $G_1$ of a triangle, it was proved that the centroid $G_1$ of a triangle coincides with the centroid $G_2$ of the triangle if and only if the triangle is equilateral. In this paper, we study the relationships between the centroids $G_0$, $G_1$ and $G_2$ of a quadrangle P. As a result, we show that parallelograms are the only quadrangles which satisfy either $G_0=G_1$ or $G_0=G_2$. Furthermore, we establish a characterization theorem for convex quadrangles satisfying $G_1=G_2$, and give some examples (convex or concave) which are not parallelograms but satisfy $G_1=G_2$.