2026-04-14T02:55:47Zhttps://recercat.cat/oai/request

oai:recercat.cat:10256/159592024-06-18T12:17:32Zcom_2072_452955com_2072_2054col_2072_453069

00925njm 22002777a 4500 dc Cabello, Sergio author Fort, Marta author Sellarès i Chiva, Joan Antoni author 2009-04-15 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 http://hdl.handle.net/10256/15959 Algorismes computacionals Computer algorithms Grafs, Teoria de Graph theory Geometria computacional Computational geometry Poliedres Polyhedra Voronoi, Polígons de Voronoi diagrams Higher-order Voronoi diagrams on triangulated surfaces