Collision detection algorithm of a continuous type using spherical extreme vertex diagrams (Q1767855): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving related two- and three-dimensional linear programming problems in logarithmic time / rank
 
Normal rank

Latest revision as of 19:41, 7 June 2024

scientific article
Language Label Description Also known as
English
Collision detection algorithm of a continuous type using spherical extreme vertex diagrams
scientific article

    Statements

    Collision detection algorithm of a continuous type using spherical extreme vertex diagrams (English)
    0 references
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Extreme vertex problem
    0 references
    Convex hull
    0 references
    Spherical Voronoi diagram
    0 references