Computing and reducing slope complexes

Kropatsch W.G. Casablanca, Rocío M. Batavia D. Gonzalez-Diaz R.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Doi 10.1007/978-3-030-10828-1_2
Volumen 11382 LNCS páginas 12 - 25
2019-01-01
Citas: 2
Abstract
© 2019, Springer Nature Switzerland AG. In this paper we provide a new characterization of cell decomposition (called slope complex) of a given 2-dimensional continuous surface. Each patch (cell) in the decomposition must satisfy that there exists a monotonic path for any two points in the cell. We prove that any triangulation of such surface is a slope complex and explain how to obtain new slope complexes with a smaller number of slope regions decomposing the surface. We give the minimal number of slope regions by counting certain bounding edges of a triangulation of the surface obtained from its critical points.
Datos de publicaciones obtenidos de Scopus