On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface
From MaRDI portal
Publication:2215068
Recommendations
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
- On Computing the Fréchet Distance Between Surfaces.
- The computation of simplicial approximations of implicitly defined two- dimensional manifolds
- Computing the Fréchet distance between real-valued surfaces
- Approximate distance queries for weighted polyhedral surfaces
- High-order methods for computing distances to implicitly defined surfaces
Cites work
- 3D well-composed polyhedral complexes
- Algorithm 964: An efficient algorithm to compute the genus of discrete surfaces and applications to turbulent flows
- Computational geometry. Algorithms and applications.
- Digital planarity -- a review
- High resolution sparse voxel dags
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- Implicit digital surfaces in arbitrary dimensions
- Modular flux transfer, efficient rendering of high-resolution volumes with repeated structures
- On characterization and decomposition of isothetic distance functions for 2-manifolds
- On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\)
- Plane digitization and related combinatorial problems
- Properties of Gauss digitized shapes and digital surface integration
- Shading-based refinement on volumetric signed distance functions
- Topological analysis of voxelized objects by discrete geodesic Reeb graph
Cited in
(3)
This page was built for publication: On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215068)