Improving the GJK Algorithm for Faster and More Reliable Distance Queries Between Convex Objects

แชร์
ฝัง
  • เผยแพร่เมื่อ 6 ม.ค. 2025

ความคิดเห็น • 7

  • @JasminUwU
    @JasminUwU 2 หลายเดือนก่อน

    It's good to know there's still room for improvement for such fundamental algorithms

  • @desine_
    @desine_ ปีที่แล้ว +1

    cool, but why is it faster to start from triangle go (lower)?

    • @michaelgreer7306
      @michaelgreer7306 ปีที่แล้ว +1

      It's faster because you can more efficiently prune voronoi regions which cannot contain the origin and skip further unnecessary computation on those cases.

    • @AlexGoldring
      @AlexGoldring 2 หลายเดือนก่อน

      Further to what Michael said, the region is just larger. The corner regions flare out from a point, the side regions from a line, and the triangle from a plane. Hope that makes intuitive sense. You're more likely to find a match on the face than on a corner.

  • @mannguyenduy3688
    @mannguyenduy3688 ปีที่แล้ว +13

    watched the whole video and still can't understand shit

    • @DeusEx3
      @DeusEx3 7 หลายเดือนก่อน

      yeah I just skipped to the end, I guess I'll come back in 3 years or so

  • @WildHilary
    @WildHilary 4 หลายเดือนก่อน

    Lewis Brian Jackson Edward Harris Matthew