Sciweavers

6393 search results - page 2 / 1279
» Randomized Algorithms on the Mesh
Sort
View
SPDP
1991
IEEE
13 years 8 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
FLAIRS
2010
13 years 5 months ago
Using Intelligent Agents to Build Navigation Meshes
We present a novel algorithm that allows agents to discover a navigation mesh for an environment as they move through the environment. The Navigation-Mesh Automated Discovery (NMA...
D. Hunter Hale, G. Michael Youngblood, Nikhil S. K...
GRAPHICSINTERFACE
2001
13 years 6 months ago
Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
Ryutarou Ohbuchi, Shigeo Takahashi, Takahiko Miyaz...
CAL
2008
13 years 5 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
TVCG
2011
136views more  TVCG 2011»
13 years 5 days ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai