Efficient algorithms for computing Reeb graphs (Q924077): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2008.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011751494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Points and Curvature for Embedded Polyhedral Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing contour trees in all dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loops in Reeb graphs of 2-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Morse-smale complexes for piecewise linear 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of a minimum spanning forest in a dynamic plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological quadrangulations of closed triangulated surfaces using the Reeb graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation of the topology of level sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5845505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal fully-dynamic graph connectivity / rank
 
Normal rank

Latest revision as of 19:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for computing Reeb graphs
scientific article

    Statements

    Efficient algorithms for computing Reeb graphs (English)
    0 references
    0 references
    0 references
    27 July 2009
    0 references
    computational topology
    0 references
    algorithms
    0 references
    dynamic graph
    0 references
    level set
    0 references
    manifold
    0 references
    piecewise-linear function
    0 references
    Reeb graph
    0 references

    Identifiers