371 search results - page 33 / 75 » Algorithms for the transportation problem in geometric setti... |
172
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
254
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
187
click to vote
FTTCS
2006
15 years 6 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
188
click to vote
SGP
2007
15 years 8 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
170
click to vote
COMPGEOM
2009
ACM
16 years 21 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...