Defines rock climber and k-station distances for polygonal chains with alternating agent moves, proves equivalence to Fréchet or Hausdorff for unlimited moves, shows NP-hardness for fixed k, and gives a 2-approximation for the minimum k achieving a distance threshold.
The Fr´ echet distance revisited and extended
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Synthetic historical maps are generated from modern vector data via style transfer and uncertainty emulation to train segmentation models for historical map corpora.
citing papers explorer
-
Automatic Uncertainty-Aware Synthetic Data Bootstrapping for Historical Map Segmentation
Synthetic historical maps are generated from modern vector data via style transfer and uncertainty emulation to train segmentation models for historical map corpora.