본문 바로가기
KERD
논문KCI 등재

A Novel Two-Dimensional Distance Metric to Generalize Manhattan Distance

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

초록

Distance is a fundamental definition in fields such as geometry, mathematics, and physics. Because it is a very fundamental metric, it is not easy to create a new definition. In this study, we analyze existing distance definition and propose to generalize Euclidean distance and Manhattan distance, which are mainly used distance metric in existing distance definition. We analyze the definition of Minkowski distance, which is previously used as a concept of generalization along with Chebyshev distance, and the disadvantages of using this distance metric. By introducing a new perspective that interprets the existing Manhattan distance as a distance measured in four axes rather than simply adding the distances in each axis direction, this research introduces a new distance metric in two dimensions. This is a metric that generalizes the Euclidean distance and the Manhattan distance, and the proposed distance metric is derived from a geometrical aspect and an algorithm for calculating it is presented. We applied the existing distance definition and compared the differences through the results of generating a Voronoi area by the shortest distance from randomly distributed points in two dimensions. It is expected that the proposed method can be applied and expanded to the field of various graphics algorithms that use the distance metric.

Abstract

Distance is a fundamental definition in fields such as geometry, mathematics, and physics. Because it is a very fundamental metric, it is not easy to create a new definition. In this study, we analyze existing distance definition and propose to generalize Euclidean distance and Manhattan distance, which are mainly used distance metric in existing distance definition. We analyze the definition of Minkowski distance, which is previously used as a concept of generalization along with Chebyshev distance, and the disadvantages of using this distance metric. By introducing a new perspective that interprets the existing Manhattan distance as a distance measured in four axes rather than simply adding the distances in each axis direction, this research introduces a new distance metric in two dimensions. This is a metric that generalizes the Euclidean distance and the Manhattan distance, and the proposed distance metric is derived from a geometrical aspect and an algorithm for calculating it is presented. We applied the existing distance definition and compared the differences through the results of generating a Voronoi area by the shortest distance from randomly distributed points in two dimensions. It is expected that the proposed method can be applied and expanded to the field of various graphics algorithms that use the distance metric.

참고문헌 (7)

  1. A. Hausner, "Simulating decorative mosaics", SIGGRAPH Conference Proceedings, pp.573~578 (2001)
  2. S. Hiller, "Beyond stippling – methods for distributing objects on the plane", Computer Graphics Forum, 22(3), pp.515~522 (2003)
  3. Paul Haeberli, "Paint by numbers : abstract image representations", ACM SIGGRAPH Computer Graphics, 24(401), pp.207~214 (1990)
  4. 조청운, "구면 타일링을 통한 지뢰 찾기변형 게임의 설계와 구현", 한국컴퓨터게임학회논문지, (23), pp.247~252 (2010), (사)한국컴퓨터게임학회
  5. Eugene F. Krause, "Taxicab Geometry: An Adventure in Non-Euclidean Geometry", pp.147~153 (2013), Dover Publication, Inc
  6. Gardner, M, "The Last Recreations: Hydras, Eggs, and Other Mathematical Mystifications", Springer
  7. Osama T. Perball, "On Taxicab Geometry", ~ (2017)

관련 논문AI추천

이 간행물의 다른 논문 (12건)