Modeling and optimization of correction measures for human extremities

Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry 2004-2007

Volumn , Issue , 2008, Pages 131-148

  Brandenberg, Rene ^a   Gerken, Tobias ^a   Gritzmann, Peter ^a   Roth, Lucia ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79956072161     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-77203-3_10     Document Type: Chapter

References (52)

1. P.K. Agarwal, B. Aronov, and M.Sharir. Line transversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:473-388, 1999.
2. P.K. Agarwal, C.M. Procopiuc, and K.R. Varadarajan. A (1 + ε)-approximation algorithm for 2-line-center. Comput. Geom. Theory Appl., 26(2):119-128, 2003.
3. P.K. Agarwal, C.M. Procopiuc, and K.R. Varadarajan. Approximation algorithms for a k-line center. Algorithmica, 42:221-230, 2005.
4. N. Amenta. K-transversals of parallel convex sets. In Proc. 8th Canadian Conf. Comput. Geom., pages 80-86, 1996.
5. I.N. Bankman, editor. Handbook of Medical Imaging: Processing and Analysis. Academic Press, Inc., Orlando, FL, USA, 2000.
6. R. Baumgart, P. Thaller, S. Hinterwimmer, M. Krammer, T. Hierl, and W. Mutschler. A fully implantable, programmable distraction nail (fitbone) - new perspectives for corrective and reconstructive limb surgery. In K.S. Leung, G. Taglang, and R. Schnettler, editors, Practice of Intramedullary Locked Nails. New developments in Techniques and Applications, pages 189-198. Springer Verlag Heidelberg, New York, 2006.
7. S. Bespamyatnikh and D. Kirkpatrick. Rectilinear 2-center problems. In Proc. 11th Canadian Conf. Comput. Geom., pages 68-71, 1999.
8. C. Borcea, X. Goaoc, and S. Petitjean. Line transversals to disjoint balls. To appear in Discrete Comput. Geom.
9. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear matrix inequalities in system and control theory, volume 15 of SIAM studies in applied mathematics. SIAM, Philadelphia, 1994.
10. R. Brandenberg and L. Roth. k-Containment. Manuscript.
11. R. Brandenberg and L. Roth. Minimal Containment under Homothetics - Solution Methods in Practice. Manuscript.
12. R. Brandenberg and T. Theobald. Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices. Appl. Algebra Eng. Commun. Comput., 14(6):439-460, 2004.
13. H. Brönnimann, H. Everett, S. Lazard, F. Sottile, and S. Whitesides. Transversals to line segments in R3. Discrete. Comput. Geom., 34(3):381-390, 2005.
14. M. B̌adoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. 34th Annu. ACM Sympos. Theory of Computing, pages 250-257. ACM Press, 2002.
15. T.M. Chan. More planar two-center algorithms. Comput. Geom., 13(3):189-198, 1999.
16. T.M. Chan. Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. In Proc. 16th Annu. Sympos. Comput. Geom., pages 300-309, 2000.
17. B.C. Eaves and R.M. Freund. Optimal scaling of balls and polyhedra. Math. Prog., 23:138-147, 1981.
18. D. Eppstein. Faster construction of planar two-centers. In Proc. 8th Symp. Discrete Algorithms, pages 131-138. ACM and SIAM, January 1997.
19. U. Faigle, W. Kern, and M. Streng. Note on the computational complexity of j-radii of polytopes in Rn. Math. Prog., 73(1):1-5, 1996.
20. K. Fischer, B. G̈artner, and M. Kutz. Fast smallest-enclosing-ball computation in high dimensions. In Proc. 11th Annu. European Symp. Algorithms, pages 630-641, 2003.
21. F. Follert. Maxmin location of an anchored ray in 3-space and related problems. In Proc. 7th Canadian Conf. Comp. Geom., pages 7-12, 1995.
22. T. Gerken. On the Double-Ray Center Problem in 3-Space with an Application to Surgical Operation Planning. Diplomarbeit, Zentrum Mathematik, TU München, 2003.
23. A. Glozman, K. Kedem, and G. Shpitalnik. Computing a double-ray center for a planar point set. J. Comput. Geom., 9(2):103-123, 1999.
24. P. Gritzmann and V. Klee. Inner and outer j-radii of convex bodies in finitedimensional normed spaces. Discrete Comput. Geom., 7:255-280, 1992.
25. P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program., 59:163-213, 1993.
26. P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity I: Containment problems. Discrete Math., 136:129-174, 1994.
27. P. Gritzmann and T. Theobald. On algorithmic stabbing problems for polytopes. Manuscript.
28. P. Gritzmann and T. Theobald. On the computational complexity of visibility problems with moving viewpoints. In J.E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, volume 52 of MSRI Publications, pages 377-397. Cambridge University Press, 2005.
29. L. Gürke, W. Strecker, and S. Martinoli. Korrektur mehrdimensionaler Deformationen durch eine einzige Osteotomie: Graphische Analyse und Operationstechnik. Der Unfallchirurg, 102:684-690, 1999.
30. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. Symp. Comput. Geom., pages 312-318. ACM Press, 2002.
31. S. Har-Peled and K.R. Varadarajan. High-dimensional shape fitting in linear time. Discrete Comput. Geom., 32:269-288, 2004.
32. D. Häublein. Entwicklung von Planungssoftware für die Extremitätenchirurgie. Diplomarbeit, Fakultät für Informatik, TU München, 2007.
33. G. Ilizarov. Clinical application of the tension-stress effect for limb lengthening. Cli. Orthop., 250:8-26, 1990.
34. G. Ilizarov. Transosseous osteosynthesis: Theoretical and clinical aspects of the regeneration and growth of tissue. Springer Verlag, Berlin, Heidelberg, New York, 1992.
35. M. Katchalski. Thin sets and common transversals. J. Geometry, 14(2):103-107, 1980.
36. P. Kumar. Clustering and reconstructing large data sets. PhD thesis, Department of Computer Science, Stony Brook University, 2004.
37. P. Kumar, J.S.B. Mitchell, and E.A. Yildirim. Approximate minimum enclosing balls in high dimensions using core-sets. J. Exp. Algorithmics, 8, 2003.
38. Limb Lengthening Center Munich (ZEM), www.beinverlaengerung.de.
39. J. Maintz and M. Viergever. A survey of medical image registration. Medical Image Analysis, 2(1):1-36, 1998.
40. N. Megiddo. On the complexity of some geometric problems in unbounded dimension. J. Symbolic Comp., 10:327-334, 1990.
41. N. Megiddo and K.J. Supowit. On the complexity of some common geometric location problems. Siam J. Comput., 10:182-196, 1990.
42. N. Megiddo and A. Tamir. On the complexity of locating linear facilities in the plane. Oper. Res. Lett., 1:194-197, 1982.
43. Mercury Computer Systems, Inc., www.mc.com.
44. D. Paley. Principles of Deformity Correction. Springer, 2002.
45. S. Rittsteiger. Shape Fitting Algorithmen-Theorie, Implementation und Anwendung in der chirurgischen Operationsplanung. Diplomarbeit, Zentrum Mathematik, TU München, 2006.
46. L. Roth. Exakte und ε-approximative Algorithmen zur Umkugelberechnung. Diplomarbeit, Zentrum Mathematik, TU München, 2005.
47. J.C. Russ. The Image Processing Handbook. CRC Press, 5th edition, 2006.
48. E. Schömer, J. Sellen, M. Teichmann, and C.-K. Yap. Smallest enclosing cylinders. Algorithmica, 27:170-186, 2000.
49. The MathWorks, www.mathworks.com.
50. K.R. Varadarajan, S. Venkatesh, Y. Ye, and J. Zhang. Approximating the radii of point sets. SIAM J. Comput., 36(6):1764-1776, 2007. Preliminary versions in Proc. 43th IEEE Symp. Foundations of Computing, IEEE Comp. Soc., 2002, 561-569 and in APPROX 2003 + RANDOM 2003, LNCS, vol. 2764, Springer- Verlag, 2003, 178-187.
51. H. Yu, P.K. Agarwal, R. Poreddy, and K.R. Varadarajan. Practical methods for shape fitting and kinetic data structures using core sets. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 263-272, 2004.
52. G.L. Zhou, K.C. Toh, and J. Sun. Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl., 30(2):147-160, 2005.