Computing a double-ray center for a planar point set

Alex Glozman; Klara Kedem; Gregory Shpitalnik

doi:10.1142/S0218195999000091

Computing a double-ray center for a planar point set

Alex Glozman, Klara Kedem, Gregory Shpitalnik

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set 5 of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n³α(n) log²n).

Original language	English
Pages (from-to)	109-123
Number of pages	15
Journal	International Journal of Computational Geometry and Applications
Volume	9
Issue number	2
DOIs	https://doi.org/10.1142/S0218195999000091
State	Published - 1 Jan 1999

Keywords

Algorithm
Center
Hausdorff distance
Optimization
Planar point set

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Theory and Mathematics
Computational Mathematics
Applied Mathematics

Access to Document

10.1142/S0218195999000091

Cite this

@article{3d34aeff0c6c4cde8dceda714a5d188c,

title = "Computing a double-ray center for a planar point set",

abstract = "A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set 5 of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n3α(n) log2n).",

keywords = "Algorithm, Center, Hausdorff distance, Optimization, Planar point set",

author = "Alex Glozman and Klara Kedem and Gregory Shpitalnik",

year = "1999",

month = jan,

day = "1",

doi = "10.1142/S0218195999000091",

language = "English",

volume = "9",

pages = "109--123",

journal = "International Journal of Computational Geometry and Applications",

issn = "0218-1959",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "2",

}

TY - JOUR

T1 - Computing a double-ray center for a planar point set

AU - Glozman, Alex

AU - Kedem, Klara

AU - Shpitalnik, Gregory

PY - 1999/1/1

Y1 - 1999/1/1

N2 - A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set 5 of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n3α(n) log2n).

AB - A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set 5 of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n3α(n) log2n).

KW - Algorithm

KW - Center

KW - Hausdorff distance

KW - Optimization

KW - Planar point set

UR - http://www.scopus.com/inward/record.url?scp=0033409991&partnerID=8YFLogxK

U2 - 10.1142/S0218195999000091

DO - 10.1142/S0218195999000091

M3 - Article

AN - SCOPUS:0033409991

SN - 0218-1959

VL - 9

SP - 109

EP - 123

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

IS - 2

ER -

Computing a double-ray center for a planar point set

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this