by Li, F and Klette, R
Abstract:
This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given. © 2008 Springer-Verlag Berlin Heidelberg.
Reference:
Calculating the number of tunnels (Li, F and Klette, R), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 5197 LNCS, 2008.
Bibtex Entry:
@inproceedings{li2008calculatingtunnels,
author = "Li, F and Klette, R",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "421--428",
title = "Calculating the number of tunnels",
volume = "5197 LNCS",
year = "2008",
abstract = "This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given. © 2008 Springer-Verlag Berlin Heidelberg.",
doi = "10.1007/978-3-540-85920-8_52",
isbn = "3540859195",
isbn = "9783540859192",
issn = "0302-9743",
eissn = "1611-3349",
keyword = "3D grid",
keyword = "Digital topology",
keyword = "Number of tunnels",
language = "eng",
}