Cerca risorse accademiche

The visualization of complex virtual scenes can be significantly accelerated by applying Occlusion Culling. In this work we introduce a variant of the Hierarchical Occlusion Map method to be used in Real-Time application...

This paper describes an algorithm to determine whether a point is inside or outside a curvilinear polygon, based on the well known algorithm consisting of counting the intersections of an horizontal ray with the polygon....

En este trabajo se describe una estrategia eficiente y novedosa para la segmentación de superficies contenidas en imágenes digitales 3D, basada en modelos deformables o “snakes”. El método propone una inicializaci...

The problem of fi nding a minimum area polygonization for a given set of points in the plane, Minimum Area Polygonization (MAP) is NP-hard. Due to the complexity of the problem we aim at the development of algorithms to ...

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of Minimum Weight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on ...

El problema inverso al resuelto por la suma de Minkowski se refiere a la descomposición de polígonos en suma de Minkowski. Este problema, que denominamos SMINK-1, puede resolverse con un algoritmo de complejidad expone...