COMBINATORICS

2002

13 years 10 months ago
2002

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...

JVCA

2006

13 years 11 months ago
2006

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, ...

JCO

2006

13 years 11 months ago
2006

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...

ESA

2006

Springer

14 years 2 months ago
2006

Springer

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...

32

Voted
IV

2003

IEEE

14 years 4 months ago
2003

IEEE

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...