Surface Approximation and Geometric Partitions
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (4) , 1016-1035
- https://doi.org/10.1137/s0097539794269801
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 1992
- Simplification of objects rendered by polygonal approximationsComputers & Graphics, 1991
- Polygonization of implicit surfacesComputer Aided Geometric Design, 1988
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987
- An Algorithm for Piecewise Linear Approximation of Implicitly Defined Two-Dimensional SurfacesSIAM Journal on Numerical Analysis, 1987
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined ManifoldSIAM Journal on Numerical Analysis, 1985
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975