MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Russell Gayle" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 12 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • On the convergence of pattern search methods  
  • by Avneesh Sud, Naga Govindaraju, Russell Gayle, Dinesh Manocha — 1997 — SIAM Journal on Optimization
  • …We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point on the boundary of the mesh. We precompute a surface parameterization and use the parameterization to define an affine tra…
  • Cited by 1 (1 self)Add To MetaCart
  • Quick-VDR: Outof-core view-dependent rendering of gigantic models  
  • by Sung-eui Yoon, Brian Salomon, Russell Gayle, Dinesh Manocha — IEEE Transactions on Visualization and Computer Graphics
  • …Abstract—We present a novel approach for interactive view-dependent rendering of massive models. Our algorithm combines viewdependent simplification, occlusion culling, and out-of-core rendering. We represent the model as a clustered hierarchy of progressive meshes (CHPM). We use the cluster hierarc…
  • Cited by 4 (0 self)Add To MetaCart
  • MANOCHA D.: Quick-VDR: Interactive view-dependent rendering of massive models  
  • by Sung-eui Yoon, Brian Salomon, Russell Gayle, Dinesh Manocha — 2004 — IEEE Visualization
  • …We present a novel approach for interactive view-dependent rendering of massive models. Our algorithm combines view-dependent simplification, occlusion culling, and out-of-core rendering. We represent the model as a clustered hierarchy of progressive meshes (CHPM). We use the cluster hierarchy for c…
  • Cited by 20 (6 self)Add To MetaCart
  • Interactive 3d distance field computation using linear factorization  
  • by Avneesh Sud, Naga Govindaraju, Russell Gayle, Dinesh Manocha — 2006 — In Proc. ACM Symposium on Interactive 3D Graphics and Games
  • …We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance field for each slice of a uniform spatial grid. We express the non-linear distance function of each primitive as a dot pr…
  • Cited by 11 (4 self)Add To MetaCart
  • Constraint-based motion planning of deformable robots  
  • by Russell Gayle, Ming C. Lin, Dinesh Manocha — 2005 — In Proc. IEEE Int. Conf. Robot. Autom. (ICRA
  • …Abstract — We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm computes an approximate path using the probabilistic roadmap method. We use “constraint-based planning ” to simulate robot …
  • Cited by 1 (0 self)Add To MetaCart
  • Fast proximity computation among deformable models using discrete Voronoi diagrams  
  • by Avneesh Sud, Naga Govindaraju, Russell Gayle, Ilknur Kabul, Dinesh Manocha — 2006 — ACM Trans. Graph. (Proc ACM SIGGRAPH
  • …Figure 1: Multiple deformable models simulation: This sequence shows the positions of the objects at three time instances in a simulation. The environment initially consists of 10 deforming objects represented using 5.5K triangles. As the simulation proceeds, the objects break into 25 sub-objects. O…
  • Cited by 7 (3 self)Add To MetaCart
  • ACCELERATING LINE OF SIGHT COMPUTATION USING GRAPHICS PROCESSING UNITS  
  • by Brian Salomon, Naga Govindaraju, Avneesh Sud, Russell Gayle, Ming Lin, Dinesh Manocha
  • …We present a method to accelerate line-of- sight computation for computer generated forces (CGF) using graphics processing units (GPUs). GPUs have become commodity processors and they are part of every game console or PC system. Moreover, their performance has been increasing at a rate faster than C…
  • Add To MetaCart
  • Reactive deformation roadmaps: Motion planning of multiple robots in dynamic environments  
  • by Russell Gayle, Avneesh Sud, Ming C. Lin, Dinesh Manocha — 2007 — In Proc IEEE International Conference on Intelligent Robots and Systems
  • …Abstract — We present a novel algorithm for motion planning of multiple robots amongst dynamic obstacles. Our approach is based on a new roadmap representation that uses deformable links and dynamically retracts to capture the connectivity of the free space. We use Newtonian Physics and Hooke’s Law …
  • Cited by 2 (2 self)Add To MetaCart
  • Efficient Motion Planning of Highly Articulated Chains using Physics-based Sampling  
  • by Russell Gayle, Stephane Redon, Avneesh Sud, Ming C. Lin, Dinesh Manocha — 2007 — in "Proceedings of IEEE International Conference on Robotics and Automation
  • …Abstract — We present a novel motion planning algorithm that efficiently generates physics-based samples in a kinematically and dynamically constrained space of a highly articulated chain. Similar to prior kinodynamic planning methods, the sampled nodes in our roadmaps are generated based on dynamic…
  • Cited by 1 (0 self)Add To MetaCart
  • Path planning for deformable robots in complex environments  
  • by Russell Gayle, Paul Segars, Ming C. Lin, Dinesh Manocha — 2005 — In Robotics: Systems and Science
  • …Abstract — We present an algorithm for path planning for a flexible robot in complex environments. Our algorithm computes a collision free path by taking into account geometric and physical constraints, including obstacle avoidance, non-penetration constraint, volume preservation, surface tension, a…
  • Cited by 10 (2 self)Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB