Surface Approximation and Geometric Partitions
From MaRDI portal
Publication:4210082
Recommendations
Cited in
(16)- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- The complexity of separating points in the plane
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
- Splittings of Surfaces
- Approximating points by a piecewise linear function
- Computing optimal islands
- Isotopic approximation within a tolerance volume
- Algorithmic aspects of proportional symbol maps
- Cup products on polyhedral approximations of 3D digital images
- Online class cover problem
- Delineating boundaries for imprecise regions
- Approximate range searching using binary space partitions
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Computing large planar regions in terrains, with an application to fracture surfaces
- Computing Large Planar Regions in Terrains
This page was built for publication: Surface Approximation and Geometric Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210082)