Computing the L1 geodesic diameter and center of a simple polygon in linear time

被引:7
|
作者
Bae, Sang Won [1 ]
Korman, Matias [2 ,3 ]
Okamoto, Yoshio [4 ]
Wang, Haitao [5 ]
机构
[1] Kyonggi Univ, Suwon, South Korea
[2] Natl Inst Informat, Tokyo, Japan
[3] JST, Kawarabayashi Large Graph Project, ERATO, Tokyo, Japan
[4] Univ Electrocommun, Tokyo, Japan
[5] Utah State Univ, Logan, UT 84322 USA
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2015年 / 48卷 / 06期
基金
美国国家科学基金会; 新加坡国家研究基金会; 日本学术振兴会;
关键词
Simple polygon; Geodesic diameter; Geodesic center; L1; metric; LINK CENTER; ALGORITHM;
D O I
10.1016/j.comgeo.2015.02.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we show that the L-1 geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the L-1 geodesic balls, that is, the metric balls with respect to the L-1 geodesic distance. More specifically, in this paper we show that any family of L-1 geodesic balls in any simple polygon has Helly number two, and the L-1 geodesic center consists of midpoints of shortest paths between diametral pairs. These properties are crucial for our linear-time algorithms, and do not hold for the Euclidean case. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:495 / 505
页数:11
相关论文
共 50 条
  • [1] Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
    Bae, Sang Won
    Korman, Matias
    Okamoto, Yoshio
    Wang, Haitao
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 120 - 131
  • [2] Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
    Bae, Sang Won
    Korman, Matias
    Mitchell, Joseph S. B.
    Okamoto, Yoshio
    Polishchuk, Valentin
    Wang, Haitao
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 57 (03) : 674 - 701
  • [3] Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
    Bae, Sang Won
    Korman, Matias
    Mitchell, Joseph S. B.
    Okamoto, Yoshio
    Polishchuk, Valentin
    Wang, Haitao
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [4] COMPUTING THE GEODESIC CENTER OF A SIMPLE POLYGON
    POLLACK, R
    SHARIR, M
    ROTE, G
    DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (06) : 611 - 626
  • [5] COMPUTING THE EXTERNAL GEODESIC DIAMETER OF A SIMPLE POLYGON
    SAMUEL, D
    TOUSSAINT, GT
    COMPUTING, 1990, 44 (01) : 1 - 19
  • [6] A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
    Hee-Kap Ahn
    Luis Barba
    Prosenjit Bose
    Jean-Lou De Carufel
    Matias Korman
    Eunjin Oh
    Discrete & Computational Geometry, 2016, 56 : 836 - 859
  • [7] A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
    Ahn, Hee-Kap
    Barba, Luis
    Bose, Prosenjit
    De Carufel, Jean-Lou
    Korman, Matias
    Oh, Eunjin
    DISCRETE & COMPUTATIONAL GEOMETRY, 2016, 56 (04) : 836 - 859
  • [9] Computing a geodesic two-center of points in a simple polygon
    Oh, Eunjin
    Bae, Sang Won
    Ahn, Hee-Kap
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 82 : 45 - 59
  • [10] The geodesic 2-center problem in a simple polygon
    Oh, Eunjin
    De Carufel, Jean-Lou
    Ahn, Hee-Kap
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 74 : 21 - 37