Skip to content

In this paper, we propose a method for computing two-dimensional minimal directed bounding boxes based on convex hull and minimum rectangle algorithms, and show how to implement this algorithm by code.

Notifications You must be signed in to change notification settings

zhangwanyao/min_bounding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Key steps

Convex Hull computation:

The qhull2D method is used to compute the convex hull of the input point set. This step ensures that we find the outer boundary of the point set as a candidate boundary for the minimum rectangle.

Minimum Rectangle calculation:

The minBoundingRect algorithm is used to calculate the minimum directed bounding box. The algorithm returns the width, height, corner coordinates, and area of the rectangle.

Displaying the results

img.png img_1.png img_2.png

About

In this paper, we propose a method for computing two-dimensional minimal directed bounding boxes based on convex hull and minimum rectangle algorithms, and show how to implement this algorithm by code.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages