CCCG
2007
14 years 9 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
14 years 9 months ago
2007
CCCG
2007
14 years 9 months ago
2007
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....
CCCG
2007
14 years 9 months ago
2007
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...
CCCG
2007
14 years 9 months ago
2007
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...
CCCG
2007
14 years 9 months ago
2007
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...
CCCG
2007
14 years 9 months ago
2007
CCCG
2007
14 years 9 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
CCCG
2007
14 years 9 months ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...