Parallel enumeration of triangulations (Q1658781): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Valgrind / rank | |||
Normal rank |
Revision as of 06:18, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel enumeration of triangulations |
scientific article |
Statements
Parallel enumeration of triangulations (English)
0 references
15 August 2018
0 references
Summary: We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call \textit{down-flip reverse search}, can be restricted, e.g., to computing full triangulations only; this case is particularly relevant for tropical geometry. Most importantly, down-flip reverse search allows for massive parallelization, i.e., it scales well even for many cores. Our implementation allows to compute the triangulations of much larger point sets than before.
0 references
triangulations of point configurations
0 references
reverse search
0 references