450 search results - page 17 / 90 » Quadrangulations of Planar Sets |
177
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
168
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
149
click to vote
CAGD
2008
15 years 6 months ago
2008
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
122
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
139
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...