title: Adaptive implicit surface polygonization
body: <p>I've been using one of the older implicit surface algorithms, due to Bloomenthal, as found <a href="http://www.unchainedgeometry.com/jbloom/papers.html" rel="noreferrer">here</a>, basically the tetrahedral-based algorithm.  This works fairly well, but has a shortcoming.  Since it uses a fixed grid, it either wastes polygons or ignores detail, depending on the grid size selected.  </p>
  
  <p>So my question is, what are my options for improving this? Are there any freely available (source or good description) implicit surface algorithms which are more adaptive to the curvature of the model?  Any option I'm missing? </p>
  
  <p>I have found <a href="http://liris.cnrs.fr/~egalin/Pdf/2001-triangle.pdf" rel="noreferrer">one paper</a> so far which looks promising, pointers to others would be appreciated. </p>