Many applications require to extract the surface of an object from a discrete set of valued points, applications in which the topological soundness of the obtained surface is, in many case, of the utmost importance. In this paper, we introduce the notion of frontier order which provides a discrete framework for defining frontiers of arbitrary objects. A major result we obtained is a theorem which guarantees the topological soundness of such frontiers in any dimension. Furthermore, we show how frontier orders can be used to design topologically coherent "Marching Cubes-like" algorithms. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Daragon, X., Couprie, M., & Bertrand, G. (2003). Discrete frontiers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2886, 236–245. https://doi.org/10.1007/978-3-540-39966-7_22
Mendeley helps you to discover research relevant for your work.