### 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 language | English (US) |
---|---|

Title of host publication | Eighth Annual Symposium On Computational Geometry |

Publisher | Publ by ACM |

Pages | 350-357 |

Number of pages | 8 |

ISBN (Print) | 0897915178 |

State | Published - Dec 1 1992 |

Event | Eighth Annual Symposium On Computational Geometry - Berlin, Ger Duration: Jun 10 1992 → Jun 12 1992 |

### Publication series

Name | Eighth Annual Symposium On Computational Geometry |
---|

### Other

Other | Eighth Annual Symposium On Computational Geometry |
---|---|

City | Berlin, Ger |

Period | 6/10/92 → 6/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). (Eighth Annual Symposium On Computational Geometry). Publ by ACM.