Higher-order Voronoi diagrams on triangulated surfaces
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 Vor...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/15959 |
| Acceso en línea: | http://hdl.handle.net/10256/15959 |
| Access Level: | acceso abierto |
| Palabra clave: | Algorismes computacionals Computer algorithms Grafs, Teoria de Graph theory Geometria computacional Computational geometry Poliedres Polyhedra Voronoi, Polígons de Voronoi diagrams |
| Sumario: | 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 + k n m), which is asymptotically tight in the worst case |
|---|