Efficient Homology‐Preserving Simplification of High‐Dimensional Simplicial Shapes
نویسندگان
چکیده
منابع مشابه
Simplification techniques for maps in simplicial topology
This paper offers an algorithmic solution to the problem of obtaining “economical” formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used for defining cohomology operations at the cochain level. As an example, we obtain an explicit combinatorial description of all Steenrod kth powers exclusive...
متن کاملSimplification of vocal tract shapes with different levels of detail
We propose a semi-automatic method to regenerate simplified vocal tract geometries from very detailed input (e.g. MRI-based geometry) with the possibility to control the level of detail, while maintaining the overall properties. The simplification procedure controls the number and organization of the vertices in the vocal tract surface mesh and can be assigned to replace complex cross-sections ...
متن کاملAn iterative algorithm for homology computation on simplicial shapes
We propose a new iterative algorithm for computing the homology of arbitrary shapes discretized through simplicial complexes, We demonstrate how the simplicial homology of a shape can be effectively expressed in terms of the homology of its sub-components. The proposed algorithm retrieves the complete homological information of an input shape including the Betti numbers, the torsion coefficient...
متن کاملEfficient and Dynamic Simplification of Line Drawings
In this paper we present a pipeline for rendering dynamic 2D/3D line drawings efficiently. Our main goal is to create efficient static renditions and coherent animations of line drawings in a setting where lines can be added, deleted and arbitrarily transformed on-the-fly. Such a dynamic setting enables us to handle interactively sketched 2D line data, as well as arbitrarily transformed 3D line...
متن کاملEfficient Computation in Groups and Simplicial Complexes
Using HNN extensions of the Boone-Britton group, a group E is obtained which simulates Turing machine computation in linear space and cubic time. Space in E is measured by the length of words, and time by the number of substitutions of defining relators and conjugations by generators required to convert one word to another. The space bound is used to derive a PSPACE-complete problem for a topol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2019
ISSN: 0167-7055,1467-8659
DOI: 10.1111/cgf.13764