This is the implementation accompanying my blog post on computing oriented minimum bounding boxes (OMBBs) in two dimensions (visit http://geidav.wordpress.com). The code implements the Rotating Calipers algorithm to compute OMBBs based on a convex hull. The Gift Wrapping algorithm is used for computing the convex hull. The code is written in Javascript and should run in any HTML5 compatible browser.
-
Notifications
You must be signed in to change notification settings - Fork 15
Computing oriented minimum bounding boxes using Rotating Calipers
License
geidav/ombb-rotating-calipers
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Computing oriented minimum bounding boxes using Rotating Calipers
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published