Verified convex hull and distance computation for octree-encoded objects

DOI10.1016/j.cam.2005.08.043zbMath1108.65013OpenAlexW1981304422MaRDI QIDQ861901

Eva Dyllong, Wolfram J. Luther

Publication date: 2 February 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.08.043

zbMATH Keywords

numerical examplesconvex polyhedramoving objectsinterval algorithmsoctreesreliable geometry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Interval and finite arithmetic (65G30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Algorithms with automatic result verification (65G20)

Related Items (1)

Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations

Uses Software

• Qhull

Cites Work

• Unnamed Item
• An Accurate Distance Algorithm for Octree-Encoded Objects
• The quickhull algorithm for convex hulls
• Numerical Software with Result Verification

This page was built for publication: Verified convex hull and distance computation for octree-encoded objects