The symmetric all-furthest- neighbor problem

Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Given a set P of n points on the plane, a symmetric furthest-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in P. A pair of points is antipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of P is both a set of extreme points of P and an antipodal pair of P. It is also shown that an asymmetric furthest-neighbor (ASFN) pair is not necessarily antipodal. Furthermore, if P is such that no two distances are equal, it is shown that as many as, and no more than, ⌊n/2⌋ pairs of points are SFN pairs. A polygon is unimodal if for each vertex pk, k = 1,...,n the distance function defined by the euclidean distance between pk and the remaining vertices (traversed in order) contains only one local maximum. The fastest existing algorithms for computing all the ASFN or SFN pairs of either a set of points, a simple polygon, or a convex polygon, require 0(n log n) running time. It is shown that the above results lead to an 0(n) algorithm for computing all the SFN pairs of vertices of a unimodal polygon.

    Original languageEnglish (US)
    Pages (from-to)747-754
    Number of pages8
    JournalComputers and Mathematics with Applications
    Volume9
    Issue number6
    DOIs
    StatePublished - Jan 1 1983

    Fingerprint

    Polygon
    Simple Polygon
    Computing
    Convex polygon
    Extreme Points
    Distance Function
    Euclidean Distance
    Set of points
    Fast Algorithm
    Line
    Vertex of a graph

    ASJC Scopus subject areas

    • Modeling and Simulation
    • Computational Theory and Mathematics
    • Computational Mathematics

    Cite this

    The symmetric all-furthest- neighbor problem. / Toussaint, Godfried.

    In: Computers and Mathematics with Applications, Vol. 9, No. 6, 01.01.1983, p. 747-754.

    Research output: Contribution to journalArticle

    Toussaint, Godfried. / The symmetric all-furthest- neighbor problem. In: Computers and Mathematics with Applications. 1983 ; Vol. 9, No. 6. pp. 747-754.
    @article{a8a8471f0ef742aaa51f223db59e98e2,
    title = "The symmetric all-furthest- neighbor problem",
    abstract = "Given a set P of n points on the plane, a symmetric furthest-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in P. A pair of points is antipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of P is both a set of extreme points of P and an antipodal pair of P. It is also shown that an asymmetric furthest-neighbor (ASFN) pair is not necessarily antipodal. Furthermore, if P is such that no two distances are equal, it is shown that as many as, and no more than, ⌊n/2⌋ pairs of points are SFN pairs. A polygon is unimodal if for each vertex pk, k = 1,...,n the distance function defined by the euclidean distance between pk and the remaining vertices (traversed in order) contains only one local maximum. The fastest existing algorithms for computing all the ASFN or SFN pairs of either a set of points, a simple polygon, or a convex polygon, require 0(n log n) running time. It is shown that the above results lead to an 0(n) algorithm for computing all the SFN pairs of vertices of a unimodal polygon.",
    author = "Godfried Toussaint",
    year = "1983",
    month = "1",
    day = "1",
    doi = "10.1016/0898-1221(83)90139-6",
    language = "English (US)",
    volume = "9",
    pages = "747--754",
    journal = "Computers and Mathematics with Applications",
    issn = "0898-1221",
    publisher = "Elsevier Limited",
    number = "6",

    }

    TY - JOUR

    T1 - The symmetric all-furthest- neighbor problem

    AU - Toussaint, Godfried

    PY - 1983/1/1

    Y1 - 1983/1/1

    N2 - Given a set P of n points on the plane, a symmetric furthest-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in P. A pair of points is antipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of P is both a set of extreme points of P and an antipodal pair of P. It is also shown that an asymmetric furthest-neighbor (ASFN) pair is not necessarily antipodal. Furthermore, if P is such that no two distances are equal, it is shown that as many as, and no more than, ⌊n/2⌋ pairs of points are SFN pairs. A polygon is unimodal if for each vertex pk, k = 1,...,n the distance function defined by the euclidean distance between pk and the remaining vertices (traversed in order) contains only one local maximum. The fastest existing algorithms for computing all the ASFN or SFN pairs of either a set of points, a simple polygon, or a convex polygon, require 0(n log n) running time. It is shown that the above results lead to an 0(n) algorithm for computing all the SFN pairs of vertices of a unimodal polygon.

    AB - Given a set P of n points on the plane, a symmetric furthest-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in P. A pair of points is antipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of P is both a set of extreme points of P and an antipodal pair of P. It is also shown that an asymmetric furthest-neighbor (ASFN) pair is not necessarily antipodal. Furthermore, if P is such that no two distances are equal, it is shown that as many as, and no more than, ⌊n/2⌋ pairs of points are SFN pairs. A polygon is unimodal if for each vertex pk, k = 1,...,n the distance function defined by the euclidean distance between pk and the remaining vertices (traversed in order) contains only one local maximum. The fastest existing algorithms for computing all the ASFN or SFN pairs of either a set of points, a simple polygon, or a convex polygon, require 0(n log n) running time. It is shown that the above results lead to an 0(n) algorithm for computing all the SFN pairs of vertices of a unimodal polygon.

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

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

    U2 - 10.1016/0898-1221(83)90139-6

    DO - 10.1016/0898-1221(83)90139-6

    M3 - Article

    VL - 9

    SP - 747

    EP - 754

    JO - Computers and Mathematics with Applications

    JF - Computers and Mathematics with Applications

    SN - 0898-1221

    IS - 6

    ER -