Finding stabbing lines in 3-space (Q1193706): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4763390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral line transversals in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lines in space: Combinatorics and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5814388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time / rank
 
Normal rank

Latest revision as of 14:21, 16 May 2024

scientific article
Language Label Description Also known as
English
Finding stabbing lines in 3-space
scientific article

    Statements

    Finding stabbing lines in 3-space (English)
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polyhedra
    0 references
    combinatorial complexity
    0 references
    upper bound
    0 references
    stabbing line
    0 references
    0 references
    0 references