Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

Any fast and robust implementation to calculate the minimum bounding box of a 3d point cloud?

Tags:

algorithm

math

implementation

3d

bounding-box

I have been looking online but have yet to see a fast and robust implementation, rather than crude implementations on forums.

Anyone knows of one?

like image 653
Joan Venge Avatar asked Nov 14 '22 04:11

Joan Venge

1 Answers

There's a description of a 3D OBB algorithm on Wikipedia.

like image 106
Keith Randall Avatar answered Apr 26 '23 02:04

Keith Randall
Sign in to Comment

Related questions

Time analysis of a Binary Search Tree in-order traversal algorithm
Removing elements in a functional style
finding the biggest difference between sorted array values
Algorithm and Data Structure for Checking letters in a word with another set of letters
Finding number of permutations of 'p' numbers that sum to a given number 'n'
Setting up an asymmetric frustum
How does this enqueue function work?
confusion about dijkstra algorithm?
Techniques to deal with "not all code paths return a value" when your algorithm already takes care of it [closed]
SQLite query less than or greater than check
How to calculate average time
How Math.Pow (and so on) actually works
algorithm to detect time, date and place from invitation text [closed]
Star printing in C the hard way
Point in polygon algorithm for SQL Server
how can a breadth-first-search-tree include a cross-edge?
Check if a string is a shuffle of two other given strings
How to Compress a String using Recursion? (RLE algorithm)
Insert a list into another list, without brackets and by replacing the current item in that index
Why is <algorithm> not needed for std::copy or std::swap?

Donate For Us

If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!