Principles of design, analysis and implementation of efficient algorithms. Case studies from a variety of areas illustrate divide and conquer methods, the greedy approach, branch and bound algorithms and dynamic programming.
-
Notifications
You must be signed in to change notification settings - Fork 0
This repository includes projects that implemented three different types of algorithms , a divide and conquer algorithm was used to solve a Convex Hull problem (A1), a greedy algorithm was implemented to create triangle strips out of a triangle mesh (A2), and dynamic programming was used for the minimum area triangulation between two contours (A3.)
miodrag4/CMPE-365-Algorithims
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository includes projects that implemented three different types of algorithms , a divide and conquer algorithm was used to solve a Convex Hull problem (A1), a greedy algorithm was implemented to create triangle strips out of a triangle mesh (A2), and dynamic programming was used for the minimum area triangulation between two contours (A3.)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published