Sciweavers

9659 search results - page 349 / 1932
» Points on Computable Curves
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
16 years 10 days ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
CHI
2010
ACM
16 years 5 days ago
Steadied-bubbles: combining techniques to address pen-based pointing errors for younger and older adults
Tablet PCs are gaining popularity but many older adults still struggle with pointing, particularly with two error types: missing, landing and lifting outside the target bounds; an...
Karyn Moffatt, Joanna McGrenere
CAIP
1995
Springer
137views Image Analysis» more  CAIP 1995»
15 years 10 months ago
Extending the Point Distribution Model Using Polar Coordinates
The Point Distribution Model (PDM) has already proved useful for many tasks involving the location or tracking of deformable objects. A principal limitation lies in the fact that n...
Tony Heap, David Hogg
CCCG
2009
15 years 8 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
COMGEO
2011
ACM
15 years 1 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...