Amanote Research
Register
Sign In
A Fast Algorithm for Matching Planar Maps With Minimum Fréchet Distances
doi 10.1145/2835185.2835186
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2015
Authors
Junichi Shigezumi
Tatsuya Asai
Hiroaki Morikawa
Hiroya Inakoshi
Publisher
ACM Press
Related search
A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem
Production and Manufacturing Research
Industrial
Manufacturing Engineering
A Fast Matching Algorithm With Feature Points Based on NCC
Enhanced Computation Time for Fast Block Matching Algorithm
A Fast Algorithm for Estimating Transmission Probabilities in QTL Detection Designs With Dense Maps
Genetics, Selection, Evolution
Evolution
Ecology
Genetics
Systematics
Animal Science
Medicine
Behavior
Zoology
A Fast Pattern Matching Algorithm Using Changing Consecutive Characters
Journal of Software Engineering and Applications
Minimum Cost Flow Based Fast Placement Algorithm
Approximate Map Matching With Respect to the Fréchet Distance
Simulated Annealing Algorithm for the Minimum Weighted Perfect Euclidean Matching Problem
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
A Fast and Robust Algorithm for General Inequality/Equality Constrained Minimum-Time Problems
Journal of Dynamic Systems, Measurement and Control, Transactions of the ASME
Control
Systems Engineering
Information Systems
Mechanical Engineering
Instrumentation
Computer Science Applications
