About the algebraic solutions of smallest enclosing cylinders problems

Applicable Algebra in Engineering, Communications and Computing

Volumn 23, Issue 3-4, 2012, Pages 151-164

  Petitjean, Michel ^a  

^a INSERM   (France)

Author keywords

Best fitting cylinder; Circumscribed cylinder through five points; Minimal cylinder; Numerical algorithm; Smallest enclosing cylinder

Indexed keywords

ALGEBRAIC ALGORITHMS; ALGEBRAIC SOLUTION; ANALYTICAL CONDITIONS; CIRCUMSCRIBED CYLINDER THROUGH FIVE POINTS; CONSTRAINED MINIMIZATION; EUCLIDEAN SPACES; NUMERICAL ALGORITHMS; REGULAR TETRAHEDRON; SYMMETRY AXIS; TRIGONAL BIPYRAMIDS;

ALGEBRA; ALGORITHMS; GEOMETRY;

CYLINDERS (SHAPES);

EID: 84870879606     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-012-0171-y     Document Type: Article

References (15)

1. Bottema, O., Veldkamp, G.R.: On the lines in space with equal distances to n given points. Geom. Dedic. 6, 121-129 (1977)
2. Brandenberg, R., Theobald, T.: Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices. Appl. Algebra Eng. Commun. Comput. 14, 439-460 (2004)
3. Brandenberg, R., Theobald, T.: Radii minimal projections of polytopes and constrained optimization of symmetric polynomials. Adv. Geom. 6, 71-83 (2006) (Pubitemid 43742362)
4. Devillers, O., Mourrain, B., Preparata, F.P., Trebuchet, P.: Circular cylinders through four or five points in space. Discrete Comput. Geom. 29, 83-104 (2003) (Pubitemid 36820373)
5. Edelsbrunner, H.: Constructing convex hulls. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) Algorithms in Combinatorial Geometry, Chap. 8, pp. 139-176. Springer, Berlin (1987)
6. Eigenwillig, A., Kettner, L., Krandick, W., Mehlhorn, K., Schmitt, S., Wolpert, N.: A Descartes algorithm for polynomials with bit-stream coefficients. In: Computer Algebra in Scientific Computing: 8th International Workshop, CASC 2005, Kalamata, Greece, LNCS, 3718, 138-149 (2005) (Pubitemid 43848535)
7. Gill, P.E., Murray, W., Wright, M.H.: Non linear constraints. In: Practical Optimization, pp. 205-260. JAI Press, Emerald Group Publishing Ltd., London, 2008
8. Maehara, H.: On congruent embeddings of a tetrahedron into a circular cylinder. Yokohama Math. J. 55, 171-177 (2010)
9. Meslamani, J.E., André, F., Petitjean, M.: Assessing the geometric diversity of cytochrome P450 ligand conformers by hierarchical clustering with a stop criterion. J. Chem. Inf. Model. 49, 330-337 (2009)
10. Petitjean, M.: Solving the geometric docking problem for planar and spatial sets. Internet Electron. J. Mol. Des. 1, 185-192 (2002)
11. Petitjean, M.: From shape similarity to shape complementarity: toward a docking theory. J. Math. Chem. 35, 147-158 (2004) (Pubitemid 38918909)
12. Preparata, F.P., Shamos, M.I.: Convex hulls: basic algorithms. In: Computational Geometry, Chap. 3, pp. 95-149. Springer, Berlin (1985)
13. Schömer, E., Sellen, J., Teichmann, M., Yap, C.: Smallest enclosing cylinders. Algorithmica 27, 170-186 (2000)
14. Theobald, T.: Visibility computations: from discrete algorithms to real algebraic geometry. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 60, 207-219 (2003)
15. n. Numer. Alg. 43, 189-196 (2006)