Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
427832 | Information Processing Letters | 2009 | 6 Pages |
Abstract
We study the complexity of higher-order Voronoi diagrams on triangulated surfaces under the geodesic distance, when the sites may be polygonal domains of constant complexity. More precisely, we show that on a surface defined by n triangles the sum of the combinatorial complexities of the order-j Voronoi diagrams of m sites, for j=1,…,k, is O(k2n2+k2m+knm), which is asymptotically tight in the worst case.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics