Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices

Details Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices

2002-11-21

arxiv.org/abs/math/0211344v1

Mathematics

Optimization and Control

4 figures

Scientific paper

We provide an algebraic framework to compute smallest enclosing and smallest circumscribing cylinders of simplices in Euclidean space $\E^n$. Explicitly, the computation of a smallest enclosing cylinder in $\mathbb{E}^3$ is reduced to the computation of a smallest circumscribing cylinder. We improve existing polynomial formulations to compute the locally extreme circumscribing cylinders in $\E^3$ and exhibit subclasses of simplices where the algebraic degrees can be further reduced. Moreover, we generalize these efficient formulations to the $n$-dimensional case and provide bounds on the number of local extrema. Using elementary invariant theory, we prove structural results on the direction vectors of any locally extreme circumscribing cylinder for regular simplices.

Affiliated with

Also associated with

No associations

Rating

Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190094