Mudanças entre as edições de "Computational Geometry"

De Pontão Nós Digitais
(Wed 23Out19)
Linha 23: Linha 23:
 
*** Learn first simple sort algorithm using max
 
*** Learn first simple sort algorithm using max
  
=== Wed 23Out19 ===
+
=== Wed 23Out19 (twice lecture load) ===
 
* Due: simple sort using max
 
* Due: simple sort using max
 
* bucket sort (class exercise). Due. (student juliana: done)
 
* bucket sort (class exercise). Due. (student juliana: done)
 
* Other simple sorts. Insertion, selection,  bubble
 
* Other simple sorts. Insertion, selection,  bubble
 
** Basic building block: insert on sorted array, keeping it sorted
 
** Basic building block: insert on sorted array, keeping it sorted
 +
* Theory: arrays.
 +
 +
=== For Wed 30Out19 ===
 +
* Overdue: Vertical Function graph (K&H Histogram)
 +
* Due: Insert on sorted array
 +
* Due: Merge two sorted arrays as warmup for next lecture
  
 
=== Future ===
 
=== Future ===
Linha 35: Linha 41:
 
*** partition an arbitrary array into smaller and larger than a given t
 
*** partition an arbitrary array into smaller and larger than a given t
  
=== For Wed 30Out19 ===
 
* Overdue: Vertical Function graph (K&H Histogram)
 
  
 
== Tarefas ==
 
== Tarefas ==
Linha 54: Linha 58:
  
 
=== Bucket sort ===
 
=== Bucket sort ===
 +
 +
=== Basic sort building blocks ===
 +
*** insert: insert on sorted array, keeping it sorted
 +
*** merge: merge two sorted arrays into a sorted array.
 +
*** partition an arbitrary array into smaller and larger than a given t
 +
 +
=== Computational Geometry problems to practice C++ programming ===
 +
*** Hash tables, Buckets for point query
 +
*** Proximity
 +
*** Voronoi Diagrams
 +
*** Curve Algorithms
 +
 +
 +
=== Quizz 1: C++ programming skills ===
 +
***
  
 
== General Info ==
 
== General Info ==
 
* Instructor: prof. [http://rfabbri.github.io Ricardo Fabbri], Ph.D. Brown University
 
* Instructor: prof. [http://rfabbri.github.io Ricardo Fabbri], Ph.D. Brown University
 
* Meeting times: Wednesdays 7:50-11:30, Thursdays 7:50-9:40, and 15:00-17:00, room 110.
 
* Meeting times: Wednesdays 7:50-11:30, Thursdays 7:50-9:40, and 15:00-17:00, room 110.
* Evaluation criteria: 1 quizz (30%), practical projects (70%).
+
* Evaluation criteria: at least 2 quizzes (40%), practical projects (60%).
 
* Forum for file exchange and discussion: email and IRC #labmacambira
 
* Forum for file exchange and discussion: email and IRC #labmacambira
  
 
[[Category:Lab Macambira]] [[Category:IPRJ]]
 
[[Category:Lab Macambira]] [[Category:IPRJ]]

Edição das 11h29min de 23 de outubro de 2019

////////// Under Construction //////////

This is the main page of a graduate level course (Msc and PhD) in computational geometry being taught in 2019/2 at the Polytechnic Institute IPRJ/UERJ. It is generally useful for programmers at the advanced level in the fields of machine learning, scientific simulations, graphics, computer vision and and multimedia programming.

Lecture Log

Wed 9Out19 (twice lecture load)

  • Hello world
    • for loop print 10x
  • Slides 1 Review C Fabbri
    • Variables, arrays/vectors
  • Farenheit to/from celcius program: homework

Wed 16Oct19

  • Show results of Farenheit to Celsius
  • Learn Codeblocks

Thu 17Oct19

  • Print function graph (K&R Histogram)
    • Horizontal
      • Learn how to write max function: non-recursive and recursive
      • Learn first simple sort algorithm using max

Wed 23Out19 (twice lecture load)

  • Due: simple sort using max
  • bucket sort (class exercise). Due. (student juliana: done)
  • Other simple sorts. Insertion, selection, bubble
    • Basic building block: insert on sorted array, keeping it sorted
  • Theory: arrays.

For Wed 30Out19

  • Overdue: Vertical Function graph (K&H Histogram)
  • Due: Insert on sorted array
  • Due: Merge two sorted arrays as warmup for next lecture

Future

  • Intro to advanced sorts: Merge sort, Quick Sort
    • Basic building blocks:
      • merge: merge two sorted arrays into a sorted array.
      • partition an arbitrary array into smaller and larger than a given t


Tarefas

Hello World

Celsius to/from Farenheit

Print Function graph (K&R Histogram): horizontally

  • Sub exercise: max function

Implement max function recursively

Sort using max function

Print Function graph (K&R Histogram): vertically

Bucket sort

Basic sort building blocks

      • insert: insert on sorted array, keeping it sorted
      • merge: merge two sorted arrays into a sorted array.
      • partition an arbitrary array into smaller and larger than a given t

Computational Geometry problems to practice C++ programming

      • Hash tables, Buckets for point query
      • Proximity
      • Voronoi Diagrams
      • Curve Algorithms


Quizz 1: C++ programming skills

General Info

  • Instructor: prof. Ricardo Fabbri, Ph.D. Brown University
  • Meeting times: Wednesdays 7:50-11:30, Thursdays 7:50-9:40, and 15:00-17:00, room 110.
  • Evaluation criteria: at least 2 quizzes (40%), practical projects (60%).
  • Forum for file exchange and discussion: email and IRC #labmacambira