Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations

DOI10.1007/978-3-540-85521-7_3zbMath1165.68374OpenAlexW1835887198MaRDI QIDQ5302764

Eva Dyllong

Publication date: 13 January 2009

Published in: Reliable Implementation of Real Number Algorithms: Theory and Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85521-7_3

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Data structures (68P05) Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• Verified convex hull and distance computation for octree-encoded objects
• Using interval arithmetic for determining the structure of convex hulls
• Sign test of multivariable real polynomials
• The quickhull algorithm for convex hulls
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations