Finding the intersection of n half-spaces in time O(n log n) (Q1260355): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Franco P. Preparata / rank
Normal rank
 
Property / author
 
Property / author: David E. Muller / rank
Normal rank
 
Property / author
 
Property / author: Franco P. Preparata / rank
 
Normal rank
Property / author
 
Property / author: David E. Muller / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(79)90055-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987647724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of two convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225312 / rank
 
Normal rank

Latest revision as of 01:48, 13 June 2024

scientific article
Language Label Description Also known as
English
Finding the intersection of n half-spaces in time O(n log n)
scientific article

    Statements

    Finding the intersection of n half-spaces in time O(n log n) (English)
    0 references
    1979
    0 references
    finding intersection of half-spaces in time O(n log n)
    0 references
    interior and vertices of polyhedron
    0 references
    0 references
    0 references

    Identifiers