Show simple item record

dc.contributor.authorHui, K. C.en_US
dc.contributor.authorJiang, Z. H.en_US
dc.date.accessioned2015-02-16T06:24:15Z
dc.date.available2015-02-16T06:24:15Z
dc.date.issued1999en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/1467-8659.00302en_US
dc.description.abstractThis paper presents a tetrahedra based adaptive polygonization technique for tessellating implicit surface patches. An implicit surface patch is defined as an implicit surface bounded by its intersections with a set of clipping surfaces and which lies within an enclosing tetrahedron. To obtain the polygonization of an implicit surface patch, the tetrahedron containing the patch is adaptively subdivided into smaller tetrahedra according to the criteria introduced in the paper. The result is a set of tetrahedra each containing a facet approximating the surface. The intersections between the facets and the clipping surfaces are used to locate the surface patch boundary. Ambiguous results in generating the facets for highly curved surfaces or surfaces with singular points are also addressed. The result of the polygonization is a set of triangular facets that can be used for visualization and numerical analysis. The proposed method is also suitable for locating the intersection of two implicit surfaces.en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleTetrahedra Based Adaptive Polygonization of Implicit Surface Patchesen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume18en_US
dc.description.number1en_US
dc.identifier.doi10.1111/1467-8659.00302en_US
dc.identifier.pages57-68en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record