Progressive Convex Hull Simplification
Computer Graphics Forum · 13.08.2026
DOI: 10.1111/cgf.70518 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Graphics Forum, online erschienen am 13.08.2026. Verfasst von Alec Jacobson. Die Arbeit nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Canada Research Chairs, Adobe.
Abstract (Originalsprache)
Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces while minimizing added volume or surface area. By working in the dual representation, we propose an efficient O(n log n) greedy optimization. In comparisons, we show that existing methods either exhibit poor efficiency, tightness or safety. We demonstrate the success of our method on a variety of input shapes and downstream application domains.
Förderung
- Canada Research Chairs
- Adobe
Zitieren
APA
Jacobson, A. (2026). Progressive Convex Hull Simplification. Computer Graphics Forum. https://doi.org/10.1111/cgf.70518
Vancouver
Jacobson A. Progressive Convex Hull Simplification. Computer Graphics Forum. 2026. doi:10.1111/cgf.70518
BibTeX
@article{Jacobson2026,
author = {Jacobson, Alec},
title = {Progressive Convex Hull Simplification},
journal = {Computer Graphics Forum},
year = {2026},
doi = {10.1111/cgf.70518}
}
EUVIMED