Reporting all intersection points, convex polygons: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Reporting all intersection points, convex polygons (Line segment intersection)}} == Description == In this case, we are supplied with a list of convex polygons, and we wish to report all regions of intersection. == Related Problems == Generalizations: Reporting all intersection points, general polygons Related: Reporting all intersection points, line segments, Reporting all intersection points, generalized segments, Counting number of i...")
 
No edit summary
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


<pre>n: number of line segments
n: number of line segments
k: number of points of intersection</pre>
 
k: number of points of intersection


== Table of Algorithms ==  
== Table of Algorithms ==  

Revision as of 12:02, 15 February 2023

Description

In this case, we are supplied with a list of convex polygons, and we wish to report all regions of intersection.

Related Problems

Generalizations: Reporting all intersection points, general polygons

Related: Reporting all intersection points, line segments, Reporting all intersection points, generalized segments, Counting number of intersection points, line segments

Parameters

n: number of line segments

k: number of points of intersection

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
NIEVERGELT. J.. AND PREPARATA (Section 3) 1982 $O( nlog n + k )$ $O(n)$ Exact Deterministic Time & Space

Time Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination

References/Citation

https://pdfs.semanticscholar.org/a571/cc92218132a1b0e65c2adbf663c79d015737.pdf