Computing the Width of a Three-Dimensional Point Set: An Experimental Study
1999-02-09
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Computing the Width of a Three-Dimensional Point Set: An Experimental Study
Published Date
1999-02-09
Publisher
Type
Report
Abstract
We describe a robust, exact, and efficient implementation of an algorithm that computes the width of a three-dimensional point set. The algorithm is based on efficient solutions to problems that are at the heart of computational geometry: three-dimensional convex hulls, point location in planar graphs, and computing intersections between line segments. The latter two problems have to be solved for planar graphs and segments on the unit sphere, rather than in the two-dimensional plane. The implementation is based on LEDA, and the geometric objects are represented using exact rational arithmetic.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Schwerdt, Jörg; Smid, Michiel; Majhi, Jayanth; Janardan, Ravi. (1999). Computing the Width of a Three-Dimensional Point Set: An Experimental Study. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215394.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.