Surface approximation and geometric partitions

Journal Article (Journal Article)

Motivated by applications in computer graphics, visualization, and scientific computation, we study the computational complexity of the following problem: given a set S of n points sampled from a bivariate function f(x, y) and an input parameter ε > 0, compute a piecewise-linear function ∑(x, y) of minimum complexity (that is, an xy-monotone polyhedral surface, with a minimum number of vertices, edges, or faces) such that |∑(xp,yp) - zp| ≤ ε for all (xp, yp, zp) ∈ S. We give hardness evidence for this problem, by showing that a closely related problem is NP-hard. The main result of our paper is a polynomial-time approximation algorithm that computes a piecewise-linear surface of size O(Ko log Ko), where Ko is the complexity of an optimal surface satisfying the constraints of the problem. The technique developed in our paper is more general and applies to several other problems that deal with partitioning of points (or other objects) subject to certain geometric constraints. For instance, we get the same approximation bound for the following problem arising in machine learning: given n "red" and m "blue" points in the plane, find a minimum number of pairwise disjoint triangles such that each blue point is covered by some triangle and no red point lies in any of the triangles. © 1998 Society for Industrial and Applied Mathematics.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK

Published Date

  • January 1, 1998

Published In

Volume / Issue

  • 27 / 4

Start / End Page

  • 1016 - 1035

International Standard Serial Number (ISSN)

  • 0097-5397

Digital Object Identifier (DOI)

  • 10.1137/S0097539794269801

Citation Source

  • Scopus