Sciweavers

2980 search results - page 307 / 596
» Computational Geometry
Sort
View
DGCI
2006
Springer
15 years 10 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
DGCI
2006
Springer
15 years 10 months ago
Improving Difference Operators by Local Feature Detection
Differential operators are required to compute several characteristics for continuous surfaces, as e.g. tangents, curvature, flatness, shape descriptors. We propose to replace diff...
Kristof Teelen, Peter Veelaert
146
Voted
COMPGEOM
1995
ACM
15 years 10 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
COMPGEOM
2006
ACM
15 years 8 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
COMPGEOM
2005
ACM
15 years 8 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...