Extraction of Critical Points and Nets Based on Discrete Gradient Vector Field

Simple item page
dc.contributor.authorDe Floriani, Leilaen_US
dc.contributor.authorMesmoudi, Mohammed Mostefaen_US
dc.contributor.authorDanovaro, Emanueleen_US
dc.date.accessioned2015-11-12T07:16:52Z
dc.date.available2015-11-12T07:16:52Z
dc.date.issued2002en_US
dc.description.abstractIn this paper we address the problem of representing the topology of discrete scalar fields defined on triangulated domains. To this aim, we use the notion of discrete gradient vector field that we have introduced in [4] to classify the critical points of a scalar field defined over a two-dimensional domain that generalizes the nature of critical points in the differentiable case. Then we sketch an algorithm for extracting a critical net in the discrete case.en_US
dc.description.seriesinformationEurographics 2002 - Short Presentationsen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20021041en_US
dc.publisherEurographics Associationen_US
dc.titleExtraction of Critical Points and Nets Based on Discrete Gradient Vector Fielden_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
short86.pdf
Size:
1.12 MB
Format:
Adobe Portable Document Format
Download
Collections
Short Presentations