2342 search results - page 70 / 469 » Sublinear geometric algorithms |
107
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
112
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
CCCG
2010
15 years 2 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
78
Voted
ICRA
2003
IEEE
15 years 6 months ago
2003
IEEE
—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal ob...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...