Sciweavers

2069 search results - page 255 / 414
» Linear time algorithms for Clobber
Sort
View
SPIRE
2009
Springer
16 years 1 months ago
Consensus Optimizing Both Distance Sum and Radius
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin...
ACSC
2007
IEEE
16 years 25 days ago
Compact Layout of Layered Trees
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
Kim Marriott, Peter Sbarski
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 24 days ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
EDUTAINMENT
2007
Springer
16 years 20 days ago
Interactive Composition of 3D Faces for Virtual Characters
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
Haeyoung Lee, Sungyeol Lee
COCOON
2001
Springer
15 years 11 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu