[FEATURE REQUEST] Add few best and efficient algorithms in geometry in Java

[sandeepgoudmacha]

What would you like to Propose?

some of the best and unique geometry algorithms that you can implement under src/main/java/com/thealgorithms/geometry/ - each is elegant, mathematically rich, and practical in computational geometry:

1.Rotating Calipers Algorithm 2.Line Segment Intersection 3.Closest Pair of Points (Divide & Conquer) 4.Voronoi Diagram / Delaunay Triangulation 5.Gift Wrapping (Jarvis March)

Issue details

Add some of the best and unique geometry algorithms that you can implement under src/main/java/com/thealgorithms/geometry/ - each is elegant, mathematically rich, and practical in computational geometry

Additional Information

No response

[arorasneha08]

I want to work on this problem . It's my first hacktoberfest . Could you please assign this to me ?

[Aspirant200715]

Hi sir, as per your contribution guidelines, I have directly made a pull request to this issue and will also attach it here. PLs, take your time to review my code on geometry algorithms before merging them to your main branch. Although I described my problems very well in the pull request, I will also provide a brief overview here.

Implemented 5 core computational geometry algorithms in Java: Rotating Calipers (O(n) diameter), Line Intersection (O(1)), Closest Pair (O(n log n)), Delaunay Triangulation, and Gift Wrapping Convex Hull (O(nh)). Each includes complete working code, line-by-line comments, dry runs, and production-ready optimizations.