1 Introduction to digital topology The presentation has been prepared based on the following sources: 1.Kong T. Y., A digital fundamental group, Computer.
convex hull
An Efficient Convex Hull Algorithm for a Planer Set of Points
A Recursive Algorithm for Calculating the Relative Convex Hull Gisela Klette AUT University Computing & Mathematical Sciences Auckland, New Zealand.
Spectral Clustering Course: Cluster Analysis and Other Unsupervised Learning Methods (Stat 593 E) Speakers: Rebecca Nugent 1, Larissa Stanberry 2 Department.
T RIANGLE M ESHES Part 1: Constrained Triangulations Part 2: Delaunay Refinement Part 3: Local Feature Size 1 BY I LYA B ITLER.
Complex Variables Mohammed Nasser Acknowledgement: Steve Cunningham.
Voronoi Diagrams 1.Given a set of points S in the plane, which are the Voronoi sites. 2.Each site s has a Voronoi cell, also called a Dirichlet cell, V(s)
Searching Dynamic Point Sets in Spaces with Bounded Doubling Dimension
Econ 600: Mathematical Economics
Voronoi Diagrams
Searching Dynamic Point Sets in Spaces with Bounded Doubling Dimension Lee-Ad Gottlieb Joint work with Richard Cole.
