Minkowski-type theorems and least-squares partitioning

Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

    Original languageEnglish (US)
    Title of host publicationEighth Annual Symposium On Computational Geometry
    PublisherPubl by ACM
    Pages350-357
    Number of pages8
    ISBN (Print)0897915178
    StatePublished - 1992
    EventEighth Annual Symposium On Computational Geometry - Berlin, Ger
    Duration: Jun 10 1992Jun 12 1992

    Other

    OtherEighth Annual Symposium On Computational Geometry
    CityBerlin, Ger
    Period6/10/926/12/92

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Aurenhammer, F., Hoffmann, F., & Aronov, B. (1992). Minkowski-type theorems and least-squares partitioning. In Eighth Annual Symposium On Computational Geometry (pp. 350-357). Publ by ACM.

    Minkowski-type theorems and least-squares partitioning. / Aurenhammer, Franz; Hoffmann, Friedrich; Aronov, Boris.

    Eighth Annual Symposium On Computational Geometry. Publ by ACM, 1992. p. 350-357.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aurenhammer, F, Hoffmann, F & Aronov, B 1992, Minkowski-type theorems and least-squares partitioning. in Eighth Annual Symposium On Computational Geometry. Publ by ACM, pp. 350-357, Eighth Annual Symposium On Computational Geometry, Berlin, Ger, 6/10/92.
    Aurenhammer F, Hoffmann F, Aronov B. Minkowski-type theorems and least-squares partitioning. In Eighth Annual Symposium On Computational Geometry. Publ by ACM. 1992. p. 350-357
    Aurenhammer, Franz ; Hoffmann, Friedrich ; Aronov, Boris. / Minkowski-type theorems and least-squares partitioning. Eighth Annual Symposium On Computational Geometry. Publ by ACM, 1992. pp. 350-357
    @inproceedings{1f41ea3b92c749d490d9480925d32141,
    title = "Minkowski-type theorems and least-squares partitioning",
    abstract = "Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.",
    author = "Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov",
    year = "1992",
    language = "English (US)",
    isbn = "0897915178",
    pages = "350--357",
    booktitle = "Eighth Annual Symposium On Computational Geometry",
    publisher = "Publ by ACM",

    }

    TY - GEN

    T1 - Minkowski-type theorems and least-squares partitioning

    AU - Aurenhammer, Franz

    AU - Hoffmann, Friedrich

    AU - Aronov, Boris

    PY - 1992

    Y1 - 1992

    N2 - Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

    AB - Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

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

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

    M3 - Conference contribution

    SN - 0897915178

    SP - 350

    EP - 357

    BT - Eighth Annual Symposium On Computational Geometry

    PB - Publ by ACM

    ER -