Acharya et al., 2015 - Google Patents

A parallel and memory efficient algorithm for constructing the contour tree

Acharya et al., 2015

View PDF
Document ID
13343372319732778140
Author
Acharya A
Natarajan V
Publication year
Publication venue
2015 IEEE Pacific Visualization Symposium (PacificVis)

External Links

Snippet

The contour tree is a topological structure associated with a scalar function that tracks the connectivity of the evolving level sets of the function. It supports intuitive and interactive visual exploration and analysis of the scalar function. This paper describes a fast, parallel …
Continue reading at vgl.csa.iisc.ac.in (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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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
    • 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
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/78—Power analysis and optimization
    • 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
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • 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

Similar Documents

Publication Publication Date Title
Acharya et al. A parallel and memory efficient algorithm for constructing the contour tree
Maadasamy et al. A hybrid parallel algorithm for computing and tracking level set topology
Koschan Perception-based 3D triangle mesh segmentation using fast marching watersheds
Gyulassy et al. A practical approach to Morse-Smale complex computation: Scalability and generality
Greaves A quadtree adaptive method for simulating fluid flows with moving interfaces
EP2887262B1 (en) Point Cloud Simplification
Jaillet et al. Fast Quadtree/Octree adaptive meshing and re-meshing with linear mixed elements
Thomas et al. Detecting symmetry in scalar fields using augmented extremum graphs
Fellegara et al. Efficient computation and simplification of discrete morse decompositions on triangulated terrains
Weber et al. Efficient parallel extraction of crack-free isosurfaces from adaptive mesh refinement (AMR) data
Yu et al. Scalable parallel distance field construction for large-scale applications
Aykanat et al. Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Anderson et al. Smooth, volume-accurate material interface reconstruction
Doraiswamy et al. Output-sensitive construction of Reeb graphs
Gao et al. Rational quadratic approximation to real algebraic curves
Harrison Data-parallel mesh connected components labeling and analysis
Vetsch et al. Neuralmeshing: Differentiable meshing of implicit neural representations
Zheng et al. Parallel and automatic isotropic tetrahedral mesh generation of misaligned assemblies
Harrison et al. A distributed-memory algorithm for connected components labeling of simulation data
Gyulassy et al. Practical considerations in Morse-Smale complex computation
Zou et al. Parallel in situ detection of connected components in adaptive mesh refinement data
Shivashankar et al. Efficient software for programmable visual analysis using Morse-Smale complexes
Wu et al. Visualizing 2d scalar fields with hierarchical topology
Davy et al. A note on improving the performance of Delaunay triangulation
Nucha et al. Computing contour trees for 2d piecewise polynomial functions