Sciweavers

1017 search results - page 1 / 204
» Some existence and construction results of polygonal designs
Sort
View
EJC
2008
13 years 4 months ago
Some existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
Gargi Bhattacharyya, John Hegeman, Joohyung Kim, J...
COMPGEOM
1999
ACM
13 years 8 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
DCC
2005
IEEE
14 years 3 months ago
On the Existence of Large Sets of t-designs of Prime Sizes
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive ...
Behruz Tayfeh-Rezaie
IV
2009
IEEE
191views Visualization» more  IV 2009»
13 years 11 months ago
Some Results for Drawing Area Proportional Venn3 With Convex Curves
Many data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diag...
Peter Rodgers, Jean Flower, Gem Stapleton, John Ho...
DM
2006
128views more  DM 2006»
13 years 4 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck