Sciweavers

1215 search results - page 222 / 243
» Combinatorics
Sort
View
VISUALIZATION
2003
IEEE
15 years 11 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton
COCOON
2003
Springer
15 years 11 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
COCOON
2003
Springer
15 years 11 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...
COCOON
2003
Springer
15 years 11 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
COCOON
2003
Springer
15 years 11 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno