Asymptotic number of Z3Δ cells covering C(1) surface on uniform grid and complexity of recursive-partitioning simulation of septal tissue regions

Marko D. Petković, Predrag R. Bakic, Andrew D.A. Maidment and David Pokrajac

Applied Mathematics and Computation, 2015, vol. 252, issue C, 263-272

Abstract: The exact asymptotic computational complexity for a problem of indexing cells on a uniform grid intersecting with a union of C(1) surfaces has been proven. The computational complexity of the recursive partition indexing algorithm, utilized for simulation of septated tissues, is derived and the algorithm is demonstrated as being asymptotically optimal.

Keywords: Octree; C(1)-surface; Recursive partitioning; Medical image simulation (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314016440
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:252:y:2015:i:c:p:263-272

DOI: 10.1016/j.amc.2014.11.111

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().