2342 search results - page 190 / 469 » Sublinear geometric algorithms |
122
Voted
SODA
1996
ACM
15 years 4 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
172
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
109
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a feature matching algorithm that leverages bottom-up segmentation. Unlike conventional image-toimage or region-to-region matching algorithms, our method finds corresp...
121
click to vote
GLVLSI
2007
IEEE
15 years 9 months ago
2007
IEEE
We describe an efficient, top-down strategy for overlap removal and floorplan repair which repairs overlaps in floorplans produced by placement algorithms or rough floorplanni...
135
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...