Surface Approximation and Geometric Partitions
From MaRDI portal
Recommendations
Cited in
(17)- Computing large planar regions in terrains, with an application to fracture surfaces
- Algorithmic aspects of proportional symbol maps
- Approximating points by a piecewise linear function
- Delineating boundaries for imprecise regions
- Approximate range searching using binary space partitions
- The complexity of separating points in the plane
- Isotopic approximation within a tolerance volume
- Cup products on polyhedral approximations of 3D digital images
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- Computing optimal islands
- scientific article; zbMATH DE number 1003231 (Why is no real title available?)
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Splittings of Surfaces
- Computing Large Planar Regions in Terrains
- Online class cover problem
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
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)