• Journal of the Korean School Mathematics Society
• /
• v.20 no.4
• /
• pp.445-464
• /
• 2017

This study targeting 10 high school 3rd grade students who have studied space figures in natural sciences track analyzes the process of analogical discovery from the construction of inscribed and circumscribed circles of a triangle to that of inscribed and circumscribed spheres of a tetrahedron through the analytical method using Geogebra. The subjects are divided into two groups of five, the experimental group consisting of those who have experienced analytical method and the comparative group consisting of those who haven't. This research analyzing the process of constructing inscribed and circumscribed spheres of a tetrahedron. Although students of both groups all have an accurate preliminary knowledge of inscribed and circumscribed circles of a triangle, they have difficulty in constructing inscribed and circumscribed spheres of a tetrahedron. However, the students of experimental group who have studied the constructing process of inscribed and circumscribed circles of a triangle in reverse using analytical method and Geogebra can perform analogical discovery finding out the way to construct inscribed and circumscribed spheres of a tetrahedron using analogy by themselves. They can control and explore space figures by visualization. Also, they can immediately examine and provide feedback on the analogizing process of their own. In addition, the process affects the attitude of students toward mathematics positively as well as gives validity to the result of analogy.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.