linear-affine-convex

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

Notes

Additional course notes

• Derivation of dot product cosine formula
• Affine subspace distance
• Projective geometry

Extra references

• Robust geometric predicates

Projects

Robust floating point computations

two-sum

Author: Mikola Lysenko

Exactly computes the sum of two floating point numbers

two-product

Author: Mikola Lysenko

Exactly computes the product of two floating point numbers

cross-product

Author: Hana Sarbortova

robust-sum

Author: Mikola Lysenko

Exactly computes the sum of two series expansions

robust-scale

Author: Mikola Lysenko

Exactly multiplies a series expansion by a scalar

robust-determinant-2

Author: Mikola Lysenko

Exactly computes the determinant of a 2x2 matrix

robust-determinant-3

Author: Mikola Lysenko

Exactly computes the determinant of a 3x3 matrix

[robust-determinant-4] (https://github.com/rpgaggioli/robust-determinant-4)

Author: Richard Gaggioli

Exactly computes the determinant of a 4x4 matrix

Geometric predicates

left-right

Author: Mikola Lysenko

Checks the orientation of 3 points in a plane.

point-in-circle

Author: Michael Doescher

Checks if a point is within a circle.

graham-scan

Author: Daniel Melanz

Computes the convex hull of a finite set of points in the plane with time complexity O(n log n).

quick-hull-2d

Author: Andrew Seidl

Computes the convex hull of a finite set of points in the plane using a divide-and-conquer approach similar to QuickSort.

diameter-convex-hull

Author: Yung-Hsien Chu

compute diameter of convex hull.

point-plane

Author: Brandon Korf

Determines if given point is above, on or below plane made by 3 other given points.

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.

For more information on how to make a pull request, see the following page:

• Pull requests

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
• Calculate width and diamater of 2D convex polygons
• Other rotating caliper-type operations