Sciweavers

2188 search results - page 57 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 7 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
COMPGEOM
2004
ACM
14 years 2 months ago
The geometric thickness of low degree graphs
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...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Shifting Strategy for Geometric Graphs without Geometry
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 ...
Imran A. Pirwani
CCCG
2010
13 years 10 months ago
Stable roommates and geometric spanners
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...
Paz Carmi, Lilach Chaitman
ICRA
2003
IEEE
87views Robotics» more  ICRA 2003»
14 years 2 months ago
A new algorithm for three-finger force-closure grasp of polygonal objects
—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...
Jia-Wei Li, Ming-He Jin, Hong Liu