Counting number of intersection points, line segments (Line segment intersection)

From Algorithm Wiki
Revision as of 10:19, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Counting number of intersection points, line segments (Line segment intersection)}} == Description == In this case, we are supplied with a list of line segments, and we wish to count the number of points of intersection. == Related Problems == Generalizations: Reporting all intersection points, line segments Related: Reporting all intersection points, generalized segments, Reporting all intersection points, convex polygons, Reporting al...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

In this case, we are supplied with a list of line segments, and we wish to count the number of points of intersection.

Related Problems

Generalizations: Reporting all intersection points, line segments

Related: Reporting all intersection points, generalized segments, Reporting all intersection points, convex polygons, Reporting all intersection points, general polygons

Parameters

n: number of line segments
k: number of points of intersection

Table of Algorithms

Currently no algorithms in our database for the given problem.

References/Citation

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000086900255