How good are convex hull algorithms? (Q1356937): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q29542125, #quickstatements; #temporary_batch_1704597940110
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Qhull / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: cdd / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of vertices of perturbed polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projections of 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal convex hull algorithm in any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected bibliography on degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing extreme rays of the metric cone for seven points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and relatively efficient triangulation of the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytope pairs and their relationship to linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of the vertices of polyhedra associated with network LP's / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature and meaning of perturbations in geometric computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the convex hull facet by facet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental convex hull algorithms are not output sensitive / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:52, 27 May 2024

scientific article
Language Label Description Also known as
English
How good are convex hull algorithms?
scientific article

    Statements

    How good are convex hull algorithms? (English)
    0 references
    0 references
    0 references
    0 references
    8 December 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    convex polytope
    0 references
    convex hull
    0 references
    vertex enumeration problem
    0 references
    facet enumeration problem
    0 references
    0 references
    0 references
    0 references