Sciweavers

665 search results - page 125 / 133
» Algorithms for Triangulated Terrains
Sort
View
COCOON
1999
Springer
14 years 23 days ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
SI3D
2003
ACM
14 years 1 months ago
Perceptually guided simplification of lit, textured meshes
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
Nathaniel Williams, David P. Luebke, Jonathan D. C...
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
IJRR
2002
129views more  IJRR 2002»
13 years 8 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
ISER
2004
Springer
148views Robotics» more  ISER 2004»
14 years 1 months ago
The Berkeley Lower Extremity Exoskeleton Project
In October 2003, the first functional load-bearing and energetically autonomous exoskeleton, called the Berkeley Lower Extremity Exoskeleton (BLEEX) was demonstrated, walking at th...
H. Kazerooni