@article{cha-pla-veg-12-aa-radial,
  author = {Chattopadhyay, Amit and Plantinga, Simon and Vegter, Gert},
  title = {Certified Meshing of Radial Basis Function Based Isosurfaces},
  journal = {The Visual Computer},
  volume = {28},
  pages = {445-462},
  year = 2012,
  month = may,
  doi = {10.1007/s00371-011-0627-2},
  comment = {Tried AA but found that it was not fast enough so developed a different method, BPARAB, exploiting the special form of the radial functions.  Apparently uses quadratic Taylor-interval-like bounds.},
  abstract = {Radial Basis Functions are widely used in scattered data interpolation. The surface-reconstruction method using radial basis functions consists of two steps: (i) computing an interpolating implicit function the zero set of which contains the points in the data set, followed by (ii) extraction of isocurves or isosurfaces. In this paper we focus on the second step, generalizing the work on certified meshing of implicit surfaces based on interval arithmetic (Plantinga and Vegter in Visual Comput. 23:45-58, 2007). It turns out that interval arithmetic, and even the usually faster affine arithmetic, are far too slow in the context of RBF-based implicit surface meshing. We present optimized strategies giving acceptable running times and better space complexity, exploiting special properties of RBF-interpolants. We present pictures and timing results confirming the improved quality of these optimized strategies.}
}