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, David Pokrajac

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)263-272
Number of pages10
JournalApplied Mathematics and Computation
Volume252
DOIs
Publication statusPublished - 2015 Feb 1
Externally publishedYes

Subject classification (UKÄ)

  • Computer Sciences
  • Mathematical Sciences

Free keywords

  • C -surface
  • Medical image simulation
  • Octree
  • Recursive partitioning

Fingerprint

Dive into the research topics of 'Asymptotic number of Z3Δ cells covering C(1) surface on uniform grid and complexity of recursive-partitioning simulation of septal tissue regions'. Together they form a unique fingerprint.

Cite this