Latest Courses
data build tool in Cloud(dbt Cloud)Check course
Dagger Hilt Dependency Injection MasterclassCheck course
Introduction to JavaCheck course
Feature importance and model interpretation in PythonCheck course
GIT for beginnersCheck course
The Ultimate Authentication Course with NodeJS and AngularCheck course
Master Data Science | A Step-by-Step Guide for 2022Check course
Master Google Cloud | A Step-by-Step Guide for 2022Check course
Data Science Machine Learning & AI with 7 Hands on ProjectsCheck course
Laravel Scout and Cashier with projects in Laravel 8Check course
data build tool in Cloud(dbt Cloud)Check course
Dagger Hilt Dependency Injection MasterclassCheck course
Introduction to JavaCheck course
Feature importance and model interpretation in PythonCheck course
GIT for beginnersCheck course
Add to wishlistAdded to wishlistRemoved from wishlist 1
Add to compare
9.0/10 (Our Score)
Product is rated as #23 in category Data Structures and Algorithms

Course Information: In many areas of computer science such as robotics, computer graphics, virtual reality, and geographic information systems, it is necessary to store, analyze, and create or manipulate spatial data. This course deals with the algorithmic aspects of these tasks: we study techniques and concepts needed for the design and analysis of geometric algorithms and data structures. Each technique and concept will be illustrated on the basis of a problem arising in one of the application areas mentioned above. Goals: At the end of this course participants should be able – to decide which algorithm or data structure to use in order to solve a given basic geometric problem, – to analyze new problems and come up with their own efficient solutions using concepts and techniques from the course. Prerequisites: In order to successfully take this course, you should already have a basic knowledge of algorithms and mathematics. Here’s a short list of what you are supposed to know: – O–notation, Omega–notation, Theta–notation; how to analyze algorithms – Basic calculus: manipulating summations, solving recurrences, working with logarithms, etc. – Basic probability theory: events, probability distributions, random variables, expected values etc. – Basic data structures: linked lists, binary search trees, etc. – …

Instructor Details

-

Specification: Geometric Algorithms

Duration

12 hours

Year

2019

Level

Intermediate

Certificate

Yes

Quizzes

Yes

1 review for Geometric Algorithms

5.0 out of 5
1
0
0
0
0
Write a review
Show all Most Helpful Highest Rating Lowest Rating
  1. Joseph G N

    This a really good course with a lot of good content and good explanations. I would like that the problems has a grader instead of the txt file but well I suppose this is more expensive to achieve. Recommended

    Helpful(1) Unhelpful(0)You have already voted this

    Add a review

    Your email address will not be published.

    This site uses Akismet to reduce spam. Learn how your comment data is processed.

    Price tracking

    Java Code Geeks
    Logo
    Register New Account
    Reset Password
    Compare items
    • Total (0)
    Compare