Document

# Fréchet Distance Between a Line and Avatar Point Set

## File

LIPIcs.FSTTCS.2016.32.pdf
• Filesize: 0.57 MB
• 14 pages

## Cite As

Aritra Banik, Fahad Panolan, Venkatesh Raman, and Vibha Sahlot. Fréchet Distance Between a Line and Avatar Point Set. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.FSTTCS.2016.32

## Abstract

Frechet distance is an important geometric measure that captures the distance between two curves or more generally point sets. In this paper, we consider a natural variant of Frechet distance problem with multiple choice, provide an approximation algorithm and address its parameterized and kernelization complexity. A multiple choice problem consists of a set of color classes Q={Q_1,Q_2,...,Q_n}, where each class Q_i consists of a pair of points Q_i = {q_i, bar{q_i}}. We call a subset A subset {q_i , bar{q_i}:1 <= i <= n} conflict free if A contains at most one point from each color class. The standard objective in multiple choice problem is to select a conflict free subset that optimizes a given function. Given a line segment l and set Q of a pair of points in R^2, our objective is to find a conflict free subset that minimizes the Frechet distance between l and the point set, where the minimum is taken over all possible conflict free subsets. We first show that this problem is NP-hard, and provide a 3-approximation algorithm. Then we develop a simple randomized FPT algorithm which is later derandomized using universal family of sets. We believe that this technique can be of independent interest, and can be used to solve other parameterized multiple choice problems. The randomized algorithm runs in O(2^k * n * log^2(n)) time, and the derandomized deterministic algorithm runs in O(2^k * k^{O(log(k))} * n * log^2(n)) time, where k, the parameter, is the number of elements in the conflict free subset solution. Finally we present a simple branching algorithm for the problem running in O(2^k * n^{2} *log(n)) time. We also show that the problem is unlikely to have a polynomial sized kernel under standard complexity theoretic assumption.
##### Keywords
• Frechet Distance
• Avatar Problems
• Multiple Choice
• FPT

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, and Micha Sharir. Computing the discrete fréchet distance in subquadratic time. SIAM J. Comput., 43(2):429-449, 2014. URL: http://dx.doi.org/10.1137/130920526.
2. Pankaj K. Agarwal and Micha Sharir. Davenport-schinzel sequences and their geometric applications, 1998.
3. Helmut Alt and Michael Godau. Computing the fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl., 5:75-91, 1995. URL: http://dx.doi.org/10.1142/S0218195995000064.
4. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, and Marina Simakov. Choice is hard. In Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, pages 318-328, 2015. URL: http://dx.doi.org/10.1007/978-3-662-48971-0_28.
5. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, and Marina Simakov. Conflict-free covering. In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015. URL: http://research.cs.queensu.ca/cccg2015/CCCG15-papers/28.pdf.
6. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, and Carola Wenk. Fréchet distance for curves, revisited. In Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pages 52-63, 2006. URL: http://dx.doi.org/10.1007/11841036_8.
7. Mikhail J. Atallah. Some dynamic computational geometry problems. Computers &Mathematics with Applications, 11(12):1171-1181, 1985. URL: http://dx.doi.org/10.1016/0898-1221(85)90105-1.
8. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. On problems without polynomial kernels. J. Comput. Syst. Sci., 75(8):423-434, 2009. URL: http://dx.doi.org/10.1016/j.jcss.2009.04.001.
9. Mario E. Consuegra and Giri Narasimhan. Geometric Avatar Problems. In Anil Seth and Nisheeth K. Vishnoi, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of Leibniz International Proceedings in Informatics (LIPIcs), pages 389-400, Dagstuhl, Germany, 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.389.
10. M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized algorithms. Springer, 2015.
11. Holger Dell and Dieter van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In STOC, pages 251-260, 2010. URL: http://dx.doi.org/10.1145/1806689.1806725.
12. R. Downey and M. Fellows. Fundamentals of parameterized complexity. Springer, 2013.
13. Jeff Edmonds. How to Think About Algorithms. Cambridge University Press, New York, NY, USA, 2008.
14. Thomas Eiter and Heikki Mannila. Computing discrete fréchet distance. Technical report, Citeseer, 1994.
15. Lance Fortnow and Rahul Santhanam. Infeasibility of instance compression and succinct PCPs for NP. In STOC, pages 133-142, 2008. URL: http://dx.doi.org/10.1145/1374376.1374398.
16. P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26-30, 1935. URL: http://jlms.oxfordjournals.org/content/s1-10/1/26.short, http://arxiv.org/abs/http://jlms.oxfordjournals.org/content/s1-10/1/26.full.pdf+html, URL: http://dx.doi.org/10.1112/jlms/s1-10.37.26.
17. John Hershberger. Finding the upper envelope of n line segments in o(n log n) time. Information Processing Letters, 33(4):169-174, 1989. URL: http://dx.doi.org/10.1016/0020-0190(89)90136-1.
18. Moni Naor, Leonard J. Schulman, and Aravind Srinivasan. Splitters and near-optimal derandomization. In 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, 23-25 October 1995, pages 182-191, 1995. URL: http://dx.doi.org/10.1109/SFCS.1995.492475.
19. Kaveh Shahbaz. Applied similarity problems using fréchet distance. CoRR, abs/1307.6628, 2013. URL: http://arxiv.org/abs/1307.6628.
X

Feedback for Dagstuhl Publishing