IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v22y2019i14p1126-1134.html
   My bibliography  Save this article

An upper bound computational model for investigation of fusion effects on adjacent segment biomechanics of the lumbar spine

Author

Listed:
  • Chaochao Zhou
  • Thomas Cha
  • Guoan Li

Abstract

Prediction of the biomechanical effects of fusion surgery on adjacent segments is a challenge in computational biomechanics of the spine. In this study, a two-segment L3-L4-L5 computational model was developed to simulate the effects of spinal fusion on adjacent segment biomechanical responses under a follower load condition. The interaction between the degenerative segment (L4-5) and the adjacent segment (L3-4) was simulated using an equivalent follower spring. The spring stiffness was calibrated using a rigid fusion of a completely degenerated disc model at the L4-5 level, resulting in an upper bound response at the adjacent (L3-4) segment. The obtained upper bound equivalent follower spring was used to simulate the upper bound biomechanical responses of fusion of the disc with different degeneration grades. It was predicted that as the disc degeneration grade at the degenerative segment decreased, the effect on the adjacent segment responses decreased accordingly after fusion. The data indicated that the upper bound computational model can be a useful computational tool for evaluation of the interaction between segments and for investigation of the biomechanical mechanisms of adjacent segment degeneration after fusion.

Suggested Citation

  • Chaochao Zhou & Thomas Cha & Guoan Li, 2019. "An upper bound computational model for investigation of fusion effects on adjacent segment biomechanics of the lumbar spine," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 22(14), pages 1126-1134, October.
  • Handle: RePEc:taf:gcmbxx:v:22:y:2019:i:14:p:1126-1134
    DOI: 10.1080/10255842.2019.1639047
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10255842.2019.1639047
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/10255842.2019.1639047?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:gcmbxx:v:22:y:2019:i:14:p:1126-1134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gcmb .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.