A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
Kazuo IwamaEiji MiyanoPublished in: J. Algorithms (2001)
Keyphrases
- lower bound
- three dimensional
- d mesh
- upper bound
- branch and bound algorithm
- volumetric images
- worst case
- branch and bound
- multiresolution
- objective function
- d objects
- lower and upper bounds
- lower bounding
- implicit surfaces
- routing protocol
- np hard
- inter domain
- routing algorithm
- database
- sufficiently accurate
- range images
- virtual reality
- x ray
- shortest path
- special case
- polynomial approximation
- surface reconstruction
- human body
- mobile ad hoc networks
- multi view
- optimal solution
- mesh generation
- image sequences
- routing decisions
- star shaped