Skip to Main content Skip to Navigation
Journal articles

Combinatorial boundary of a 3D lattice point set

Abstract : Boundary extraction and surface generation are important topological topics for three-dimensional digital image analysis. However, there is no adequate theory to establish relations between these different topological procedures in a completely discrete way. In this paper, we present a new boundary extraction algorithm which gives not only a set of border points but also a polyhedral surface whose vertices are border points by using the concepts of combinatorial/algebraic topologies. We show that our boundary can be considered to be a triangulation or polyhedrization of border points in the sense of general topology, that is, we clarify relations between border points and the triangulated surface.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00622083
Contributor : Yukiko Kenmochi <>
Submitted on : Wednesday, February 20, 2013 - 4:47:34 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Tuesday, May 21, 2013 - 9:20:35 AM

File

kenmochi05Combinatorial.pdf
Files produced by the author(s)

Identifiers

Citation

Yukiko Kenmochi, Atsushi Imiya. Combinatorial boundary of a 3D lattice point set. Journal of Visual Communication and Image Representation, Elsevier, 2006, 17 (4), pp.738-766. ⟨10.1016/j.jvcir.2005.11.001⟩. ⟨hal-00622083⟩

Share

Metrics

Record views

322

Files downloads

419