Two approaches for polyhedral reconstruction of 3D objects of arbitrary genus
by Thomas Schreiber, Guido Brunnett, Frank lsselhard
International Journal of Vehicle Design (IJVD), Vol. 21, No. 2/3, 1999

Abstract: This paper addresses the problem of constructing a polyhedral approximation of a 3D object, given by a set of scattered points from the object's surface. Two solutions of this problem are presented. Both methods use the Delaunay triangulation as an initial neighbourhood graph. The first approach is based on Boissonnat's strategy to remove tetrahedra from the hull of the graph according to a cost function. Our algorithm extends Boissonnat's work to objects of arbitrary genus and offers an automatic termination procedure. The second method defines a new approach to approximate the minimal spanning Voronoi tree which was introduced by O'Rourke et al. Here, in the first step, tetrahedra are grouped into polyhedra and in a second step they are classified to belong either to the polyhedral reconstruction or not.

Online publication date: Wed, 20-Oct-2004

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 Vehicle Design (IJVD):
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