dc.contributor.author |
Barléon, N |
en |
dc.contributor.author |
Clarke, Richard |
en |
dc.contributor.author |
Ho, Harvey |
en |
dc.date.accessioned |
2019-03-08T03:47:28Z |
en |
dc.date.issued |
2018-11-06 |
en |
dc.identifier.issn |
1025-5842 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/45876 |
en |
dc.description.abstract |
One challenge for hepatic flow simulation is to divide the hepatic vasculature into individual Couinaud segments, and to simulate flow at both segmental and organ levels. We propose to integrate a segment simulation algorithm with the flow solver in a Constructive Constraint Optimisation (CCO) algorithm to address this problem. In this way blood flow simulations can be conducted for large segment-specific vasculatures as relevant to surgical procedures. In this short communication we outline the methods and present some preliminary results. |
en |
dc.publisher |
Taylor & Francis |
en |
dc.relation.ispartofseries |
Computer Methods in Biomechanics and Biomedical Engineering |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Novel methods for segment-specific blood flow simulation for the liver |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1080/10255842.2018.1520224 |
en |
pubs.issue |
15 |
en |
pubs.begin-page |
780 |
en |
pubs.volume |
21 |
en |
dc.rights.holder |
Copyright: The author |
en |
pubs.end-page |
783 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Article |
en |
pubs.elements-id |
755804 |
en |
pubs.org-id |
Bioengineering Institute |
en |
pubs.org-id |
ABI Associates |
en |
pubs.org-id |
Engineering |
en |
pubs.org-id |
Engineering Admin |
en |
pubs.record-created-at-source-date |
2018-11-07 |
en |
pubs.dimensions-id |
30398063 |
en |