450 search results - page 53 / 90 » Quadrangulations of Planar Sets |
182
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
159
click to vote
SODA
1994
ACM
15 years 7 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
144
click to vote
JGAA
2008
15 years 6 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
151
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a novel compression method for multiview still images. The algorithm exploits the layer-based representation, which partitions the data set into planar layers character...
145
click to vote
ENTCS
2002
15 years 5 months ago
2002
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...