Sciweavers

COMBINATORICS
2002
109views more  COMBINATORICS 2002»
13 years 10 months ago
Efficient Packing of Unit Squares in a Square
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest i...
Michael J. Kearney, Peter Shiu
JVCA
2006
87views more  JVCA 2006»
13 years 10 months ago
Interactive mesh deformation with pseudo material effects
This paper presents a novel interactive mesh deformation method that can achieve various dynamic material effects, including elastic membrane and cloth effects. In our framework, ...
Jin Huang, Hongxin Zhang, Xiaohan Shi, Xinguo Liu,...
JCO
2006
128views more  JCO 2006»
13 years 11 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
14 years 2 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
IV
2003
IEEE
92views Visualization» more  IV 2003»
14 years 4 months ago
Visualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Peter Rodgers, Paul Mutton