Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Lorensen, W., Cline, H.: Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 21, 163–169 (1987)
Payne, B.A., Toga, A.W.: Surface mapping brain function on 3D models. IEEE Computer Graphics and Applications 10, 33–41 (1990)
Cignoni, P., Ganovelli, F., Montani, C., Scopigno, R.: Reconstruction of topologically correct and adaptive trilinear isosurfaces. Computers and Graphics 24, 399–418 (2000)
Delibasis, K.S., Matsopoulos, G.K., Mouravliansky, N.A., Nikita, K.S.: A novel and efficient implementation of the marching cubes algorithm. Computerized Medical Imaging and Graphics 25, 343–352 (2001)
Zhou, C., Shu, R., Kankanhalli, M.S.: Handling small features in isosurface generation using marching cubes. Computers and Graphics 18, 845–848 (1994)
Chan, S.L., Purisima, E.O.: A new tetrahedral tesselation scheme for isosurface generation. Computers and Graphics 22, 83–90 (1998)
Lachaud, J.O.: Topologically defined iso-surfaces. In: Miguet, S., Ubéda, S., Montanvert, A. (eds.) DGCI 1996. LNCS, vol. 1176, pp. 245–256. Springer, Heidelberg (1996)
Lachaud, J.O., Montanvert, A.: Continuous analogs of digital boundaries: A topological approach to iso-surfaces. Graphical models 62, 129–164 (2000)
Kong, T.Y., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics and Image Processing 48, 357–393 (1989)
Daragon, X., Couprie, M., Bertrand, G.: Marching chains algorithm for alexandroff-khalimsky spaces. In: Vision Geometry XI, pp. 51–62 (2002)
Khalimsky, E.: On topologies of generalized segments. Soviet Mat. Doklady 10, 1508–1511 (1969)
Bertrand, G.: New notions for discrete topology. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 218–228. Springer, Heidelberg (1999)
Bertrand, G., Couprie, M.: A model for digital topology. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 229–241. Springer, Heidelberg (1999)
Evako, A.V., Kopperman, R., Mukhin, Y.V.: Dimensional properties of graphs and digital spaces. Jour. of Math. Imaging and Vision 6, 109–119 (1996)
Kopperman, R.: The khalimsky line as a foundation for digital topology. In: Shape in Pictures. NASO ASI Series F, vol. 126, pp. 3–20 (1994)
Lickorish, W.: Simplicial moves on complexes and manifolds. Geometry And Topology Monograph, Proccedings of the KirbyFest 2, 229–320 (1998)
Daragon, X., Couprie, M., Bertrand, G.: Discrete surfaces and frontier orders (in preparation)
Hudson, J.: Piecewise Linear Topology. W.A. Benjamin Inc. (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daragon, X., Couprie, M., Bertrand, G. (2003). Discrete Frontiers. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2003. Lecture Notes in Computer Science, vol 2886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39966-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-39966-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20499-2
Online ISBN: 978-3-540-39966-7
eBook Packages: Springer Book Archive