Detecting intersections among a set of line segments. Checking a user-drawn polygon for self-intersections. It includes graphical user interfaces (GUIs) to visualize both applications. Implements the ...
This repository contains a Python implementation of the Bentley-Ottman algorithm, a sweep-line algorithm for determining the intersection points of a set of line ...
Abstract: Intersecting a collection of line segments is one of the most fundamental tasks in computer geometry. Bentley and Ottmann [1] proposed an algorithm called Sweep Line Algorithm. The algorithm ...
Abstract: Graphics Processing Units (GPUs) have been widely used for computational intensive applications owing to its massive number of computing cores. However, only few algorithms can fully utilize ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results