Login
TitleNear-Optimal Adaptive Polygonalization (In Proceedings)
inProceedings of the Computer Graphics International Conference
Author(s) Wolfgang Seibold, Ken Joy
Year 1999
LocationCanmore, Alberta
DateJune 7--11, 1999
Pages206--213
Download
BibTeX
Abstract Consider a triangulation of the xy plane, and a general surface z = (xy). The points of the triangle, when lifted to the surface, form a linear spline approximation to the surface. We are interested in the error between the surface and the linear approximant. In fact, we are interested in building triangulations in the plane such that the induced linear approximant is near-optimal with respect to a given error. Here we describe a new method, which iteratively adds points to a "Delaunay-like" triangulation of the plane. We locally approximate by a quadratic surface and utilize this quadrilateral that enables us to minimize the error between the surface and the triangulation.