Abstract
An adaptive method for polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Čermák, M., & Skala, V. (2004). Curvature dependent polygonization by the edge spinning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 325–334. https://doi.org/10.1007/978-3-540-24767-8_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
