Surface Approximation and Geometric Partitions

DOI10.1137/S0097539794269801zbMath0911.65149OpenAlexW2035057147MaRDI QIDQ4210082

Subhash Suri, Pankaj K. Agarwal

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

zbMATH Keywords

dynamic programmingvisualizationpolynomial time algorithmapproximation algorithmsmachine learningsurface approximationsimplificationsterrainslevels of detailgeometric partitionssimplicial surface of minimal complexity

Mathematics Subject Classification ID

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) Complexity and performance of numerical algorithms (65Y20)

Related Items (14)

Structured discrete shape approximation: theoretical complexity and practical algorithm ⋮ Approximating points by a piecewise linear function ⋮ Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Computing optimal islands ⋮ Algorithmic aspects of proportional symbol maps ⋮ Cup Products on Polyhedral Approximations of 3D Digital Images ⋮ Computing Large Planar Regions in Terrains ⋮ Delineating boundaries for imprecise regions ⋮ Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets ⋮ Approximate range searching using binary space partitions ⋮ Isotopic approximation within a tolerance volume ⋮ Computing large planar regions in terrains, with an application to fracture surfaces ⋮ The complexity of separating points in the plane

This page was built for publication: Surface Approximation and Geometric Partitions