• 제목/요약/키워드: Euclidean

검색결과 1,101건 처리시간 0.026초

On the Euclidean Center Problem

  • Chwa, Kyung-Yong
    • 한국경영과학회지
    • /
    • 제7권2호
    • /
    • pp.41-48
    • /
    • 1982
  • This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.

  • PDF

ASYMPTOTIC LENS EQUIVALENCE IN MANIFOLDS WITHOUT CONJUGATE POINTS

  • Han, Dong-Soong
    • 대한수학회보
    • /
    • 제35권4호
    • /
    • pp.741-755
    • /
    • 1998
  • We prove the asymptotic lens equivalence in manifolds without conjugate points. By using this property we show that under a metric condition of asymptotically Euclidean and the curvature condition decaying faster than quadratic, any surface $(R^2,g)$ without conjugate points is Euclidean.

  • PDF

Topology Representation for the Voronoi Diagram of 3D Spheres

  • Cho, Young-Song;Kim, Dong-Uk;Kim, Deok-Soo
    • International Journal of CAD/CAM
    • /
    • 제5권1호
    • /
    • pp.59-68
    • /
    • 2005
  • Euclidean Voronoi diagram of spheres in 3-dimensional space has not been explored as much as it deserves even though it has significant potential impacts on diverse applications in both science and engineering. In addition, studies on the data structure for its topology have not been reported yet. Presented in this, paper is the topological representation for Euclidean Voronoi diagram of spheres which is a typical non-manifold model. The proposed representation is a variation of radial edge data structure capable of dealing with the topological characteristics of Euclidean Voronoi diagram of spheres distinguished from those of a general non-manifold model and Euclidean Voronoi diagram of points. Various topological queries for the spatial reasoning on the representation are also presented as a sequence of adjacency relationships among topological entities. The time and storage complexities of the proposed representation are analyzed.

CURVATURE BOUNDS OF EUCLIDEAN CONES OF SPHERES

  • Chai, Y.D.;Kim, Yong-Il;Lee, Doo-Hann
    • 대한수학회보
    • /
    • 제40권2호
    • /
    • pp.319-326
    • /
    • 2003
  • In this paper, we obtain the optimal condition of the curvature bounds guaranteeing that Euclidean cones over Aleksandrov spaces of curvature bounded above preserve the curvature bounds, by considering the Euclidean cone CS$_{r}$ $^{n}$ over n-dimensional sphere S$_{r}$ $^{n}$ of radius r. More precisely, we show that for r<1, the Euclidean cone CS$_{r}$ $^{n}$ of S$_{r}$ $^{n}$ is a CBB(0) space, but not a CBA($textsc{k}$)-space for any real $textsc{k}$$\in$R.

피타고라스 정리의 유클리드 증명에 관한 일반화 (A study on the generalization for Euclidean proof of the Pythagorean theorem)

  • 정영우;김부윤;김동영;류동민;박주형;장민제
    • East Asian mathematical journal
    • /
    • 제31권4호
    • /
    • pp.459-481
    • /
    • 2015
  • In this study, we investigated whether the theorem is established even if we replace a 'square' element in the Euclidean proof of the Pythagorean theorem with different figures. At this time, we used different figures as equilateral, isosceles triangle, (mutant) a right triangle, a rectangle, a parallelogram, and any similar figures. Pythagorean theorem implies a relationship between the three sides of a right triangle. However, the procedure of Euclidean proof is discussed in relation between the areas of the square, which each edge is the length of each side of a right triangle. In this study, according to the attached figures, we found that the Pythagorean theorem appears in the following three cases, that is, the relationship between the sides, the relationship between the areas, and one case that do not appear in the previous two cases directly. In addition, we recognized the efficiency of Euclidean proof attached the square. This proving activity requires a mathematical process, and a generalization of this process is a good material that can experience the diversity and rigor at the same time.

실제 도로거리를 이용한 농촌지역 생활권의 의료시설 접근성 평가 -평창군을 중심으로- (Assessment of Accessibility to Medical Facilities in Rural Areas using Real Road Distance focusing on Pyeongchang-gun)

  • 김솔희;김태곤;서교
    • 한국농공학회논문집
    • /
    • 제57권4호
    • /
    • pp.39-49
    • /
    • 2015
  • Since most medical facilities and medical personnel are concentrated in urban areas in South Korea, an imbalance of access to medical facilities causes a gap in medical resource availability between urban and rural areas. Accessibility to medical facilities is a means of assessment that evaluates a measure of inequality in utilization of medical resources. The evaluation of accessibility uses Euclidean distance, in general; however, this method has its limits in that Euclidean distance cannot reflect actual distance. This study aims to estimate real road distance from village halls to medical facilities in rural areas using Open Application Programming Interface (Open API) of an internet portal site. Using real road distance, we evaluated medical accessibility and compared it with Euclidean distance. The accessibility to primary medical institutions was valued relatively well, but secondary and tertiary medical institutions were vulnerable in Pyeonchang-gun. Comparing Euclidean distance with real road distance from village halls to medical facilities, real road distance appeared to be approximately 1.4 times that of Euclidean distance. This calculation is similar to the circuity factor of Gangwon-do in Korea that estimated to fix the limits of Euclidean distance and assumed real road distance.

보로노이 다이어그램에 기반한 개선된 유클리디언 거리 변환 방법 (Improved Euclidean transform method using Voronoi diagram)

  • 장석환;박용섭;김회율
    • 한국통신학회논문지
    • /
    • 제29권12C호
    • /
    • pp.1686-1691
    • /
    • 2004
  • 본 논문에서는 기존의 고속 유클리디언 거리 변환법을 개선한 새로운 계산 방법을 제안한다. 기존의 고속 유클리디언 거리 변환법이 가지고 있는 단점인 특징점의 수에 비례하여 계산량이 늘어나는 단점을 극복하기 위해서, 본 논문에서는 특징점들 중에서 비특징점과 4방향으로 연결되어 있는 특징점만을 이용하여 보로노이 다이어그램을 계산함으로써 유클리디언 거리 변화도(Euclidean distance map)의 계산 시간을 기존의 방법보다 평균 40%로 감소시켰다. 본 논문에서 제안한 방법의 효율성을 검증하기 위해서 크기의 바이너리 영상 16장에서 대해서 기존의 방법과 제안한 방법으로 똑같이 유클리디언 거리 변화도를 계산하여 계산 시간을 비교함으로써 그 효능을 입증하였다.

시민과학을 활용한 수원시에 출몰하는 떼까마귀(Corvus frugilegus)의 일출 및 일몰시 선호 서식지 분석 (Spatial Usage and Patterns of Corvus frugilegus after Sunrise and Sunset in Suwon Using Citizen Science)

  • 윤지원;신원협;김지환;이석영;김도희;김유빈;류영렬;송영근
    • 한국환경복원기술학회지
    • /
    • 제24권6호
    • /
    • pp.35-48
    • /
    • 2021
  • In Suwon, the overall hygiene of the city is threatened by the emergence of the rook(Corvus fugilegus) in the city. Rooks began to appear in November of 2016 and has continued to appear from November to March every year. In order to eradicate or to prepare an alternative habitat for rooks, this study aimed to identify the preferred habitat and specific environmental variables. Therefore, in this work, we aim to understand the predicted distribution of rooks in Suwon City with citizen science and through MaxENT, the most widely utilized habitat modeling using citizen science to analyze the preferred habitat of harmful tides appearing in urban areas. In this study, seven environmental variables were chosen: biotope group complex, building floor, vegetation, euclidean distance from farmland, euclidean distance from streetlamp, and euclidean distance from pole and DEM. Among the estimated models, after the time period of sunrise (08:00~18:00) the contribution percentage were as following: euclidean distance from arable land(39.2%), DEM(25.5%), euclidean distance from streetlamp(22.3%), euclidean distance from pole(7.1%), biotope group complex(4.9%), building floor(1%), vegetation(0%). In the time period after sunset(18:00~08:00) the contribution percentage were as following: biotope group complex(437.4%), euclidean distance from pole(26.8%), DEM(13.4%), euclidean distance from streetlamp(11.8%), euclidean distance from farmland(7.9%), building floor(1.4%), vegetation(1.3%).

확장 유클리드 알고리즘에 대한 컴퓨터 집약적 방법에 대한 연구 (Computer intensive method for extended Euclidean algorithm)

  • 김대학;오광식
    • Journal of the Korean Data and Information Science Society
    • /
    • 제25권6호
    • /
    • pp.1467-1474
    • /
    • 2014
  • 본 논문에서는 정수론 분야에서 가장 기초적인 방법으로 소개되는 유클리드 알고리즘과 이를 확장한 확장 유클리드 알고리즘을 소개하고 이들에 대한 컴퓨터 집약적 방법을 연구하였다. 이들 알고리즘들은 공개키 암호 분야에서 암호화의 과정에서 반드시 거쳐야 하는 과정들 중의 하나로서 그 응용성이 날로 부각되고 있다. 확장 유클리드 알고리즘에 대한 컴퓨터 집약적 방법으로서 마이크로소프트 엑셀과 C 언어를 이용하는 두 가지 방법을 각각 고안하여 제안하였다. 본 논문은 단순히 정수론 차원의 계산을 쉽고 편리하게 하기 위함만이 목적이 아니고 아주 큰 수에 대한 역원 (곱셈에 대한 역원)의 계산과 이의 공개키 암호화 활용에서 의의를 찾을 수 있다.