Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

DOI10.1006/JAGM.2000.1127zbMath0969.68166DBLPjournals/jal/BarequetH01OpenAlexW2079872371WikidataQ30051339 ScholiaQ30051339MaRDI QIDQ2709794

Gill Barequet, Sariel Har-Peled

Publication date: 17 April 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1127

zbMATH Keywords

approximation bounding box

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (27)

Mixed boundary conditions for FFT-based homogenization at finite strains ⋮ Dynamic coresets ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ How to get close to the median shape ⋮ Streaming and dynamic algorithms for minimum enclosing balls in high dimensions ⋮ Tree drawings revisited ⋮ Approximate Polytope Membership Queries ⋮ Unnamed Item ⋮ Rank-two update algorithms for the minimum volume enclosing ellipsoid problem ⋮ An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions ⋮ On finding a large number of 3D points with a small diameter ⋮ Size functions for comparing 3D models ⋮ Approximating the maximum overlap of polygons under translation ⋮ An almost space-optimal streaming algorithm for coresets in fixed dimensions ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ On the reverse Loomis-Whitney inequality ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Unnamed Item ⋮ GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS ⋮ Robust shape fitting via peeling and grating coresets ⋮ Verification of approximate opacity for switched systems: a compositional approach ⋮ Bounds on the quality of the PCA bounding boxes ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ Stochastic iterative dynamic programming: a Monte Carlo approach to dual control ⋮ Multi-layer Ontologies for Integrated 3D Shape Segmentation and Annotation ⋮ Segmentation of Collagen Fiber Bundles in 3D by Waterfall on Orientations ⋮ Minimum-volume enclosing ellipsoids and core sets

This page was built for publication: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions