In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multig...
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...
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...
Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoey...
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...