JDA
2010
13 years 10 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
DCG
1999
13 years 11 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
JCIT
2007
13 years 11 months ago
2007
Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...
EJC
2008
13 years 11 months ago
2008
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
SODA
1996
ACM
14 years 23 days ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
CCCG
2003
14 years 25 days ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
CCCG
2006
14 years 25 days ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
CCCG
2006
14 years 25 days ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
CCCG
2010
14 years 27 days ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...