3-dimensional Convex Hull: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:3-dimensional Convex Hull (Convex Hull)}} == Description == Here, we are looking at the 3-dimensional case. == Related Problems == Generalizations: d-dimensional Convex Hull Related: 2-dimensional Convex Hull, 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic == Parameters == <pre>n: number of line segments h: number of points on the convex hull</pre> == Table of Algorithms == {| class="wikitable sortable" s...")
 
No edit summary
 
(One intermediate revision by the same user not shown)
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


<pre>n: number of line segments
$n$: number of line segments
h: number of points on the convex hull</pre>
 
$h$: number of points on the convex hull


== Table of Algorithms ==  
== Table of Algorithms ==  
Line 23: Line 24:
|-
|-


| [[Incremental convex hull algorithm; Michael Kallay ( Convex Hull)|Incremental convex hull algorithm; Michael Kallay]] || 1984 || $O(n log n)$ ||  || Exact || Deterministic || [https://www.sciencedirect.com/science/article/pii/002001908490084X Time]
| [[Incremental convex hull algorithm; Michael Kallay ( Convex Hull)|Incremental convex hull algorithm; Michael Kallay]] || 1984 || $O(n \log n)$ ||  || Exact || Deterministic || [https://www.sciencedirect.com/science/article/pii/002001908490084X Time]
|-
|-
|}
|}

Latest revision as of 08:19, 10 April 2023

Description

Here, we are looking at the 3-dimensional case.

Related Problems

Generalizations: d-dimensional Convex Hull

Related: 2-dimensional Convex Hull, 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic

Parameters

$n$: number of line segments

$h$: number of points on the convex hull

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Incremental convex hull algorithm; Michael Kallay 1984 $O(n \log n)$ Exact Deterministic Time

References/Citation

https://link.springer.com/article/10.1007/BF02712873