Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barequet, Gill, Har-Peled, Sariel
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)

A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)

Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)

Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)

An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)

Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)

How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)

The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)

Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)

Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)

Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)

How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)

The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)

Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)

New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)

No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)

Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)

Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)

On Minimum CADs for Algebraic Sets in Dimension Three
by: Michel, Lucas
Published: (2026)

Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)

Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)

Optimal Volume-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)

Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
by: Agarwal, Pankaj K., et al.
Published: (2026)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

Minimum Membership Geometric Set Cover in the Continuous Setting
by: Govindarajan, Sathish, et al.
Published: (2025)

Space-Efficient Approximate Spherical Range Counting in High Dimensions
by: Kalavas, Andreas, et al.
Published: (2026)

Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Faster Motion Planning via Restarts
by: Amato, Nancy, et al.
Published: (2025)

Efficient Many-To-Many Matching of Points with Demands in One Dimension
by: Rajabi-Alni, Fatemeh, et al.
Published: (2019)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
by: Guitouni, Mariem, et al.
Published: (2025)