Succint greedy routing without metric on planar triangulations.
Pierre LeoneKasun SamarasinghePublished in: CoRR (2015)
Keyphrases
- greedy algorithm
- surface patches
- metric space
- routing algorithm
- distance function
- search algorithm
- line drawings
- locally optimal
- routing problem
- ground plane
- surface reconstruction
- range images
- feature selection
- network topology
- metric learning
- euclidean distance
- shortest path
- single point
- query processing
- network topologies
- greedy heuristic
- search space
- inter domain
- greedy strategy