(Back to Igor's page) Inverse  IOptLib  IGLib  Igor Grešovnik

# Useful Links - Collection of Igor Grešovnik

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!).

# Numerical Algorithms

The Stony Brook Algorithm Repository - Collection of fundamental algorithms

• 1.1 Data Structures
• 1.2 Numerical Problems
• 1.3 Combinatorial Problems
• 1.4 Graph Problems -- polynomial-time problems
• 1.5 Graph Problems -- hard problems
• 1.6 Computational Geometry     - Closest point search
• 1.7 Set and String Problems

• Analysis of algorithms
- Steven Skiena, Lecture Notes (Nearest Neigh. Search)

Netlib - a collection of mathematical software and resources (list of libraries / software search).

# Closest Point Problem

Nearest Neighbour Search
- electronic book by Steven Skiena

A Simple Algorithm for Nearest Neighbour Search in High Dimensions, S. A. Nene and S. K. Nayar, II-MM
- 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, II-MM
- 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, II-MM
- 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, II-MM
- Also similar as previous ones.  - on the web

Parametric Feature Detection, E. Hadjidemetriou, M. Grossberg and S. K. Nayar   II-MM
- There is also something on closest point search.  - on the web

===========

Closest Point Search in Lattices; Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger.  - on the web

Shape Registration:

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 13-14, 1 December 2003, Pages 1145-1153
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
, Computer-Aided Design, Volume 35, Issue 1, January 2003, Pages 115-120  SummaryPlus | Full Text + Links | PDF (217 K)

Non-rigid Shape Registration:

A unified non-rigid 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 non-rigid point matching, Haili Chui and Anand Rangarajan, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (accepted), 2000 - on the web.

Other:

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, Pages 739-748 A. D. Brett and C. J. Taylor Abstract | PDF (731 K)

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..

Discrete Elements

### Didier Müller - Ph. D. Thesis

Delaunay triangularization

Dynamic Triangulations for Efficient 3D Simulation of Granular Materials,  Jean-Albert FERREZ (Ph.D. Thesis) - Discrete elements, also about delaunay triangularization. - on the web; Other useful information

Computational Geometry

Geometry in Action - An exhaustive set of geometry links!!!

Contact Search

Procedure for Contact detection in Discrete Element Analysis;  X. L. Liu, J. V. Lemos.  (from Science Direct)  - Ni zelo koristen.

People:
• Sameer A. Nene  - Computer vision, Closest point search, .... With publications!
• Haili Chui - Non-rigid matching of shapes; also papers on oprimization;    With publications

The Stony Brook Algorithm Repository - Collection of fundamental algorithms
• 1.1 Data Structures
• 1.2 Numerical Problems
• 1.3 Combinatorial Problems
• 1.4 Graph Problems -- polynomial-time problems
• 1.5 Graph Problems -- hard problems
• 1.6 Computational Geometry
• 1.7 Set and String Problems

Netlib - a collection of mathematical software and resources (list of libraries / software search).

The Stony Brook Algorithm Repository - Collection of fundamental algorithms

• 1.1 Data Structures
• 1.2 Numerical Problems
• 1.3 Combinatorial Problems
• 1.4 Graph Problems -- polynomial-time problems
• 1.5 Graph Problems -- hard problems
• 1.6 Computational Geometry
• 1.7 Set and String Problems

Columbia Automated Vision Environment - A laboratory for computer vision, inlcudes useful computational geometriy papers and links

# Misc

General information:

Search engines (when even the Wikipedia does not hold the information you are looking for):

Maps, etc.:

• Slovenia maps  - The best site for finding a place in Slovenia such as Bled. Use the search field (beside a button labeled "Najdi") to find a place by name (example) or the link button to send somebody a precise location such as my home village.