scientific article; zbMATH DE number 1305395

zbMATH Open0929.65033MaRDI QIDQ4252276FDOQ4252276

Authors: Gill Barequet, Sariel Har-Peled 

Publication date: 2 February 2000

Title of this publication is not available (Why is that?)

Recommendations

• Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• Finding minimal enclosing boxes
• scientific article; zbMATH DE number 1445342
• Algorithm for finding minimum volume oriented bounding boxes based on convex hull

zbMATH Keywords

algorithmminimum-volume bounding box

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cited In (9)

• Algorithm for finding minimum volume oriented bounding boxes based on convex hull
• Facility location and the geometric minimum-diameter spanning tree.
• Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• Finding minimal enclosing boxes
• Hierarchical spatial relation based on a contiguity graph
• Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
• Optimal bounding cones of vectors in three dimensions
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252276)