The flow complex: A data structure for geometric modeling
METADATA ONLY
Loading...
Author / Producer
Date
2003
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
Structuring finite sets of points is at the heart of computational geometry. Such point sets arise naturally in many applications. Examples in R3 are point sets sampled from the surface of a solid or the locations of atoms in a molecule. A first step in processing these point sets is to organize them in some data structure. Structuring a point set into a simplicial complex like the Delaunay triangulation has turned out to be appropriate for many modeling tasks. Here we introduce the flow complex which is another simplicial complex that can be computed efficiently from a finite set of points. The flow complex turned out to be well suited for surface reconstruction from a finite sample and for some tasks in structural biology. Here we study mathematical and algorithmic properties of the flow complex and show how to exploit it in applications.
Permanent link
Publication status
published
External links
Editor
Book title
SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Journal / series
Volume
Pages / Article No.
285 - 294
Publisher
Society for Industrial and Applied Mathematics
Event
14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)