Titlebook: ;

鄙視

Reconstructing Generalized Staircase Polygons with Uniform Step Lengthally convex polygons, where . and . are the number of vertices and edges in the visibility graph, respectively. We further show that reconstructing a monotone chain of staircases (a histogram) is fixed-parameter tractable, when parameterized on the number of tabs, and polynomially solvable in time . under reasonable alignment restrictions.

無法取消

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawingsersion of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.

生命

Aligned Drawings of Planar Graphsolyline drawing . of . with an arrangement . of lines so that . and . are homeomorphic to . and .. We show that if . is stretchable and every edge . either entirely lies on a pseudoline or intersects at most one pseudoline, then . and . have a straight-line aligned drawing. In order to prove these r

泥土謙卑

使苦惱

cornucopia

最后一個(gè)

aerial

不能仁慈

wreathe