Skip to content

Latest commit

 

History

History
30 lines (23 loc) · 1.23 KB

README.md

File metadata and controls

30 lines (23 loc) · 1.23 KB

< Previous                  Next >

Related Topics

[Geometry] [Array] [Math]

Hints

Hint 1 First, we need to note that this is a classic problem given n points you need to find the minimum enclosing circle to bind them
Hint 2 Second, we need to apply a well known algorithm called welzls algorithm to help us find the minimum enclosing circle