Adaptive Edge Spinning Algorithm for Poligonization of Implicit Surfaces

Authors:
Martin Cermak;Vaclav Skala
Affiliations:
University of West Bohemia;University of West Bohemia
Venue:
CGI '04 Proceedings of the Computer Graphics International
Year:
2004

Citing 0
Cited 2

Surface reconstruction from constructive solid geometry for interactive visualization

ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part I
Style nodes and repolygonization for hierarchical tree-based implicit surface modelling

Computational Aesthetics'09 Proceedings of the Fifth Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an adaptive method forpolygonization of implicit surfaces. The method insistson the shape of triangles and the accuracy of resultingapproximation as well. The main advantages of thetriangulation presented are simplicity and the stablefeatures that can be used for next expanding. Theimplementation is not complicated and only thestandard data structures are used. The presentedalgorithm is based on the surface tracking scheme andit is compared with the other algorithms based on thesimilar principle, such as the Marching cubes and theMarching triangles algorithms.