Sciweavers

73 search results - page 6 / 15
» Time Convex Hull with a Highway
Sort
View
IPL
2008
105views more  IPL 2008»
14 years 9 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
82
Voted
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
14 years 9 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
89
Voted
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
14 years 10 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
AVI
2006
14 years 11 months ago
Design and evaluation of a shoulder-surfing resistant graphical password scheme
When users input their passwords in a public place, they may be at risk of attackers stealing their password. An attacker can capture a password by direct observation or by record...
Susan Wiedenbeck, Jim Waters, Leonardo Sobrado, Je...
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 1 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...