Verified convex hull and distance computation for octree-encoded objects

DOI10.1016/J.CAM.2005.08.043zbMATH Open1108.65013OpenAlexW1981304422MaRDI QIDQ861901FDOQ861901

Authors: E. Dyllong, Wolfram 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

Recommendations

• An accurate distance algorithm for octree-encoded objects
• Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations
• scientific article; zbMATH DE number 2202078
• An accurate distance-calculation algorithm for convex polyhedra
• scientific article; zbMATH DE number 740451

zbMATH Keywords

numerical examplesconvex polyhedrainterval algorithmsmoving objectsoctreesreliable geometry

Mathematics Subject Classification ID

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

Cites Work

• The quickhull algorithm for convex hulls
• An accurate distance algorithm for octree-encoded objects
• Title not available (Why is that?)
• Numerical Software with Result Verification

Cited In (6)

• A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
• Title not available (Why is that?)
• Verified spatial subdivision of implicit objects using implicit linear interval estimations
• An accurate distance algorithm for octree-encoded objects
• Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations
• OCTREE DETECTION OF CLOSED COMPARTMENTS

Uses Software

• Qhull

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861901)