Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.
-
Updated
Jan 25, 2025 - Java
Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.
A simple Java console program that will solve the intersection and union of a set of elements with the given two arrays having several values. This program only used loops and condition statements, with no built-in Java function involved to solve the problem.
Java library for RegexSolver API.
🔵 Shapes on Field with search,delete,intersect detection, area and perimeter calculating
simple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments
A react-native component designed especially for responsive drawing
General Poly Clipper Algorithm in Java
Computer Graphics — Laboratory Works
Add a description, image, and links to the intersection topic page so that developers can more easily learn about it.
To associate your repository with the intersection topic, visit your repo's landing page and select "manage topics."