Fast polygonization of variational implicit surfaces

This article presents a simple hierarchical adaptation of the marching cubes algorithm for polygonizing variational implicit surfaces used in modelling and reconstruction applications. The technique relies on placing the normal and boundary constraint points respecting pseudo-Euclidean distance metrics. This procedure makes it possible to quickly prune the space and minimize the number of costly function evaluations and thus converge rapidly to the surface. Timings show that this technique tends to perform faster than Bloomenthal´s (1994) continuation polygonizer.