This page contains a number of useful links that are close to my work or personal interest. I hope it will be useful for you, too. Send comments and suggestions for improvements to gresovnik (at) gmail.com (without spaces and underscores!).

File links 
The Stony Brook Algorithm
Repository  Collection of fundamental algorithms
A Simple Algorithm for Nearest Neighbour Search in High
Dimensions, S. A. Nene and S. K. Nayar, IIMM
 Exhaustive about Nene's search algorithm. 38 pages.  on
the
web
A Simple Algorithm for Nearest Neighbour Search in High
Dimensions, S. A. Nene and S. K. Nayar, IIMM
 related to previous, less exhaustive. A particular search
problem (I think it's not the same as general one).  on
the
web
Closest Point Search in High Dimensions, S.
A.
Nene and S. K. Nayar, IIMM
 A particular search problem  Similar as previous one (I think
it's not the same as general case).  on
the
web
A
Simple Algorithm for High Dimensional Search, S.
A.
Nene and S. K. Nayar, IIMM
 Also similar as previous ones.  on
the
web
Parametric Feature Detection,
E. Hadjidemetriou, M. Grossberg and S. K. Nayar IIMM
 There is also something on closest point search.  on
the
web
===========
A Fast Algorithm for Computing the Closest Point and
Distance Transform; Sean Mauch  on
the web
Closest Point Search in Lattices; Erik Agrell, Thomas
Eriksson, Alexander Vardy, Kenneth Zeger. 
on the web
Fast Geometric Matching for Shape
Registration; problem of the
registration, or geometric
matching, of 3D datasets (correct relative alignment, closest point correspond.)
 on
the
web
Robust
registration of 2D and 3D point sets, Image and
Vision Computing, Volume 21, Issues 1314,
Andrew W. Fitzgibbon
Simultaneous Registration of
Multiple Range Views Satisfying Global Consistency Constraints
For Use In revese Engineering; D.W. Eggert, A. W.
Fitzgibbon, R.B. Fischer. Reverse
Engineering reconstruction of object shape from a set of
points, zanimivo.  on
the web
3D
Vision  nekaj podobnega, kot bi rabil za shape fitting
Newton methods for
parametric surface registration. Part II. Experimental
validation, Thomas M. Tucker and Thomas R. Kurfess
, ComputerAided Design, Volume 35, Issue 1,
A unified nonrigid feature
registration method for brain mapping, Haili
Chui, Larry Win, Robert Schultz, Jim Duncan and Anand
Rangarajan, Medical Image Analysis (in press), 2002  on
the
web.
A new algorithm for nonrigid point matching, Haili Chui and Anand Rangarajan, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (accepted), 2000  on the web.
The Trimmed Iterative Closest Point
algorithm; D. Chetverikov, D. Svirko, and D. Stepanov,
Pavel Krsek  Alignment
of Two Partially overlaping sets of points
A method of automated
landmark generation for automated 3D PDM construction,
Image and Vision Computing, Volume 18, Issue 9,
A
Fast Marching Method of Computing Closest Points 
(?) Nepregledano.
Computational Geometry: Nearest Neighbor Problem; Aristides Gionis: Lecture Notes: (?)  samo nacelen oris ideje, Mogoce izhodisce za naprej..
Dynamic Triangulations for Efficient 3D
Simulation of Granular Materials, JeanAlbert
FERREZ (Ph.D. Thesis)  Discrete elements, also about delaunay
triangularization.  on
the web; Other useful
information
Links  Delaunay
triangulariyation
Geometry
in Action  An exhaustive set of
geometry links!!!
Procedure for Contact
detection in Discrete Element Analysis; X. L. Liu, J.
V. Lemos. (from Science Direct)  Ni zelo koristen.
The Stony Brook Algorithm
Repository  Collection of fundamental algorithms
Links to my software:
Columbia Automated
Vision Environment  A laboratory for
computer vision, inlcudes useful computational geometriy papers
and links
Search engines (when even
the Wikipedia does not hold the information you are looking for):
Maps, etc.:
Under Construction. Please return later
when I add more links.
