2.1 Convex hull of a planar point set

Loading...
查看授课大纲

审阅

3.9(13 个评分)
  • 5 stars
    38.46%
  • 4 stars
    30.76%
  • 3 stars
    23.07%
  • 1 star
    7.69%
从本节课中
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!

教学方

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Aliaksei Tolstsikau

    Senior lecturer
  • Placeholder

    Kira Vyatkina

    Leading Researcher

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。