Securing Constrained Edges in a Triangulation
Jan Kucera, Norbert Adamko, Michal Varga · 2021
Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.