Logo CVUT Logo FEL CourseWare Wiki

Log In
  • b231
  • courses
  • cg
  • labs
  • 2-chull

Navigation

  • CG
  • Files
  • Seminars
    • Assignment 1:
    • Assignment 2: Convex Hull Algorithms [16 points]
    • Assignment 3: Implementation of ear clipping method for simple polygon triangulation [16 points]
  • Lectures
    • How to handle applets
  • Links and resources
    • inst-debian
    • inst-gentoo
    • inst-vs2005
    • A(E)4M39VG - Computational Geometry
    • Common values of MSVC version for C++ compilers
  • Presentations
    • List of presentation topics with source materials
    • Presentation hints
  • menu

All courses

  • Summer 2024 / 2025
  • Winter 2024 / 2025
  • Summer 2023 / 2024
  • Winter 2023 / 2024
  • Summer 2022 / 2023
  • Winter 2022 / 2023
  • Summer 2021 / 2022
  • Winter 2021 / 2022
  • Summer 2020 / 2021
  • Winter 2020 / 2021
  • Summer 2019 / 2020
  • Winter 2019 / 2020
  • Summer 2018 / 2019
  • Winter 2018 / 2019
  • Summer 2017 / 2018
  • Older


B4M39VG - faculty web in Czech
BE4M39VG - faculty web in English

Timetable: B4M39VG, BE4M39VG

Warning
This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

Assignment 2: Convex Hull Algorithms [16 points]

This is the second exercise for the Computational Geometry class. It focuses on custom implementation of two simple convex hull algorithms in 2D.

The assignment...

courses/cg/labs/2-chull.txt · Last modified: 2023/11/10 18:40 by felkepet
Copyright © 2025 CTU in Prague | Operated by IT Center of Faculty of Electrical Engineering | Bug reports and suggestions Helpdesk CTU