Sciweavers

106 search results - page 5 / 22
» Almost Square Packing
Sort
View
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 9 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
TOG
2002
212views more  TOG 2002»
13 years 9 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...
MSS
2010
IEEE
91views Hardware» more  MSS 2010»
13 years 8 months ago
The almost surely shrinking yolk
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key concept in the Euclidean spatial model of voting. Koehler conjectured that the yo...
Craig A. Tovey
ENDM
2010
84views more  ENDM 2010»
13 years 9 months ago
Formulation symmetries in circle packing
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
Alberto Costa, Leo Liberti, Pierre Hansen
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 8 months ago
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin