233 search results - page 25 / 47 » cccg 2007 |
CCCG
2007
13 years 8 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
CCCG
2007
13 years 8 months ago
2007
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...
CCCG
2007
13 years 8 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
CCCG
2007
13 years 8 months ago
2007
For every n, we construct two arcs in the four-punctured sphere that have at least n intersections and which do not form spirals. This is accomplished in several steps: we first ...
CCCG
2007
13 years 8 months ago
2007
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...