Sciweavers

28 search results - page 6 / 6
» Constraint satisfaction algorithms for graphical games
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
CVGIP
2006
116views more  CVGIP 2006»
13 years 4 months ago
Autonomous behaviors for interactive vehicle animations
We present a method for synthesizing animations of autonomous space, water, and land-based vehicles in games or other interactive simulations. Controlling the motion of such vehic...
Jared Go, Thuc D. Vu, James J. Kuffner
UIST
2006
ACM
13 years 10 months ago
A direct texture placement and editing interface
The creation of most models used in computer animation and computer games requires the assignment of texture coordinates, texture painting, and texture editing. We present a novel...
Yotam I. Gingold, Philip L. Davidson, Jefferson Y....