CS-598 AI and Graphics

D.A. Forsyth --- 3310 Siebel Center

Lecture Times Time: MW 11h00-12h15, Location: ONLINE

Convexes and shape

Groups, rules, etc. You can do this in groups of up to five. There will be four such homeworks. Each student should have done: all exercises; at least one challenge; at least one project. Project ideas are ideas - you can do different projects, by discussion with me. You may use code from any source, as long as you acknowledge it. Due date: last day of semester for everything.

Exercise (for everyone)

Prove the variant form of Farkas' lemma mentioned in class. In particular, for a convex set C, either a point x lies in the set or there is a hyperplane h such that h(C) is positive and h(x) is negative

Challenge

Evaluate a loss that forces a CvxNet style convex to have two kinds of property. It may not intersect with one of a collection of given convexes, and it must contain all of another set of given convexes - could one use such a thing to build a practical system?

Possible projects

Demonstrate a CvxNet that use losses, as above, to create complex controlled shapes

Use a pointnet style representation to match CvxNet convex repns to one another