2188 search results - page 173 / 438 » Instance-Optimal Geometric Algorithms |
134
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
126
click to vote
SODA
1996
ACM
15 years 5 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...
195
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
176
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...
120
click to vote
CVPR
2010
IEEE
16 years 11 days 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...