The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Portrait of Predrag Bakic. Photo

Predrag Bakic

Associate Professor

Portrait of Predrag Bakic. Photo

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

Author

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

Summary, in English

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.

Publishing year

2015-02-01

Language

English

Pages

263-272

Publication/Series

Applied Mathematics and Computation

Volume

252

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Science
  • Mathematics

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0096-3003