We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...