2.1 Convex hull of a planar point set

Loading...
강의 계획서 보기

검토

3.8(10개의 평가)
  • 5 stars
    40%
  • 4 stars
    20%
  • 3 stars
    30%
  • 1 star
    10%
수업에서
Convex hulls
Algorithmic processing of finely shaped objects may be computationally expensive. Can they be reasonably approximated, so as to decrease the handling costs? Convex hulls will come at hand!

강사:

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Aliaksei Tolstsikau

    Aliaksei Tolstsikau

    Senior lecturer
  • Kira Vyatkina

    Kira Vyatkina

    Leading Researcher

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.