Computing contour trees in all dimensions
type: Item
instance of: scholarly article
title: Computing contour trees in all dimensions
zbMATH Open document ID: 1052.68098
DOI: 10.1016/S0925-7721(02)00093-7
author: Hamish Carr
author: Ulrike Axen
author: Jack Snoeyink
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1902832
zbMATH Keywords: Iso-surfaces
zbMATH Keywords: simplicial meshes
zbMATH Keywords: Morse theory
zbMATH Keywords: resolving singularities
Wikidata QID: Q56970615
MaRDI profile type: Publication
cites work: Critical points and curvature for embedded polyhedra
cites work: Q4952718
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: Morse Theory. (AM-51)
cites work: Q5667781
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
cites work: Octrees for faster isosurface generation
full work available at URL: s0925-7721(02)00093-7
OpenAlex ID: W3138447845
description: scientific article; zbMATH DE number 1902832