Development of the Korean Spine Database and Automatic Surface Mesh Intersection Algorithm for Constructing <i>e</i>-Spine Simulator

<table>Remeshing algorithm. (a) <svg height="15.25" id="M87" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 17.275 15.25" width="17.275" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg> and <svg height="15.25" id="M88" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 17.275 15.25" width="17.275" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g>
</svg> with distance <svg height="12.4375" id="M89" style="vertical-align:-0.15048pt" version="1.1" viewbox="0 0 9.5625 12.4375" width="9.5625" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M530 686q-79 -330 -126 -595q-5 -24 4 -24q22 0 77 53l16 -24q-42 -49 -88 -78.5t-72 -29.5q-37 0 -19 83l21 99h-2q-62 -83 -153 -141q-65 -41 -97 -41q-28 0 -48 31.5t-20 91.5q0 71 32.5 144t88.5 118q36 30 94 52.5t94 22.5q38 0 68 -13l29 158q7 40 2 47.5t-38 7.5
h-35l1 26q39 4 76 13.5t58.5 17t27.5 7.5q16 0 9 -26zM387 375q-11 11 -38.5 20t-51.5 9q-45 0 -79 -23q-46 -32 -77.5 -107.5t-31.5 -143.5q0 -40 9.5 -58.5t23.5 -18.5q40 0 113.5 70t99.5 118z" id="x1D451"></path></g>
</svg> on the intersection curve. (b) New generated point <svg height="15.4" id="M90" style="vertical-align:-3.20526pt" version="1.1" viewbox="0 0 30.225 15.4" width="30.225" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g><g transform="matrix(.012,-0,0,-.012,16.848,15.187)"><path d="M535 230h-483v50h483v-50z" id="x2212"></path></g><g transform="matrix(.012,-0,0,-.012,23.833,15.187)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg> between <svg height="15.25" id="M91" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 17.275 15.25" width="17.275" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg> and <svg height="15.25" id="M92" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 17.275 15.25" width="17.275" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g>
</svg>.</table>

Journal of Applied Mathematics

fig11

Figure 11

Figure 11: Development of the Korean Spine Database and Automatic Surface Mesh Intersection Algorithm for Constructing <i>e</i>-Spine Simulator 

Journal of Applied Mathematics

Development of the Korean Spine Database and Automatic Surface Mesh Intersection Algorithm for Constructing e-Spine Simulator

Figure 11