Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

The Convex Hull of Ellipsoids (Video)


Geismann,  Nicola
Max Planck Society;


Hemmer,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;


Schömer,  Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Geismann, N., Hemmer, M., & Schömer, E. (2001). The Convex Hull of Ellipsoids (Video). In Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01) (pp. 321-322). New York: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-31C5-0
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the convex hull of a set of ellipsoids. The underlying algorithm is an application of our work on determining a cell in a 3-dimensional arrangement of quadrics, see \cite{ghs-ccaq-01}. In the video, the main emphasis is on a simple and comprehensible visualization of the geometric aspects of the algorithm. In addition, we give some insights into the underlying mathematical problems.