29 search results - page 5 / 6 » A note concerning the closest point pair algorithm |
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
DCG
2008
13 years 6 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
COMPGEOM
2009
ACM
14 years 22 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
JMM2
2006
13 years 6 months ago
2006
External perception based on vision plays a critical role in developing improved and robust localization algorithms, as well as gaining important information about the vehicle and ...
ICUIMC
2009
ACM
14 years 22 days ago
2009
ACM
This paper presents a detailed review of remote user authentication schemes with smart cards based on bilinear pairings. The first scheme regarding this was proposed by Manik et a...