## 抄録

Voronoi diagrams for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predetermined criterion. In this paper we are interested in various measures associated with criteria on goodness of an input line segment with respect to each point in the plane as the "point of view." These measures basically show how well a segment or information displayed on the segment can be seen from the point. Mathematically, the measures are defined in terms of the shapes of the triangle determined by the point and the line segment. We study the combinatorial and algorithmic complexities of those Voronoi diagrams. We also study an associated optimization problem: find a point that maximizes the smallest measure value over the measures with respect to all the given line segments. We give sufficient conditions for an optimal point to lie on a Voronoi edge and present a heuristic optimization algorithm for those measures having this property.

本文言語 | English |
---|---|

ページ（範囲） | 149-164 |

ページ数 | 16 |

ジャーナル | Japan Journal of Industrial and Applied Mathematics |

巻 | 25 |

号 | 2 |

DOI | |

出版ステータス | Published - 2008 6月 |

外部発表 | はい |

## ASJC Scopus subject areas

- 工学（全般）
- 応用数学