Show simple item record

dc.contributor.authorPlantinga, Simonen_US
dc.contributor.authorVegter, Gerten_US
dc.contributor.editorRoberto Scopigno and Denis Zorinen_US
dc.date.accessioned2014-01-29T09:19:55Z
dc.date.available2014-01-29T09:19:55Z
dc.date.issued2004en_US
dc.identifier.isbn3-905673-13-4en_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SGP/SGP04/251-260en_US
dc.description.abstractImplicit surfaces are defined as the zero set of a function F : R<sup>3</sup>-> R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined stepsize or bounds to indicate the precision, and therefore cannot guarantee topological correctness. Interval arithmetic provides a mechanism to determine global properties of the implicit function. In this paper we present an algorithm that uses these properties to generate a piecewise linear approximation of implicit curves and surfaces, that is isotopic to the curve or surface itself. The algorithm is simple and fast, and is among the first to guarantee isotopy for implicit surface meshing.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleIsotopic Approximation of Implicit Curves and Surfacesen_US
dc.description.seriesinformationSymposium on Geometry Processingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record