• 한국CDE학회논문집
• /
• 제10권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 추계학술대회 논문집
• /
• pp.244-248
• /
• 2001

A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While many B-rep modelers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.277-277
• /
• 2000

This paper's purpose obtain information of three dimension using a camera. This system embody to know the height of object using triangle method between reference point of circumstance and object. As I use java program, it is possible to make system regardless of operating system, set up the system. By using comportable USB port camera, we used to everywhere without the capture board. We can use the internet by using the java's JMF and applet everywhere, we regard the camera as fixed.

• 동력기계공학회지
• /
• 제13권2호
• /
• pp.30-35
• /
• 2009

Numerical Calculations for dimensionless pressure drop (friction factor times Reynolds number) have been obtained for fully developed laminar flow of MPL(Modified Power Law) fluid in isosceles triangle pipes. The solutions are valid for Pseudoplastic fluids over a wide range from Newtonian behavior at low shear rates through transition region to power law behavior at higher shear rates. The analysis identified a dimensionless shear rate parameter which for a given set of operating conditions specifies where in the shear rate range a particular system is operating, i.e., Newtonian, transition or power law region. The numerical calculation data of the dimensionless pressure drop for the Newtonian and power law regions are compared with previously published asymptotic results presenting within 0.16 % in Newtonian region and 2.98 % in power law region.

• East Asian mathematical journal
• /
• 제34권4호
• /
• pp.371-402
• /
• 2018

The researchers set up a research question to find out how to teach the concept of a right triangle through classification activities after listening to the conversations of fellow teachers about the recently revised textbooks. First, a questionnaire was created to confirm the objectivity of the research problem, data were collected through online and offline, and interviews were conducted with some of the respondents. As a result, it confirmed that there was a considerable difference in the perception of the research study about the direction of revising the curriculum called 'student participation centered' and 'the possibility of achieving the learning objective'. Then, we analyzed the critical interpretations used in the third grade math textbook Lesson 2. 'Plane Figure' part 4 and 5. Finally, by analyzing the results of the recognition analysis and textbook analysis, we proposed two learning methods which can link the triangle classification activity and the right triangle concept. Based on the results of the research, we obtained suggestions that a teaching should be made regarding that the classification process may be changed according to the student's prior knowledge and the process of classification activities may be different according to the viewpoint and classification criteria.

• 한국의류산업학회지
• /
• 제19권5호
• /
• pp.635-645
• /
• 2017

The industry of character toys is increasing and new characters are constantly being developed. However, the development of 2D cover patterns for toys is time-consuming due to frequent pattern modifications made through trial and error. Studies are now underway to obtain 2D clothing patterns from 3D body data, however, little research has been done on 2D pattern of character toys. This study suggests efficient guidelines to develop 2D cover patterns with a reasonable accuracy and processing time. Two 3D models of a dog and rabbit were used to develop 2D cover patterns. Independent variables of this study are set as 3 levels of triangle area (small, medium, and large) that influence the efficacy of 3D and 2D pattern development. The determination of the appropriate triangular area was based on the area and shape change of the 2D pattern. A medium or large triangle area was shown to be suitable for a character dog with a smooth curved surface. However, the appropriate triangle area was small if the characteristics of the curved surface are complicated as in the case of rabbit. The head of a dog (a double-curved surface) and the curved forepaw of a rabbit (a triangular area) should be small when the characteristics of the curved surface (such as the hind leg of a rabbit having a large convex surface and a small surface area) are complicated. Grouping by 3D surface characteristics could be a suitable guideline for the triangle area selection.

• 대한수학회논문집
• /
• 제27권4호
• /
• pp.733-743
• /
• 2012

In the present paper, we prove common fixed point theorems for single-valued and set-valued occasionally weakly compatible mappings in Menger spaces. Our results improve and extend the results of Chen and Chang [Chi-Ming Chen and Tong-Huei Chang, Common fixed point theorems in Menger spaces, Int. J. Math. Math. Sci. 2006 (2006), Article ID 75931, Pages 1-15].

• East Asian mathematical journal
• /
• 제24권5호
• /
• pp.509-519
• /
• 2008

In the article, we study on researching activity of the patterns through paper folding. A set of rules and patterns are found in this study based on folding paper of triangle and rectangle.

• Korean Journal of Mathematics
• /
• 제30권2호
• /
• pp.315-333
• /
• 2022

We give a general procedure to analyze the structure for certain ℂ-Fuchsian subgroups of some non-arithmetic lattices. We also show their presentations and describe their fundamental domains which lie in a complex geodesic, a set homeomorphic to the unit disk.

• 한국정밀공학회지
• /
• 제21권4호
• /
• pp.140-147
• /
• 2004

In reverse engineering, the whole surfaces of the three-dimensional product are measured using 3D positional scanners. The raw triangle meshes constructed from a scanned point set are not well fitted for direct use in the downstream engineering or graphic activities. No object can be fully described by a single scan. Although multiple scans are usually taken and aligned to achieve a complete model, a set of scanned points does not entirely wrap the whole object. This is because some surfaces may be inaccessible to the scanner, so some portion of the scanned surface may be missing. This paper discusses the algorithms of a hole-filling that are crucial to refine the triangle meshes. In this paper, the holes are filled with flat triangles first by subdivision operation and then smoothed with neighboring triangles. This process continues until it converges to a certain user-defined iteration number. Examples are given and discussed to validate the system.