Skip to content

Latest commit

 

History

History
85 lines (48 loc) · 2.52 KB

README.md

File metadata and controls

85 lines (48 loc) · 2.52 KB

linear-affine-convex

The purpose of this repository is to act as a directory of the completed projects

Notes

Additional course notes

Extra references

Projects

Robust floating point computations

Author: Mikola Lysenko

Exactly computes the sum of two floating point numbers

Author: Mikola Lysenko

Exactly computes the product of two floating point numbers

Author: Mikola Lysenko

Exactly computes the sum of two series expansions

Author: Mikola Lysenko

Exactly multiplies a series expansion by a scalar

Author: Mikola Lysenko

Exactly computes the determinant of a 2x2 matrix

Author: Mikola Lysenko

Exactly computes the determinant of a 3x3 matrix

Author: Richard Gaggioli

Exactly computes the determinant of a 4x4 matrix

Geometric predicates

Author: Mikola Lysenko

Checks the orientation of 3 points in a plane.

What YOU need to do

You should fork this repository and send a pull request to select a topic that you want to work on. By Friday, you should have written a working module that solves your specific problem and published it to npm. You may use any resources you want to do this, including other modules on npm.

Project ideas

To help get you started, here are some suggestions for project ideas:

  • More general determinant calculations
  • More geometric predicate tests (general orientation tests, in circle/sphere tests)
  • Primitive intersection queries
  • 2D convex hull algorithms
  • Closest point queries between subspaces
  • Implicit to parametric conversions
  • Distance computations between affine subspaces