Pages that link to "Item:Q967409"
From MaRDI portal
The following pages link to Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409):
Displaying 9 items.
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Gift-wrapping based preimage computation algorithm (Q834263) (← links)
- On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface (Q2215068) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- A combinatorial algorithm to construct 3D isothetic covers (Q2855777) (← links)
- Cup Products on Polyhedral Approximations of 3D Digital Images (Q3003527) (← links)
- Computing and Combinatorics (Q4681182) (← links)
- ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS: A FIXED PRECISION APPROACH (Q4889506) (← links)
- An efficient abstract domain for not necessarily closed polyhedra (Q6041169) (← links)
