• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.2
• /
• pp.103-111
• /
• 2005

In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called thc Petrov-Galerkin natural clement method(PG-NEM) by authors is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used lot conventional natural clement method called the Bubnov-Galerkin natural element method(BG-NEM). But, unlike the BG-NEM, the test basis function is differently chosen, based on the concept of Petrov-Galerkin, such that its support coincides exactly with a regular integration region in background mesh. Therefore, it is expected that the proposed technique ensures the remarkably improved numerical integration accuracy in comparison with the BG-NEM.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.167-171
• /
• 2007

본 논문에서는 타일의 크기를 적응적으로 결정하는 모자이크 방법을 제안한다. 우리는 이미지에서 에지(Edge)를 추출한 뒤, 결과 영상이 이 에지 정보를 보존하고, 각 타일들이 이 에지를 따르도록 한다. 에지 정보를 보존 하기 위하여 무게중심 보로노이 다이어그램(CVD: Centroidal Voronoi Diagram)을 계산할때 에지 회피기법을 적용하며, 에지를 따르는 타일을 생성하기 위하여 에지를 따르는 방향과 맨해튼 거리(manhattan distance)가 적용된 무게중심 보로노이 다이어그램을 사용한다. 이때, 우리는 그래픽 처리 장치(GPU: Graphics Processing Unit)를 이용하여 방향맵이나 보로노이 다이어그램을 더욱 빠르게 구할 수 있다. 우리는 타일의 크기를 각 보로노이 영역의 넓이에 비례하게 정함으로써, 기존의 모자이크 방법들이 해결하고자 했던 타일의 겹침 문제와 타일간의 빈 공간 문제를 개선하였다.

• Communications of Mathematical Education
• /
• v.35 no.1
• /
• pp.119-136
• /
• 2021

We performed the research and education programs using engineering tools such as Mathematica, Microsoft Excel and GeoGebra for the students in mathematics mentorship program of the institute of science education for the gifted. We used the engineering tools to solve the problems and found the rules by observing the solutions. Then we generalized the rules to theorems by proving the rules. Mathematica, the professional mathematical computation program, was used to calculate and find the length of the repeating portion of the repeating decimal. Microsoft Excel, the spreadsheet software, was used to investigate the Beatty sequences. Also GeoGebra, the dynamic geometric software, was used to investigate the Voronoi diagram and develop the Voronoi game. Using GeoGebra, we designed the Voronoi game plate for the game. In this program, using engineering tools improved the mathematical creativity and the logical thinking of the gifted students in mathematics mentorship program.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.674-677
• /
• 2004

This paper deals with a systematic approach for the construction of the fixed-delay tree search (FDTS) detector in the intersymbol interference channel. The approach is based on the efficient multi-dimensional space partitioning. The Voronoi diagram (VoD) and the Delaunay tessellation (DT) of the multi-dimensional space are applied to implement the algorithm. In the proposed approach, utilizing the geometric information contained in the VOD/DT, the relative location of the observation sequence is determined which has been shown to reduce the implementation complexity. Detailed construction procedures are discussed followed by an example from the intersymbol interference communication channel.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1274-1279
• /
• 2003

In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called the Petrov-Galerkin natural element(PG-NE) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element(BG-NE). But, unlike BG-NE method, the test shape function is differently chosen from the trial shape function. The proposed technique ensures that the numerical integration error is remarkably reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.505-510
• /
• 2006

This paper presents an improved algorithm for constructing the city Voronoi diagram under the Euclidean metric given a transportation network consisting of roads having a constant number of speeds and orientations. The algorithm applies the continuous Dijkstra paradigm and its efficiency follows from new geometric insights that are first observed in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.411-413
• /
• 2012

생강, 양파와 같은 농산물은 재배지에서 우리 식탁에 놓일 때까지 신선도 유지를 위하여 저장고에 넣어 관리한다. 하지만, 현재 설치되어 사용 중에 있는 저장고는 내부에 온/습도를 측정할 수 있는 센서를 부착하고 측정함에도 불구하고, 농산물이 얼거나 부패되는 문제점이 발생하고 있다. 이것은 저장고 내부 센서의 부착이 그만큼 효율적이지 못하다는 것을 반증하고 있는 것이다. 이 문제점을 극복하기 위하여, 본 논문에서는 보로노이 다이어그램을 이용한 센서 배치 기법을 제안한다. 이 기법은 저장고 내부의 공간을 평면 분할하고, 분할된 공간에 센서 배치를 함으로서, 저장고 내부의 온도를 정확히 얻을 수 있을 뿐만 아니라, 배치된 센서 개수의 최소화를 이룰 수 있도록 한다.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.23 no.7
• /
• pp.775-782
• /
• 2017

The position of existing patrol ships has been decided according to subjective judgments, not purely by any reasonable or scientific criteria, because of a lack of access to marine accident positions. In this study, the optimal location of patrol ships is quantitatively determined based on historical marine accident data. The study area used included the coastal sea of Pohang in South Korea. In this study, a k-means clustering algorithm was used to derive the location of patrol ships, and then a Voronoi diagram was used to divide the region around each patrol ship. As a result, the average navigation distance for patrol ships was improved by 4.4 nautical miles, and the average arrival time was improved by 13.2 minutes per marine accident. Moreover, if the locations of patrol ships need to be changed flexibly, it will be possible to optimally arrange limited resources using the technique developed in this study to ensure a fast rescue.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.800-806
• /
• 2006

최근, 컴퓨터 사이언스 분야에서 모자이크에 대한 다양한 연구들이 이뤄지고 있지만, 세부 묘사를 유지하려는 관점에서의 접근은 부족한 편이다. 본 논문은 원 영상의 세부 묘사를 유지하는 타일 모자이크 방법을 제안한다. 이 방법은 타일간의 빈 공간을 제거하기 위한 겹쳐진 타일의 사용을 통해 구현된다. 본 논문에서 제시한 방법은 다음 세 단계로 구성된다. 첫째, 에지 회피 기법이 적용된 무게중심 보로노이 다이어그램(CVD:Centroidal Voronoi Diagram)을 통해 메인 타일의 위치를 얻는다. 둘째, 메인 타일들의 위치에 딜로니 삼각형화(Delaunay Triangulation)를 적용해 서브 타일의 위치를 계산한다. 셋째, 타일간의 관계를 고려해 타일의 크기와 방향성을 구한다. 위의 과정을 통해 타일 간의 빈 공간이 최소화되어 세부 묘사가 강화된 모자이크 영상을 얻는다.