Progressive Convex Hull Simplification

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Jacobson, Alec
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913037024231424
author Jacobson, Alec
author_facet Jacobson, Alec
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_14468
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Progressive Convex Hull Simplification
Jacobson, Alec
Graphics
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.
title Progressive Convex Hull Simplification
topic Graphics
url https://arxiv.org/abs/2604.14468