Fréchet distance between a line and avatar point set

DOI10.1007/s00453-017-0352-yzbMath1391.68105OpenAlexW2742748487MaRDI QIDQ722543

Aritra Banik, Venkatesh Raman, Vibha Sahlot, Fahad Panolan

Publication date: 26 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6867/

zbMATH Keywords

Fréchet distanceFPTmultiple choiceavatar problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Conflict free version of covering problems on graphs: classical and parameterized ⋮ Parameterized complexity of conflict-free set cover ⋮ Parameterized complexity of geometric covering problems having conflicts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Finding the upper envelope of n line segments in O(n log n) time
• On problems without polynomial kernels
• Some dynamic computational geometry problems
• Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
• Geometric Avatar Problems
• Choice Is Hard
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• How to Think About Algorithms
• Fréchet Distance for Curves, Revisited
• Computing the Discrete Fréchet Distance in Subquadratic Time
• Parameterized Algorithms

This page was built for publication: Fréchet distance between a line and avatar point set