Sciweavers

15 search results - page 3 / 3
» Short and Smooth Polygonal Paths
Sort
View
IJRR
2008
115views more  IJRR 2008»
13 years 5 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
ACMACE
2008
ACM
13 years 7 months ago
Extracting camera-control requirements and camera movement generation in a 3D virtual environment
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
Hirofumi Hamazaki, Shinya Kitaoka, Maya Ozaki, Yos...
VVS
1998
IEEE
97views Visualization» more  VVS 1998»
13 years 9 months ago
Volume Animation Using the Skeleton Tree
In this paper, we describe a technique to animate volumes using a volumetric skeleton. The skeleton is computed from the actual volume, based on a reversible thinning procedure us...
Nikhil Gagvani, Deepak R. Kenchammana-Hosekote, De...
CVPR
2006
IEEE
14 years 7 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman
NIPS
2000
13 years 6 months ago
Machine Learning for Video-Based Rendering
We present techniques for rendering and animation of realistic scenes by analyzing and training on short video sequences. This work extends the new paradigm for computer animation...
Arno Schödl, Irfan A. Essa