The Centervertex Theorem (FWCG)
Reconstruction of Surfaces from Three-Dimensional Unorganized Point Sets / Robert Mencl PhD Thesis
Big Data Lecture 6: Locality Sensitive Hashing (LSH)
Cops and Robbers1 What is left to do on Cops and Robbers? Anthony Bonato Ryerson University GRASCan 2012.
Convex Sets & Concave Sets A planar region R is called convex if and only if for any pair of points p, q in R, the line segment pq lies completely in R.
Cops and Robbers1 Conjectures on Cops and Robbers Anthony Bonato Ryerson University Joint Mathematics Meetings AMS Special Session.
I/O-Efficient Construction of Constrained Delaunay Triangulations Pankaj K. Agarwal, Lars Arge, and Ke Yi Duke University.
Projective 2D geometry (cont’) course 3 Multiple View Geometry Comp 290-089 Marc Pollefeys.
1 Translational Polygon Covering using Intersection Graphs Prof. Karen Daniels Rajasekhar Inkulu 13 August, 2001.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
Voronoi Diagrams & Delaunay Triangulations O’Rourke: Chapter 5
Lines in the plane, slopes, and Euler’s formula by Tal Harel.
