How Can Biomechanical Multibody Models of Scoliosis Be Accurate in Simulating Spine Movement Behavior While Neglecting the Changes of Spinal Length?

Author(s):  
Athena Jalalian ◽  
Soheil Arastehfar ◽  
Ian Gibson ◽  
Francis E. H. Tay ◽  
Gabriel Liu

Abstract This paper studies how biomechanical multibody models of scoliosis can neglect the changes of spinal length and yet be accurate in reconstructing spinal columns. As these models with fixed length comprise rigid links interconnected by rotary joints, they resemble polygonal chains that approximate spine curves with a finite number of line segments. In mathematics, using more segments with shorter length can result in more accurate curve approximations. This raises the question of whether more accurate spine curve approximations by increasing the number of links/joints can yield more accurate spinal column reconstructions. For this, the accuracy of spine curve approximation was improved consistently by increasing the number of links/joints, and its effects on the accuracy of spinal column reconstruction were assessed. Positive correlation was found between the accuracy of spine reconstruction and curve approximation. It was shown that while increasing the accuracy of curve approximations, the representation of scoliosis concavity and its side-to-side deviations were improved. Moreover, reconstruction errors of the spine regions separated by the inflection vertebrae had minimal impacts on each other. Overall, multibody scoliosis models with fixed spinal length can benefit from the extra rotational joints that contribute towards the accuracy of spine curve approximation. The outcome of this study leads to concurrent accuracy improvement and simplification of multibody models; joint-link configurations can be independently defined for the regions separated by the inflection vertebrae, enabling local optimization of the models for higher accuracy without unnecessary added complexity to the whole model.

2004 ◽  
Vol 13 (04) ◽  
pp. 479-514 ◽  
Author(s):  
THOMAS J. CLARK ◽  
GERARD A. VENEMA

A polygonal chain is the union of a finite number of straight line segments in ℝ3 that are connected end-to-end. Two chains are considered to be equivalent if there is an isotopy of ℝ3 that moves one chain to the other while keeping the segments rigid. Each segment must remain straight during the isotopy and the lengths of the segments may not change, but bending and twisting are allowed at the joints between the segments. Chains may be knotted and stuck in this category even though all chains are topologically trivial. Cantarella and Johnston have classified polygonal chains with five or fewer segments. In this paper we classify polygonal chains of six segments.


1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK

We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.


Author(s):  
W.S. CHAN ◽  
F. CHIN

We improve the time complexities for solving the polygonal curve approximation problems formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n vertices with minimum number of line segments can be improved from O(n2 log n) to O(n2). The time complexity for approximating any polygonal curve with minimum error can also be improved from O(n2 log 2n) to O(n2 log n). We further show that if the curve to be approximated forms part of a convex polygon, the two problems can be solved in O(n) and O(n2) time respectively for both open and closed polygonal curves.


2001 ◽  
Vol 11 (02) ◽  
pp. 167-179 ◽  
Author(s):  
SUNG KWON KIM ◽  
CHAN-SU SHIN ◽  
TAE-CHEON YANG

A rectilinear map consists of a set of mutually non-intersecting rectilinear (i.e., horizontal or vertical) line segments, and each segment is allowed to use a rectangular label of height B and length the same as the segment. Sliding labels are not restricted to any finite number of predefined positions but can slide and be placed at any position as long as it intersects the segment. This paper considers three versions of the problem of labeling a rectilinear map with sliding labels and presents efficient exact and approximation algorithms for them.


Author(s):  
R. A. Crowther

The reconstruction of a three-dimensional image of a specimen from a set of electron micrographs reduces, under certain assumptions about the imaging process in the microscope, to the mathematical problem of reconstructing a density distribution from a set of its plane projections.In the absence of noise we can formulate a purely geometrical criterion, which, for a general object, fixes the resolution attainable from a given finite number of views in terms of the size of the object. For simplicity we take the ideal case of projections collected by a series of m equally spaced tilts about a single axis.


2009 ◽  
Author(s):  
Polina M. Vanyukov ◽  
Erik D. Reichle ◽  
Tessa Warren

2009 ◽  
Author(s):  
Robert G. Cook ◽  
Carl Erick Hagmann
Keyword(s):  

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.


Sign in / Sign up

Export Citation Format

Share Document