Weiler Atherton Polygon Clipping Algorithm

Поділитися
Вставка
  • Опубліковано 24 січ 2025

КОМЕНТАРІ •

  • @sireeshajangam1561
    @sireeshajangam1561 2 роки тому

    Great exaplanation do more videos it helps a lot ,thanks ,mam

  • @SteveMaughan
    @SteveMaughan 4 роки тому +3

    Nice explanation. Now I need to expand to the case where either polygon has a "hole"

    • @sireeshajangam1561
      @sireeshajangam1561 2 роки тому +1

      Polygon has a enclosed connection it means the polygon does not contain a hole ,if it contains then it is not a polygon I think this is my opinino

    • @SteveMaughan
      @SteveMaughan 2 роки тому +1

      @@sireeshajangam1561 Sorry but in the real world polygons do have holes e.g. a lake. Normally they are represented as polygons rotating anti-clockwise

    • @shazam1334
      @shazam1334 2 роки тому

      @@SteveMaughan damn...is it?

  • @abhishekpawar5804
    @abhishekpawar5804 3 роки тому

    Nicely explained

  • @durveshmahajan8097
    @durveshmahajan8097 4 роки тому

    Thanks Mam. Nicely explained 🙏🙏

  • @Comedywith-Pari
    @Comedywith-Pari 4 роки тому

    Nice explanation

  • @veenasgoodtimes2781
    @veenasgoodtimes2781 3 роки тому

    Nice mam