On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface

DOI10.1016/j.ins.2018.03.006zbMath1451.68299OpenAlexW2791778602MaRDI QIDQ2215068

Partha Bhowmick, Piyush Kanti Bhunre, Jayanta Mukherjee

Publication date: 10 December 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.03.006

zbMATH Keywords

discretizationmanifoldsdigital geometryvoxelizationChebyshev distancedigital linedigital triangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

One More Step Towards Well-Composedness of Cell Complexes over nD Pictures ⋮ Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing

Uses Software

• VoxelPipe
• Algorithm 964

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of Gauss digitized shapes and digital surface integration
• Digital planarity -- a review
• On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\)
• Topological analysis of voxelized objects by discrete geodesic Reeb graph
• Plane digitization and related combinatorial problems
• 3D well-composed polyhedral complexes
• Shading-based refinement on volumetric signed distance functions
• Implicit Digital Surfaces in Arbitrary Dimensions
• On Characterization and Decomposition of Isothetic Distance Functions for 2-Manifolds
• High resolution sparse voxel DAGs
• Modular flux transfer
• Algorithm 964

This page was built for publication: On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface