• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• Journal of information and communication convergence engineering
• /
• v.19 no.2
• /
• pp.114-119
• /
• 2021

This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R². Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.

• Journal of KIBIM
• /
• v.11 no.4
• /
• pp.42-52
• /
• 2021

Paneling building facades is one of the essential procedures in building construction. Traditionally, it has been an easy task of simply projecting paneling patterns drawn in drawing boards onto 3d building facades. However, as many organic or curved building shapes are designed and constructed in modern architectural practices, the traditional one-to-one projection is becoming obsolete for the building types of the kind. That is primarily because of the geometrical discrepancies between 2d drawing boards and 3d curved building surfaces. In addition, curved compound surfaces are often utilized to accommodate the complicated spatial programs, building codes, and zoning regulations or to achieve harmonious geometrical relationships with neighboring buildings in highly developed urban contexts. The use of the compound surface apparently makes the traditional paneling pattern projection more challenging. Various mapping technics have been introduced to deal with the inabilities of the projection methods for curved facades. The mapping methods translate geometries on a 2d surface into a 3d building façade at the same topological locations rather than relying on Euclidean or Affine projection. However, due to the intrinsic differences of the planar 2d and curved 3d surfaces, the mapping often comes with noticeable distortions of the paneling patterns. Thus, this paper proposes a practical method of drawing paneling patterns directly on a curved compound surface utilizing Geodesic, which is faithful to any curved surface, to minimize unnecessary distortions.

• Korean Journal of Construction Engineering and Management
• /
• v.21 no.1
• /
• pp.21-31
• /
• 2020

Recently, interest and financial investment in community infrastructure have been growing. Accordingly, Korean Ministry of Land, Infrastructure and Transport suggested a standard for community infrastructure planning. The standard was based on time distance which represents citizens' accessibility to infrastructure facilities. This paper presents a method to use the navigation application programming interface (API) to calculate travel time. Buffer analysis using Euclidean distance has been widely used so far to evaluate accessibility. However, this method has limitation in that it does not reflect situations in the real world such as crosswalks and slope ways. The infrastructure accessibility indices of local towns in Yeonsu-gu, Incheon were computed based on the time obtained by navigation API. Also, Yeonsu-gu was spatially analyzed to reveal the resident units that are marginalized from community infrastructure facilities. Using navigation API enables to compute realistic accessibility indices and to find unbenefitted residential areas. The method presented in this paper can help community infrastructure planners for their facility spatial plan and budget distribution.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.10 no.3
• /
• pp.37-48
• /
• 1986

The purpose of this study was to analyze 'the natural groupings' of subjects in order to classify highly similar somatotype for clothing construction. The sample for the study was drawn randomly out of senior high school boys in Seoul urban area. The sample size was 425 boys between age 16 and 18. Cluster analysis was more concerned with finding the hierarchical structure of subjects by three dimensional distance of stature. bust girth and sleeve length. The groups forming a partition can be subdivided into 5 and 6 sets by the hierarchical tree of the given subjects. Ward's Minimum Variance Method was applied after extraction of distance matrix by the Standardized Euclidean Distance. All of the above data was analyzed by the computer installed at Korea Advanced Institute of Science and Technology. The major findings, take for instance, of 16 age group can be summarized as follows. The results of cluster analysis of this study: 1. Cluster 1 (32 persons means $18.29\%$ of the total) is characterized with smaller bust girth than that of cluster 5, but stature and sleeve length of the cluster 1 are the largest group. 2. Cluster 2 (18 Persons means $10.29\%$ of the total) is characterized with the group of the smallest stature and sleeve length, but bust girth larger than that of cluster 3. 3. Cluster 3(35persons means $20\%$ of the total) is classified with the smallest group of all the stature, bust girth and sleeve length. 4. Cluster 4(60 persons means $34.29\%$ of the total) is grouped with the same value of sleeve length with the mean value of 16 age group, but the stature and bust girth is smaller than the mean value of this age group. 5. Cluster 5(30 persons means $17.14\%$ of the total) is characterized with smaller stature than that of cluster 1, and with larger bust girth than that of cluster 1, but with the same value of the sleeve length with the mean value of the 16 age group.

• Journal of Educational Research in Mathematics
• /
• v.16 no.1
• /
• pp.1-23
• /
• 2006

It is regarded as critical to analyse and re-appreciate Euclidean geometry for the sake of improving school geometry This study, a critical analysis of demonstrative plane geometry in current secondary school mathematics with an eye to the viewpoints of 'Elements of Geometry', is conducted with this purpose in mind. Firstly, the 'Elements' is analysed in terms of its educational purpose, concrete contents and approaching method, with a review of the history of its teaching. Secondly, the 'Elemens de Geometrie' by Clairaut and the 'histo-genetic approach' in teaching geometry, mainly the one proposed by Branford, are analysed. Thirdly, the basic assumption, contents and structure of the current textbooks taught in secondary schools are analysed according to the hypothetical construction, ordering and grouping of theorems, presentations of proofs, statements of definitions and exercises. The change of the development of contents over time is also reviewed, with a focus on the proportional relations of geometric figures. Lastly, tile complementary way of integrating the two 'Elements' is explored.

• Journal of the Korean School Mathematics Society
• /
• v.10 no.3
• /
• pp.341-351
• /
• 2007

The primary purpose of this treatise is to suggest the solutions as follows for the errors concerning the triangle determination and congruence in every Korean mathematics textbook for 7th graders: showing that SsA, along with SSS, SAS, ASA, should also be included as the condition for triangle determination, congruence and similarity; proving that contrary to what has been believed, minimality applies only to congruence and similarity but not to determination; examining related Euclidean propositions; discussing the confusion about the characteristics of determination and congruence; and considering the negative effects of giving definite figures in construction education. The secondary purpose is to analyze the significance of triangle determinant that is not dealt with in either Euclid's Elements or the text books in the U.S. or Japan, and suggest a way to effectively deal with triangle determination and congruence in education.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.71-80
• /
• 2014

Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.103-112
• /
• 2010

Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O($N^2$) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees' average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.