Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Abstract Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplifie...
This paper presentes a novel algorithm for the voxelization of surface models of arbitrary topology. Our algorithm uses the depth and stencil buffers, available in most commercial...
Georgios Passalis, Ioannis A. Kakadiaris, Theohari...
In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygo...
Anselmo Antunes Montenegro, Luiz Velho, Paulo Ceza...