1672 search results - page 7 / 335 » Tightness problems in the plane |
96
Voted
JCSS
2008
15 years 1 months ago
2008
118
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
107
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
122
click to vote
CCCG
2008
15 years 3 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...