• International Journal of CAD/CAM
• /
• v.2 no.1
• /
• pp.45-54
• /
• 2002

Given a set of three generator circles in a plane, we want to find a circumcircle of these generators. This problem is a part of well-known Apollonius' $10^{th}$ Problem and is frequently encountered in various geometric computations such as the Voronoi diagram for circles. It turns out that this seemingly trivial problem is not at all easy to solve in a general setting. In addition, there can be several degenerate configurations of the generators. For example, there may not exist any circumcircle, or there could be one or two circumcircle(s) depending on the generator configuration. Sometimes, a circumcircle itself may degenerate to a line. We show that the problem can be reduced to a point location problem among the regions bounded by two lines and two transformed circles via $M{\ddot{o}}bius$ transformations in a complex space. The presented algorithm is simple and the required computation is negligible. In addition, several degenerate cases are all incorporated into a unified framework.

• Journal of Integrative Natural Science
• /
• v.5 no.1
• /
• pp.38-41
• /
• 2012

In this paper we show that for any triangle and any point on the circumcircle the envelope of the Wallace-Simson lines with signed angle ${\alpha}$ is a parabola. The proof is obtained naturally using polar coordinates. We also present the reparametrization of the envelope which is a linear normal curve.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.24-30
• /
• 2001

An efficient and robust algorithm to compute the exact Voronoi diagram of a circle set is presented. The circles are located in a two dimensional Euclidean space, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. In particular, this paper discusses the topological aspect of the algorithm, and the following paper discusses the geometrical aspect. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation. Since the algorithm is based on the result of the point set Voronoi diagram and the flipping operation is the only topological operation, the algorithm is always as stable as the Voronoi diagram construction algorithm of a point set.

• Communications of Mathematical Education
• /
• v.25 no.2
• /
• pp.381-402
• /
• 2011

In this paper we study formulae of the triangle's area. We solve problems related with making new formulae of the triangle's area. These formulae is consisted of some elements of triangle, for example side, angle, median, perimeter, radius of circumcircle. We transform formulae $S=\frac{1}{2}acsinB$, $S=\frac{abc}{4R}$, $S=\sqrt{p(p-a)(p-b)(p-c)}$, and make new formulae of the triangle's area. Some formulas are received in the process of Research and Education program in the science high school. We expect that our results will be used in the Research and Education program in the science high school.