67 search results - page 5 / 14 » Approximate convex decomposition of polygons |
SODA
1992
ACM
15 years 24 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
173
click to vote
DIAGRAMS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
138
click to vote
COMGEO
2002
ACM
14 years 11 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...