General minisum circle location

Mark Körner, Jack Brimberg, Henrik Juel, Anita Schöbel

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    128 Downloads (Pure)

    Abstract

    In our paper we approximate a set of given points by a general circle. More precisely, we consider the problem of locating and scaling the unit ball of some given norm k1 with respect to xed points on the plane such that the sum of weighted distances between the circle and the xed points is minimized, where the distance is measured by a norm k2. We present results for the general case. In the case that k1 and k2 are both block norms, we are able to identify a nite dominating set in R3 for the problem, which can be obtained as the intersection of cones.
    Original languageEnglish
    Title of host publicationProceedings of the 21st Canadian Conference on Computational Geometry
    Publication date2009
    Pages111-114
    Publication statusPublished - 2009
    EventThe 21st Canadian Conference on Computational Geometry : CCCG 2009 - Vancouver, BC Canada
    Duration: 1 Jan 2009 → …

    Conference

    ConferenceThe 21st Canadian Conference on Computational Geometry : CCCG 2009
    CityVancouver, BC Canada
    Period01/01/2009 → …

    Fingerprint

    Dive into the research topics of 'General minisum circle location'. Together they form a unique fingerprint.

    Cite this