1672 search results - page 7 / 335 » Tightness problems in the plane |
JCSS
2008
13 years 7 months ago
2008
PODS
2011
ACM
12 years 10 months ago
2011
ACM
CORR
2010
Springer
13 years 4 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...
GD
2004
Springer
14 years 26 days 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...
CCCG
2008
13 years 9 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...