Continuation Methods for Approximating Isovalued Complex Surfaces
| dc.contributor.author | Zahlten, Cornelia | en_US |
| dc.contributor.author | Jürgens, Hartmut | en_US |
| dc.date.accessioned | 2015-10-05T07:56:46Z | |
| dc.date.available | 2015-10-05T07:56:46Z | |
| dc.date.issued | 1991 | en_US |
| dc.description.abstract | Basically 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.seriesinformation | EG 1991-Technical Papers | en_US |
| dc.identifier.doi | 10.2312/egtp.19911000 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egtp.19911000 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Continuation Methods for Approximating Isovalued Complex Surfaces | en_US |