Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: fast euclidean distance transformation by propagation using multiple neighborhoods .
Euclidean Distance Mapping
CONCAVE HULL: A K-NEAREST NEIGHBOURS APPROACH FOR THE COMPUTATION OF THE REGION OCCUPIED BY A SET OF POINTS
Topology-Oriented Implementation—An Approach to Robust Geometric Algorithms
A fast nearest neighbor search algorithm by nonlinear embedding
Label Propagation through Linear Neighborhoods
The Monge-Kantorovich Optimal Transport Distance for Image Comparison
Secure nearest neighbor revisited
Approximate nearest neighbors: towards removing the curse of dimensionality
Optimizing two-pass connected-component labeling algorithms
Signed Distance Fields: A Natural Representation for Both Mapping and Planning
on centroidal voronoi tessellation - energy smoothness and fast computation .
A pipeline architecture for computing the Euler number of a binary image
A fast edge-oriented algorithm for image interpolation
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Real-time O(1) bilateral filtering
Fast Non-Local Means (NLM) Computation With Probabilistic Early Termination
Approximate nearest neighbor algorithms for Frechet distance via product metrics
A Novel Earth Mover's Distance Methodology for Image Matching with Gaussian Mixture Models
Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases
The Morphological Approach to Segmentation: The Watershed Transformation
Hybrid Beamforming for Massive MIMO: A Survey
Complexity theory
Six-Phase Fractional-Slot-per-Pole-per-Phase Permanent-Magnet Machines With Low Space Harmonics for Electric Vehicle Application
Characterizing and Predicting Viral-and-Popular Video Content
Sequential Operations in Digital Picture Processing