Continuation Methods for Approximating Isovalued Complex Surfaces

Simple item page
dc.contributor.authorZahlten, Corneliaen_US
dc.contributor.authorJürgens, Hartmuten_US
dc.date.accessioned2015-10-05T07:56:46Z
dc.date.available2015-10-05T07:56:46Z
dc.date.issued1991en_US
dc.description.abstractBasically there are two different approaches for rendering isovalued surfaces in 3D space: projection methods and surface reconstruction. We are discussing two algorithms of the second kind. Both use continuation methods for efficiently scanning an isovalued surface. A simplicial pivoting algorithm by Ralf Widmann which continues earlier work of E. L. Allgower et al., is compared to an approach which is based on subdividing space into cubes. The algorithms determine all simplices or cubes intersecting the surface and then generate an oriented polygonal approximation. For demonstration and comparison we use several fractal and some smooth surfaces. These surfaces are implicitely defined by a function, but it is also possible to apply both methods to 3D volume data.en_US
dc.description.seriesinformationEG 1991-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19911000en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19911000en_US
dc.publisherEurographics Associationen_US
dc.titleContinuation Methods for Approximating Isovalued Complex Surfacesen_US
Files
Collections
EG1991 Proceedings (Technical Papers)
EG1991 Proceedings (Technical Papers)