Surface Approximation and Geometric Partitions
DOI10.1137/S0097539794269801zbMATH Open0911.65149OpenAlexW2035057147MaRDI QIDQ4210082FDOQ4210082
Authors: Pankaj K. Agarwal, Subhash Suri 
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794269801
Recommendations
machine learningvisualizationdynamic programmingapproximation algorithmspolynomial time algorithmsurface approximationsimplificationsterrainslevels of detailgeometric partitionssimplicial surface of minimal complexity
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
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)
