885 search results - page 141 / 177 » Optimal Polygon Placement |
IPPS
1994
IEEE
14 years 2 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
COMPGEOM
2006
ACM
13 years 12 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 ...
SODA
1993
ACM
13 years 11 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
CAD
2008
Springer
13 years 10 months ago
2008
Springer
In many industries, products are constructed by assembled surface patches in 3, where each patch is expected to have an isometric map to a corresponding region in 2. The widely in...