Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An optimal convex hull algorithm in any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Optimization Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank

Revision as of 11:23, 23 May 2024

scientific article
Language Label Description Also known as
English
Derandomizing an output-sensitive convex hull algorithm in three dimensions
scientific article

    Statements

    Identifiers