Surface Approximation and Geometric Partitions
From MaRDI portal
Publication:4210082
DOI10.1137/S0097539794269801zbMath0911.65149MaRDI QIDQ4210082
Subhash Suri, Pankaj K. Agarwal
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
dynamic programming; visualization; polynomial time algorithm; approximation algorithms; machine learning; surface approximation; simplifications; terrains; levels of detail; geometric partitions; simplicial surface of minimal complexity
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65Y20: Complexity and performance of numerical algorithms
Related Items
Approximating the k-Level in Three-Dimensional Plane Arrangements, Computing Large Planar Regions in Terrains, The complexity of separating points in the plane, Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes, Computing optimal islands, Structured discrete shape approximation: theoretical complexity and practical algorithm, Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets, 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, Isotopic approximation within a tolerance volume, Cup Products on Polyhedral Approximations of 3D Digital Images
