Routing by matching on convex pieces of grid graphs.
Hannah AlpertRussell J. BarnesSeth BellAnna MauroNa'ama NevoNataya TuckerHanna YangPublished in: Comput. Geom. (2022)
Keyphrases
- graph matching
- maximum cardinality
- matching algorithm
- subgraph isomorphism
- attributed relational graph
- image matching
- point sets
- graph theoretic
- convex hull
- directed graph
- bipartite graph
- grid points
- series parallel
- graph partitioning
- routing problem
- piecewise linear
- matching process
- object recognition
- convex optimization
- routing protocol
- keypoints
- graph matching algorithm
- network topology
- shape decomposition
- globally optimal
- pattern matching
- feature points