Article ID Journal Published Year Pages File Type
4627145 Applied Mathematics and Computation 2015 10 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, , , ,