![]() Graph Models 67(3):204–231īhunre PK, Bhowmick P, Mukherjee J (2019) On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface. In: Proceedings of shape modeling international, pp 49–58Īlliez P, de Verdière EC, Devillers O, Isenburg M (2005) Centroidal Voronoi diagrams for isotropic surface remeshing. Experimental results on different datasets have been presented to demonstrate its efficiency and robustness.Īlliez P, de Verdire EC, Devillers O, Isenburg M (2003) Isotropic surface remeshing. As our algorithm works entirely in voxel space, it is readily implementable in GPU for all associated computations. As its application in 3D modeling, we have also shown how the energy-optimizing tessellation iteratively transforms a 2-manifold surface (e.g., a triangulated mesh) into an isotropic mesh while preserving the surface details. Over successive iterations, the seeds are updated to effectuate energy optimization, and thus to gradually converge towards a uniform tessellation. For selection of seeds needed to initialize field computation and Voronoi tessellation, an efficient strategy of functional partitioning is used to partition the digital manifold into a collection of functional components. ![]() Its pipeline integrates several novel ideas, such as local directional field, which is used to estimate field energy, and when combined with Voronoi energy, provides an estimate of the uniformity of tessellation in each iteration. We present here a GPU-friendly algorithm for uniform Voronoi tessellation (UVT) of a digital manifold, which, in particular, may be conceived as the voxelized representation of a 2-manifold surface. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |