Tu et al., 2019 - Google Patents

Propagate and pair: A single-pass approach to critical point pairing in Reeb graphs

Tu et al., 2019

View PDF
Document ID
9305852878286421410
Author
Tu J
Hajij M
Rosen P
Publication year
Publication venue
International Symposium on Visual Computing

External Links

Snippet

With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex data, whose usefulness extends beyond just the graph itself. Pairing critical points …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46—Extraction of features or characteristics of the image
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Kališnik Tropical coordinates on the space of persistence barcodes
Carr et al. Computing contour trees in all dimensions
De Floriani et al. Morse complexes for shape segmentation and homological analysis: discrete models and algorithms
Chazal et al. Gromov-Hausdorff approximation of filament structure using Reeb-type graph
Morozov et al. Distributed contour trees
Ng A Legendrian Thurston–Bennequin bound from Khovanov homology
Shepler et al. A Poincaré-Birkhoff-Witt Theorem for quadratic algebras with group actions
Padillo et al. Exhaustive search algorithms to mine subgroups on big data using apache spark
Tu et al. Propagate and pair: A single-pass approach to critical point pairing in Reeb graphs
Kjaer On the odd primary homology of free algebras over the spectral Lie operad
Hristov et al. W-structures in contour trees
Koke et al. Graph scattering beyond wavelet shackles
Seidel A method for proving lower bounds for certain geometric problems
Skraba et al. Interpreting feature tracking through the lens of robustness
Rubinstein et al. Bounding embeddings of VC classes into maximum classes
Biasotti et al. Surface shape understanding based on extended Reeb graphs
Géraud et al. Introducing the Dahu pseudo-distance
Dey et al. Filtration simplification for persistent homology via edge contraction
Mukherjee Denoising with discrete Morse theory
Chen et al. Poisson equation solution and its gradient vector field to geometric features detection
Jones et al. Khovanov Laplacian and Khovanov Dirac for knots and links
Doraiswamy et al. Efficient output-sensitive construction of Reeb graphs
Santosh et al. Using spatial relations for graphical symbol description
Andrzejewski et al. Bounding box representation of co-location instances for L∞ induced distance measure
Sipeki et al. Simplification of Morse decompositions using morse set mergers