Polygonisation of disjoint implicit surfaces by the adaptive edge spinning algorithm of implicit objects
by Martin Cermak, Vaclav Skala
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 1, 2007

Abstract: This paper presents an adaptive method for polygonisation of implicit surfaces. The method is based on the shape of triangles and the accuracy of resulting approximation. The main advantages of the triangulation presented are simplicity and the stable features that can be used for the next expansion. The presented algorithm is based on the surface tracking scheme, and it is compared with other algorithms that are based on the similar principle, such as the Marching cubes and the Marching triangles algorithms. Moreover, the technique for detection of more disjoint implicit surfaces in a defined area is also presented. The algorithm is not limited to a given polygonisation method, but then its use is possible for all other surface approaches that need a starting point at the beginning.

Online publication date: Mon, 09-Jul-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com