volume 30, issue 3, P357-372 2003
DOI: 10.1007/s00454-003-2769-0
View full text
|
|
Share

Abstract: Abstract. Given an orientable genus-0 polyhedral surface defined by n triangles, and a set of m point sites on it, we would like to identify its 1-center, i.e., the location on the surface that minimizes the maximum distance to the sites. The distance is measured as the length of the Euclidean shortest path along the surface. To compute the 1-center, we compute the furthest-site Voronoi diagram of the sites on the polyhedral surface. We show that the diagram has maximum combinatorial complexity (mn 2 ), and p…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals