Skip to content

Conversation

@sandeepgoudmacha
Copy link

@sandeepgoudmacha sandeepgoudmacha commented Oct 21, 2025

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

Implement Rotating Calipers algorithm to find the farthest pair of points in a convex polygon.
Implement line segment intersection detection using orientation method.
This implementation uses the Bowyer–Watson algorithm for Delaunay triangulation, ensuring no point lies inside the circumcircle of any triangle. It includes methods for triangulating a set of points and managing triangle and edge relationships.
This class generates Voronoi diagrams by computing the edges between sites using their perpendicular bisectors. It includes a method to compute the Voronoi edges given a list of points.
@github-actions
Copy link

github-actions bot commented Nov 5, 2025

This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity.

@github-actions github-actions bot closed this Nov 5, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant