feat(geometry): Add Bentley-Ottmann algorithm for line segment intersection

[Microindole]

Description

This PR implements the Bentley-Ottmann sweep-line algorithm for efficiently finding all intersection points among a set of line segments in a 2D plane.

Changes

• Added BentleyOttmann.java with complete implementation
• Added BentleyOttmannTest.java with 19 comprehensive test cases
• Implemented O((n + k) log n) time complexity using sweep-line approach
• Handles edge cases: vertical/horizontal segments, collinear overlaps, touching endpoints
• Includes detailed Javadoc with algorithm explanation and usage examples

Algorithm Details

• Time Complexity: O((n + k) log n), where n = number of segments, k = number of intersections
• Space Complexity: O(n + k)
• Data Structures:
  • Event Queue: PriorityQueue<Event>
  • Status Structure: TreeSet<Segment> (balanced BST)

Test Coverage

• Single and multiple intersections
• Vertical and horizontal segments
• Parallel segments (no intersection)
• Coincident and overlapping collinear segments
• Grid patterns and star patterns
• Touching endpoints
• Performance test with 100 random segments
• Edge cases: empty list, single segment, null input

Example Usage

List segments = Arrays.asList(
    new Segment(new Point2D.Double(1, 1), new Point2D.Double(5, 5)),
    new Segment(new Point2D.Double(1, 5), new Point2D.Double(5, 1))
);
Set intersections = BentleyOttmann.findIntersections(segments);
// Returns: {(3.0, 3.0)}

Related Issue

Closes #6870

Checklist

• Code follows the project's style guidelines (clang-format applied)
• Self-review of code completed
• Code is well-commented with Javadoc
• Comprehensive unit tests added
• All tests pass locally
• No new warnings introduced
• Algorithm is not already implemented in the repository

[codecov-commenter]

Codecov Report

❌ Patch coverage is 81.48148% with 35 lines in your changes missing coverage. Please review.
✅ Project coverage is 78.20%. Comparing base (2521556) to head (5ed52a1).

Files with missing lines	Patch %	Lines
...ava/com/thealgorithms/geometry/BentleyOttmann.java	81.48%	24 Missing and 11 partials ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #6871      +/-   ##
============================================
+ Coverage     78.18%   78.20%   +0.01%     
- Complexity     6509     6564      +55     
============================================
  Files           742      743       +1     
  Lines         21697    21886     +189     
  Branches       4237     4284      +47     
============================================
+ Hits          16964    17116     +152     
- Misses         4062     4087      +25     
- Partials        671      683      +12     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.