Robust, Generic, and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Space
![]() |
The minimization diagram of two triangulated surfaces with approximately 16,000 triangles. The triangulated surfaces input files were taken from here. |
---|
Abstract
Lower envelopes are fundamental structures in computational geometry that have many applications, such as computing general Voronoi diagrams and performing hidden surface removal in computer graphics. We present a generic, robust and efficient implementation for computing the envelopes of surfaces in
Links
- Michal Meyerovitch
Robust, Generic, and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Space
In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 792-803, Zurich, Switzerland, 2006 [link] [bibtex] - Michal Meyerovitch
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional space
M.Sc. thesis [pdf] [bibtex] - The code is available as a part of CGAL. The documentation of the package can be found in this link.
- Some input sets (for triangles and spheres)
Contact
Michal Meyerovitch | ![]() |
![]() |