484 search results - page 1 / 97 » The number of convex permutominoes |
IANDC
2008
13 years 4 months ago
2008
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...
COMBINATORICS
2007
13 years 4 months ago
2007
SIAMDM
2010
13 years 3 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...