COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON (Q4682154): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Test for intersection between plane and box / rank
 
Normal rank

Latest revision as of 11:17, 10 June 2024

scientific article; zbMATH DE number 2174807
Language Label Description Also known as
English
COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON
scientific article; zbMATH DE number 2174807

    Statements

    COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2005
    0 references
    Polyhedron
    0 references
    intersection
    0 references
    collision detection
    0 references
    line segment
    0 references

    Identifiers