Visibility and proximity on triangulated surfaces

• Autores: Marta Fort
• Directores de la Tesis: J. A. Sellarès i Chiva (dir. tes.)
• Lectura: En la Universitat de Girona ( España ) en 2008
• Idioma: inglés
• Tribunal Calificador de la Tesis: Ferran Hurtado Díaz (presid.) , Narcís Coll (secret.) , François Anton Castro (voc.) , Isabel Navazo Álvaro (voc.) , Belén Palop del Río (voc.)
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this thesis, we solve visibility and proximity problems on triangulated surfaces concerning generalized elements, As generalized elements, we consider: points, segments, polygonal chains and polygonal regions. The proposed strategies use algorithms of Computational Geometry and Graphics Hardware. We start by studying multi-visibility problems on triangulated terrain models concerning a set of generalized view elements. We present two methods to obtain approximate multi-visibility maps. A multi-visibility map is a subdivision of the terrain domain encoding visibility according to different criteria. The first method, of complex implementation, uses exactly computed visibility information to approximately reconstruct the unknown multi-visibility map. The second, from which implementation results are provided, uses approximate visibility information to compute and visualize discrete multi-visibility maps by exploiting graphics hardware capabilities. As applications, we compute multi-visibility maps, solve inter-region multi-visibility problems and approximately answer point and polygonal region multi-visibility queries. Next, we tackle proximity problems on triangulated polyhedral surfaces, where generalized obstacles are allowed, considering generalized sources. We present two methods, with implementation results, to compute distances on polyhedral surfaces from a generalized source. The first method computes exact shortest path distances from generalized sources. The second provides approximate weighted shortest path distances from generalized sites on weighted polyhedral surfaces. Both methods are posteriorly extended to handle the multiple-site problem where the corresponding distance field is obtained. As applications, we compute discrete order-k Voronoi diagrams and approximately solve some facility location problems. We also provide a theoretical study on the order-k Voronoi diagram complexity of a set of generalized sources for the non-weighted case.