COMPGEOM
2006
ACM
13 years 7 months ago
2006
ACM
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 ...
DGCI
2009
Springer
13 years 8 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
DGCI
2009
Springer
13 years 8 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
DGCI
2009
Springer
13 years 8 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
COCOA
2009
Springer
13 years 8 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
COMPGEOM
2010
ACM
13 years 8 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
COMPGEOM
2010
ACM
13 years 8 months ago
2010
ACM
COMPGEOM
1987
ACM
13 years 8 months ago
1987
ACM
In [12] Stolfi developed a complete theory of Oriented Projective Geometry. He showed that assigning meaning to the sign of an otherwise homogenous representation of geometry could...
COMPGEOM
1987
ACM
13 years 8 months ago
1987
ACM
COMPGEOM
1987
ACM
13 years 8 months ago
1987
ACM
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...