A topological hierarchy for functions on triangulated surfaces
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structure supporting traversal and reconstruction operations similarly to traditional geometry-based representations. We use this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Milnor, J. (1963) · doi:10.1515/9781400881802 · Cited by 1,390
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Self-citationTopology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58 · cited 1×
“We find a similar focus in the successi ve attemptsto include the capability to change the topologicaltype [11], [12].”
Background
Cited by
Visualizing high-dimensional data: advances in the past decade
Liu, S., Maljovec, D., Wang, B., Bremer, P.-T., & Pascucci, V. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2640960 · Cited by 427
Self-citationSpectral surface quadrangulation
Dong, S., Bremer, P.-T., Garland, M., Pascucci, V., & Hart, J. C. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141993 · Cited by 315
Self-citationReuter, M. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0278-1 · Cited by 161
“Usually the paths are not completely deleted, but only hidden and stored in a hierarchical representation (see also [41]) making it possible to vary the desired level of detail freely.”
Background
Metadata
- Authors
- Bremer, P.-T., Hamann, B., Edelsbrunner, H., & Pascucci, V.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2004-07
- Volume
- 10
- Issue
- 4
- Pages
- 385-396
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2123207641
- Cited by
- 207
- References
- 4
- FWCI
- 12.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.