QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Agarwal, P.K., Avraham, R.B., Kaplan, H. & Sharir, M. Computing the Discrete Fréchet Distance in Subquadratic Time

    [BibTeX]

    		 2014 SIAM J. Comput.
    Vol. 43(2), pp. 429-449     		 article DOI URL 
    BibTeX: 
    @article{AgarwalAKS14,
  author = {Pankaj K. Agarwal and Rinat Ben Avraham and Haim Kaplan and Micha Sharir},
  title = {Computing the Discrete Fréchet Distance in Subquadratic Time},
  journal = {SIAM J. Comput.},
  year = {2014},
  volume = {43},
  number = {2},
  pages = {429--449},
  url = {http://dx.doi.org/10.1137/130920526},
  doi = {http://dx.doi.org/10.1137/130920526}
}
    Agarwal, P.K., Har-Peled, S., Mustafa, N.H. & Wang, Y. Near-Linear Time Approximation Algorithms for Curve Simplification

    [BibTeX]

    		 2005 Algorithmica
    Vol. 42(3-4), pp. 203-219     		 article DOI URL 
    BibTeX: 
    @article{AgarwalHMW05,
  author = {Pankaj K. Agarwal and Sariel Har-Peled and Nabil H. Mustafa and Yusu Wang},
  title = {Near-Linear Time Approximation Algorithms for Curve Simplification},
  journal = {Algorithmica},
  year = {2005},
  volume = {42},
  number = {3-4},
  pages = {203--219},
  url = {http://dx.doi.org/10.1007/s00453-005-1165-y},
  doi = {http://dx.doi.org/10.1007/s00453-005-1165-y}
}
    Ahn, H., Knauer, C., Scherfenberg, M., Schlipf, L. & Vigneron, A. Computing the Discrete Fréchet Distance with Imprecise Input

    [BibTeX]

    		 2012 Int. J. Comput. Geometry Appl.
    Vol. 22(1), pp. 27-44     		 article DOI URL 
    BibTeX: 
    @article{AhnKSSV12,
  author = {Hee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron},
  title = {Computing the Discrete Fréchet Distance with Imprecise Input},
  journal = {Int. J. Comput. Geometry Appl.},
  year = {2012},
  volume = {22},
  number = {1},
  pages = {27--44},
  url = {http://dx.doi.org/10.1142/S0218195912600023},
  doi = {http://dx.doi.org/10.1142/S0218195912600023}
}
    Alt, H., Efrat, A., Rote, Gü. & Wenk, C. Matching planar maps

    [BibTeX]

    		 2003 J. Algorithms
    Vol. 49(2), pp. 262-283     		 article DOI URL 
    BibTeX: 
    @article{AltERW03,
  author = {Helmut Alt and Alon Efrat and Günter Rote and Carola Wenk},
  title = {Matching planar maps},
  journal = {J. Algorithms},
  year = {2003},
  volume = {49},
  number = {2},
  pages = {262--283},
  url = {http://dx.doi.org/10.1016/S0196-6774(03)00085-3},
  doi = {http://dx.doi.org/10.1016/S0196-6774(03)00085-3}
}
    Alt, H. & Godau, M. Computing the Fréchet distance between two polygonal curves

    [BibTeX]

    		 1995 Int. J. Comput. Geometry Appl.
    Vol. 5, pp. 75-91     		 article DOI URL 
    BibTeX: 
    @article{AltG95,
  author = {Helmut Alt and Michael Godau},
  title = {Computing the Fréchet distance between two polygonal curves},
  journal = {Int. J. Comput. Geometry Appl.},
  year = {1995},
  volume = {5},
  pages = {75--91},
  url = {http://dx.doi.org/10.1142/S0218195995000064},
  doi = {http://dx.doi.org/10.1142/S0218195995000064}
}
    Alt, H. & Godau, M. Measuring the Resemblance of Polygonal Curves

    [BibTeX]

    		 1992 Symposium on Computational Geometry, pp. 102-109  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{AltG92,
  author = {Helmut Alt and Michael Godau},
  title = {Measuring the Resemblance of Polygonal Curves},
  booktitle = {Symposium on Computational Geometry},
  year = {1992},
  pages = {102--109},
  url = {http://doi.acm.org/10.1145/142675.142699},
  doi = {http://dx.doi.org/10.1145/142675.142699}
}
    Alt, H., Knauer, C. & Wenk, C. Matching Polygonal Curves with Respect to the Fréchet Distance

    [BibTeX]

    		 2001 STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 63-74  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{AltKW01,
  author = {Helmut Alt and Christian Knauer and Carola Wenk},
  title = {Matching Polygonal Curves with Respect to the Fréchet Distance},
  booktitle = {STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings},
  year = {2001},
  pages = {63--74},
  url = {http://dx.doi.org/10.1007/3-540-44693-1_6},
  doi = {http://dx.doi.org/10.1007/3-540-44693-1_6}
}
    Aronov, B., Har-Peled, S., Knauer, C., Wang, Y. & Wenk, C. Fréchet Distance for Curves, Revisited

    [BibTeX]

    		 2006 Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 52-63  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{AronovHKWW06,
  author = {Boris Aronov and Sariel Har-Peled and Christian Knauer and Yusu Wang and Carola Wenk},
  title = {Fréchet Distance for Curves, Revisited},
  booktitle = {Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings},
  year = {2006},
  pages = {52--63},
  url = {http://dx.doi.org/10.1007/11841036_8},
  doi = {http://dx.doi.org/10.1007/11841036_8}
}
    Avraham, R.B., Filtser, O., Kaplan, H., Katz, M.J. & Sharir, M. The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection

    [BibTeX]

    		 2014 30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014, pp. 377  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{AvrahamFKKS14,
  author = {Rinat Ben Avraham and Omrit Filtser and Haim Kaplan and Matthew J. Katz and Micha Sharir},
  title = {The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection},
  booktitle = {30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014},
  year = {2014},
  pages = {377},
  url = {http://doi.acm.org/10.1145/2582112.2582155},
  doi = {http://dx.doi.org/10.1145/2582112.2582155}
}
    Avraham, R.B., Kaplan, H. & Sharir, M. A faster algorithm for the discrete Fréchet distance under translation

    [BibTeX]

    		 2015 CoRR
    Vol. abs/1501.03724     		 article URL 
    BibTeX: 
    @article{AvrahamKS15,
  author = {Rinat Ben Avraham and Haim Kaplan and Micha Sharir},
  title = {A faster algorithm for the discrete Fréchet distance under translation},
  journal = {CoRR},
  year = {2015},
  volume = {abs/1501.03724},
  url = {http://arxiv.org/abs/1501.03724}
}
    Bereg, S., Jiang, M., Wang, W., Yang, B. & Zhu, B. Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

    [BibTeX]

    		 2008 LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 630-641  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{BeregJWYZ08,
  author = {Sergey Bereg and Minghui Jiang and Wencheng Wang and Boting Yang and Binhai Zhu},
  title = {Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance},
  booktitle = {LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings},
  year = {2008},
  pages = {630--641},
  url = {http://dx.doi.org/10.1007/978-3-540-78773-0_54},
  doi = {http://dx.doi.org/10.1007/978-3-540-78773-0_54}
}
    Bespamyatnikh, S. & Segal, M. Fast Algorithms for Approximating Distances

    [BibTeX]

    		 2002 Algorithmica
    Vol. 33(2), pp. 263-269     		 article DOI URL 
    BibTeX: 
    @article{BespamyatnikhS02,
  author = {Sergei Bespamyatnikh and Michael Segal},
  title = {Fast Algorithms for Approximating Distances},
  journal = {Algorithmica},
  year = {2002},
  volume = {33},
  number = {2},
  pages = {263--269},
  url = {http://dx.doi.org/10.1007/s00453-001-0114-7},
  doi = {http://dx.doi.org/10.1007/s00453-001-0114-7}
}
    Brakatsoulas, S., Pfoser, D., Salas, R. & Wenk, C. On Map-Matching Vehicle Tracking Data

    [BibTeX]

    		 2005 Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005, pp. 853-864  inproceedings URL 
    BibTeX: 
    @inproceedings{BrakatsoulasPSW05,
  author = {Sotiris Brakatsoulas and Dieter Pfoser and Randall Salas and Carola Wenk},
  title = {On Map-Matching Vehicle Tracking Data},
  booktitle = {Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005},
  year = {2005},
  pages = {853--864},
  url = {http://www.vldb2005.org/program/paper/fri/p853-brakatsoulas.pdf}
}
    Bringmann, K. Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails

    [BibTeX]

    		 2014 CoRR
    Vol. abs/1404.1448     		 article URL 
    BibTeX: 
    @article{Bringmann14,
  author = {Karl Bringmann},
  title = {Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails},
  journal = {CoRR},
  year = {2014},
  volume = {abs/1404.1448},
  url = {http://arxiv.org/abs/1404.1448}
}
    Buchin, K., Buchin, M. & Gudmundsson, J. Detecting single file movement

    [BibTeX]

    		 2008 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, pp. 33  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{BuchinBG08,
  author = {Kevin Buchin and Maike Buchin and Joachim Gudmundsson},
  title = {Detecting single file movement},
  booktitle = {16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings},
  year = {2008},
  pages = {33},
  url = {http://doi.acm.org/10.1145/1463434.1463476},
  doi = {http://dx.doi.org/10.1145/1463434.1463476}
}
    Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M. & Luo, J. Detecting Commuting Patterns by Clustering Subtrajectories

    [BibTeX]

    		 2011 Int. J. Comput. Geometry Appl.
    Vol. 21(3), pp. 253-282     		 article DOI URL 
    BibTeX: 
    @article{BuchinBGLL11,
  author = {Kevin Buchin and Maike Buchin and Joachim Gudmundsson and Maarten Löffler and Jun Luo},
  title = {Detecting Commuting Patterns by Clustering Subtrajectories},
  journal = {Int. J. Comput. Geometry Appl.},
  year = {2011},
  volume = {21},
  number = {3},
  pages = {253--282},
  url = {http://dx.doi.org/10.1142/S0218195911003652},
  doi = {http://dx.doi.org/10.1142/S0218195911003652}
}
    Buchin, K., Buchin, M., van Kreveld, M.J., Löffler, M., Silveira, R.I., Wenk, C. & Wiratma, L. Median Trajectories

    [BibTeX]

    		 2013 Algorithmica
    Vol. 66(3), pp. 595-614     		 article DOI URL 
    BibTeX: 
    @article{BuchinBKLSWW13,
  author = {Kevin Buchin and Maike Buchin and Marc J. van Kreveld and Maarten Löffler and Rodrigo I. Silveira and Carola Wenk and Lionov Wiratma},
  title = {Median Trajectories},
  journal = {Algorithmica},
  year = {2013},
  volume = {66},
  number = {3},
  pages = {595--614},
  url = {http://dx.doi.org/10.1007/s00453-012-9654-2},
  doi = {http://dx.doi.org/10.1007/s00453-012-9654-2}
}
    Buchin, K., Buchin, M., Meulemans, W. & Mulzer, W. Four Soviets Walk the Dog - with an Application to Alt's Conjecture

    [BibTeX]

    		 2014 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pp. 1399-1413  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{BuchinBMM14,
  author = {Kevin Buchin and Maike Buchin and Wouter Meulemans and Wolfgang Mulzer},
  title = {Four Soviets Walk the Dog - with an Application to Alt's Conjecture},
  booktitle = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014},
  year = {2014},
  pages = {1399--1413},
  url = {http://dx.doi.org/10.1137/1.9781611973402.103},
  doi = {http://dx.doi.org/10.1137/1.9781611973402.103}
}
    Buchin, K., Buchin, M., Meulemans, W. & Speckmann, B. Locally Correct Fréchet Matchings

    [BibTeX]

    		 2012 Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 229-240  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{BuchinBMS12,
  author = {Kevin Buchin and Maike Buchin and Wouter Meulemans and Bettina Speckmann},
  title = {Locally Correct Fréchet Matchings},
  booktitle = {Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
  year = {2012},
  pages = {229--240},
  url = {http://dx.doi.org/10.1007/978-3-642-33090-2_21},
  doi = {http://dx.doi.org/10.1007/978-3-642-33090-2_21}
}
    Buchin, K., Buchin, M. & Wang, Y. Exact algorithms for partial curve matching via the Fréchet distance

    [BibTeX]

    		 2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 645-654  inproceedings URL 
    BibTeX: 
    @inproceedings{BuchinBW09,
  author = {Kevin Buchin and Maike Buchin and Yusu Wang},
  title = {Exact algorithms for partial curve matching via the Fréchet distance},
  booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009},
  year = {2009},
  pages = {645--654},
  url = {http://dl.acm.org/citation.cfm?id=1496770.1496841}
}
    Buchin, M., Driemel, A. & Speckmann, B. Computing the Fréchet distance with shortcuts is NP-hard

    [BibTeX]

    		 2014 30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014, pp. 367  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{BuchinDS14,
  author = {Maike Buchin and Anne Driemel and Bettina Speckmann},
  title = {Computing the Fréchet distance with shortcuts is NP-hard},
  booktitle = {30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014},
  year = {2014},
  pages = {367},
  url = {http://doi.acm.org/10.1145/2582112.2582144},
  doi = {http://dx.doi.org/10.1145/2582112.2582144}
}
    Chambers, E.W., de Verdière, É.C., Erickson, J., Lazard, S., Lazarus, F. & Thite, S. Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time

    [BibTeX]

    		 2010 Comput. Geom.
    Vol. 43(3), pp. 295-311     		 article DOI URL 
    BibTeX: 
    @article{ChambersVELLT10,
  author = {Erin W. Chambers and Éric Colin de Verdière and Jeff Erickson and Sylvain Lazard and Francis Lazarus and Shripad Thite},
  title = {Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time},
  journal = {Comput. Geom.},
  year = {2010},
  volume = {43},
  number = {3},
  pages = {295--311},
  url = {http://dx.doi.org/10.1016/j.comgeo.2009.02.008},
  doi = {http://dx.doi.org/10.1016/j.comgeo.2009.02.008}
}
    Chazelle, B. Cutting Hyperplanes for Divide-and-Conquer

    [BibTeX]

    		 1993 Discrete & Computational Geometry
    Vol. 9, pp. 145-158     		 article DOI URL 
    BibTeX: 
    @article{Chazelle93a,
  author = {Bernard Chazelle},
  title = {Cutting Hyperplanes for Divide-and-Conquer},
  journal = {Discrete & Computational Geometry},
  year = {1993},
  volume = {9},
  pages = {145--158},
  url = {http://dx.doi.org/10.1007/BF02189314},
  doi = {http://dx.doi.org/10.1007/BF02189314}
}
    Chazelle, B. & Friedman, J. A deterministic view of random sampling and its use in geometry

    [BibTeX]

    		 1990 Combinatorica
    Vol. 10(3), pp. 229-249     		 article DOI URL 
    BibTeX: 
    @article{ChazelleF90,
  author = {Bernard Chazelle and Joel Friedman},
  title = {A deterministic view of random sampling and its use in geometry},
  journal = {Combinatorica},
  year = {1990},
  volume = {10},
  number = {3},
  pages = {229--249},
  url = {http://dx.doi.org/10.1007/BF02122778},
  doi = {http://dx.doi.org/10.1007/BF02122778}
}
    Chen, D., Driemel, A., Guibas, L.J., Nguyen, A. & Wenk, C. Approximate Map Matching with respect to the Fréchet Distance

    [BibTeX]

    		 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011, pp. 75-83  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{ChenDGNW11,
  author = {Daniel Chen and Anne Driemel and Leonidas J. Guibas and Andy Nguyen and Carola Wenk},
  title = {Approximate Map Matching with respect to the Fréchet Distance},
  booktitle = {Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011},
  year = {2011},
  pages = {75--83},
  url = {http://dx.doi.org/10.1137/1.9781611972917.8},
  doi = {http://dx.doi.org/10.1137/1.9781611972917.8}
}
    Cook, A.F. & Wenk, C. Geodesic Fréchet Distance Inside a Simple Polygon

    [BibTeX]

    		 2008 STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 193-204  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{WenkC08,
  author = {Atlas F. Cook and Carola Wenk},
  title = {Geodesic Fréchet Distance Inside a Simple Polygon},
  booktitle = {STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings},
  year = {2008},
  pages = {193--204},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1330},
  doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1330}
}
    Dorrigiv, R., Durocher, S., Farzan, A., Fraser, R., López-Ortiz, A., Munro, J.I., Salinger, A. & Skala, M. Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance

    [BibTeX]

    		 2009 Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 218-229  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{DorrigivDFFLMSS09,
  author = {Reza Dorrigiv and Stephane Durocher and Arash Farzan and Robert Fraser and Alejandro López-Ortiz and J. Ian Munro and Alejandro Salinger and Matthew Skala},
  title = {Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance},
  booktitle = {Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings},
  year = {2009},
  pages = {218--229},
  url = {http://dx.doi.org/10.1007/978-3-642-03367-4_20},
  doi = {http://dx.doi.org/10.1007/978-3-642-03367-4_20}
}
    Driemel, A. Realistic Analysis for Algorithmic Problems on Geographical Data

    [BibTeX]

    		 2013 School: Utrecht University  phdthesis  
    BibTeX: 
    @phdthesis{Driemel13,
  author = {Driemel, Anne},
  title = {Realistic Analysis for Algorithmic Problems on Geographical Data},
  school = {Utrecht University},
  year = {2013}
}
    Driemel, A. & Har-Peled, S. Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts

    [BibTeX]

    		 2013 SIAM J. Comput.
    Vol. 42(5), pp. 1830-1866     		 article DOI URL 
    BibTeX: 
    @article{DriemelH13,
  author = {Anne Driemel and Sariel Har-Peled},
  title = {Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts},
  journal = {SIAM J. Comput.},
  year = {2013},
  volume = {42},
  number = {5},
  pages = {1830--1866},
  url = {http://dx.doi.org/10.1137/120865112},
  doi = {http://dx.doi.org/10.1137/120865112}
}
    Driemel, A., Har-Peled, S. & Wenk, C. Approximating the Fréchet Distance for Realistic Curves in Near Linear Time

    [BibTeX]

    		 2012 Discrete & Computational Geometry
    Vol. 48(1), pp. 94-127     		 article DOI URL 
    BibTeX: 
    @article{DriemelHW12,
  author = {Anne Driemel and Sariel Har-Peled and Carola Wenk},
  title = {Approximating the Fréchet Distance for Realistic Curves in Near Linear Time},
  journal = {Discrete & Computational Geometry},
  year = {2012},
  volume = {48},
  number = {1},
  pages = {94--127},
  url = {http://dx.doi.org/10.1007/s00454-012-9402-z},
  doi = {http://dx.doi.org/10.1007/s00454-012-9402-z}
}
    Dumitrescu, A. & Rote, Gü. On the Fréchet distance of a set of curves

    [BibTeX]

    		 2004 Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG'04, Concordia University, Montréal, Québec, Canada, August 9-11, 2004, pp. 162-165  inproceedings URL 
    BibTeX: 
    @inproceedings{DumitrescuR04,
  author = {Adrian Dumitrescu and Günter Rote},
  title = {On the Fréchet distance of a set of curves},
  booktitle = {Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG'04, Concordia University, Montréal, Québec, Canada, August 9-11, 2004},
  year = {2004},
  pages = {162--165},
  url = {http://www.cccg.ca/proceedings/2004/39.pdf}
}
    Eiter, T. & Mannila, H. Computing discrete Fréchet distance

    [BibTeX]

    		 1994 (CD-TR 94/64)  techreport  
    BibTeX: 
    @techreport{EiterM94,
  author = {Eiter, Thomas and Mannila, Heikki},
  title = {Computing discrete Fréchet distance},
  year = {1994},
  number = {CD-TR 94/64}
}
    Fan, C., Filtser, O., Katz, M.J., Wylie, T. & Zhu, B. On the Chain Pair Simplification Problem

    [BibTeX]

    		 2015 Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pp. 351-362  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{FanFKWZ15,
  author = {Chenglin Fan and Omrit Filtser and Matthew J. Katz and Tim Wylie and Binhai Zhu},
  title = {On the Chain Pair Simplification Problem},
  booktitle = {Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
  year = {2015},
  pages = {351--362},
  url = {http://dx.doi.org/10.1007/978-3-319-21840-3_29},
  doi = {http://dx.doi.org/10.1007/978-3-319-21840-3_29}
}
    Frechet, M. Sur quelques points du calcul fonctionnel

    [BibTeX]

    		 1906 Rendiconti del Circolo Matematico di Palermo (1884 - 1940)
    Vol. 22(1), pp. 1-72     		 article DOI URL 
    BibTeX: 
    @article{Frechet1906,
  author = {Frechet, Maurice},
  title = {Sur quelques points du calcul fonctionnel},
  journal = {Rendiconti del Circolo Matematico di Palermo (1884 - 1940)},
  year = {1906},
  volume = {22},
  number = {1},
  pages = {1--72},
  url = {http://dx.doi.org/10.1007/BF03018603},
  doi = {http://dx.doi.org/10.1007/BF03018603}
}
    Godau, M. A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms

    [BibTeX]

    		 1991 STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pp. 127-136  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{Godau91,
  author = {Michael Godau},
  title = {A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms},
  booktitle = {STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  year = {1991},
  pages = {127--136},
  url = {http://dx.doi.org/10.1007/BFb0020793},
  doi = {http://dx.doi.org/10.1007/BFb0020793}
}
    Har-Peled, S. & Raichel, B. The frechet distance revisited and extended

    [BibTeX]

    		 2011 Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011, pp. 448-457  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{Har-PeledR11,
  author = {Sariel Har-Peled and Benjamin Raichel},
  title = {The frechet distance revisited and extended},
  booktitle = {Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011},
  year = {2011},
  pages = {448--457},
  url = {http://doi.acm.org/10.1145/1998196.1998269},
  doi = {http://dx.doi.org/10.1145/1998196.1998269}
}
    Har-Peled, S. & Raichel, B.A. Net and prune: a linear time algorithm for euclidean distance problems

    [BibTeX]

    		 2013 Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pp. 605-614  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{Har-PeledR13,
  author = {Sariel Har-Peled and Benjamin Adam Raichel},
  title = {Net and prune: a linear time algorithm for euclidean distance problems},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
  year = {2013},
  pages = {605--614},
  url = {http://doi.acm.org/10.1145/2488608.2488684},
  doi = {http://dx.doi.org/10.1145/2488608.2488684}
}
    Har-Peled, S. & Sharir, M. Relative (p, epsilon)-Approximations in Geometry

    [BibTeX]

    		 2011 Discrete & Computational Geometry
    Vol. 45(3), pp. 462-496     		 article DOI URL 
    BibTeX: 
    @article{Har-PeledS11,
  author = {Sariel Har-Peled and Micha Sharir},
  title = {Relative (p, epsilon)-Approximations in Geometry},
  journal = {Discrete & Computational Geometry},
  year = {2011},
  volume = {45},
  number = {3},
  pages = {462--496},
  url = {http://dx.doi.org/10.1007/s00454-010-9248-1},
  doi = {http://dx.doi.org/10.1007/s00454-010-9248-1}
}
    Jiang, M., Xu, Y. & Zhu, B. Protein Structure-structure Alignment with Discrete FrÉchet Distance

    [BibTeX]

    		 2008 J. Bioinformatics and Computational Biology
    Vol. 6(1), pp. 51-64     		 article DOI URL 
    BibTeX: 
    @article{JiangXZ08,
  author = {Minghui Jiang and Ying Xu and Binhai Zhu},
  title = {Protein Structure-structure Alignment with Discrete FrÉchet Distance},
  journal = {J. Bioinformatics and Computational Biology},
  year = {2008},
  volume = {6},
  number = {1},
  pages = {51--64},
  url = {http://dx.doi.org/10.1142/S0219720008003278},
  doi = {http://dx.doi.org/10.1142/S0219720008003278}
}
    Katz, M.J. & Sharir, M. An Expander-Based Approach to Geometric Optimization

    [BibTeX]

    		 1997 SIAM J. Comput.
    Vol. 26(5), pp. 1384-1408     		 article DOI URL 
    BibTeX: 
    @article{KatzS97,
  author = {Matthew J. Katz and Micha Sharir},
  title = {An Expander-Based Approach to Geometric Optimization},
  journal = {SIAM J. Comput.},
  year = {1997},
  volume = {26},
  number = {5},
  pages = {1384--1408},
  url = {http://dx.doi.org/10.1137/S0097539794268649},
  doi = {http://dx.doi.org/10.1137/S0097539794268649}
}
    Kim, M., Kim, S. & Shin, M. Optimization of subsequence matching under time warping in time-series databases

    [BibTeX]

    		 2005 Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 581-586  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{KimKS05,
  author = {Man-Soon Kim and Sang-Wook Kim and Miyoung Shin},
  title = {Optimization of subsequence matching under time warping in time-series databases},
  booktitle = {Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005},
  year = {2005},
  pages = {581--586},
  url = {http://doi.acm.org/10.1145/1066677.1066814},
  doi = {http://dx.doi.org/10.1145/1066677.1066814}
}
    van Kreveld, M.J. & Wiratma, L. Median trajectories using well-visited regions and shortest paths

    [BibTeX]

    		 2011 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2011, November 1-4, 2011, Chicago, IL, USA, Proceedings, pp. 241-250  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{KreveldW11,
  author = {Marc J. van Kreveld and Lionov Wiratma},
  title = {Median trajectories using well-visited regions and shortest paths},
  booktitle = {19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2011, November 1-4, 2011, Chicago, IL, USA, Proceedings},
  year = {2011},
  pages = {241--250},
  url = {http://doi.acm.org/10.1145/2093973.2094006},
  doi = {http://dx.doi.org/10.1145/2093973.2094006}
}
    Kwong, S., He, Q., Man, K., Chau, C. & Tang, K. Parallel Genetic-Based Hybrid Pattern Matching Algorithm for Isolated Word Recognition

    [BibTeX]

    		 1998 IJPRAI
    Vol. 12(4), pp. 573-594     		 article DOI URL 
    BibTeX: 
    @article{KwongHMCT98,
  author = {Sam Kwong and Qianhua He and Kim-Fung Man and Chak-Wai Chau and Kit-Sang Tang},
  title = {Parallel Genetic-Based Hybrid Pattern Matching Algorithm for Isolated Word Recognition},
  journal = {IJPRAI},
  year = {1998},
  volume = {12},
  number = {4},
  pages = {573--594},
  url = {http://dx.doi.org/10.1142/S0218001498000348},
  doi = {http://dx.doi.org/10.1142/S0218001498000348}
}
    Li, Y., Long, P.M. & Srinivasan, A. Improved Bounds on the Sample Complexity of Learning

    [BibTeX]

    		 2001 J. Comput. Syst. Sci.
    Vol. 62(3), pp. 516-527     		 article DOI URL 
    BibTeX: 
    @article{LiLS01,
  author = {Yi Li and Philip M. Long and Aravind Srinivasan},
  title = {Improved Bounds on the Sample Complexity of Learning},
  journal = {J. Comput. Syst. Sci.},
  year = {2001},
  volume = {62},
  number = {3},
  pages = {516--527},
  url = {http://dx.doi.org/10.1006/jcss.2000.1741},
  doi = {http://dx.doi.org/10.1006/jcss.2000.1741}
}
    Matousek, J. Cutting Hyperplane Arrangements

    [BibTeX]

    		 1991 Discrete & Computational Geometry
    Vol. 6, pp. 385-406     		 article DOI URL 
    BibTeX: 
    @article{Matousek91a,
  author = {Jir Matousek},
  title = {Cutting Hyperplane Arrangements},
  journal = {Discrete & Computational Geometry},
  year = {1991},
  volume = {6},
  pages = {385--406},
  url = {http://dx.doi.org/10.1007/BF02574697},
  doi = {http://dx.doi.org/10.1007/BF02574697}
}
    Mosig, A. & Clausen, M. Approximately matching polygonal curves with respect to the Fre'chet distance

    [BibTeX]

    		 2005 Comput. Geom.
    Vol. 30(2), pp. 113-127     		 article DOI URL 
    BibTeX: 
    @article{MosigC05,
  author = {Axel Mosig and Michael Clausen},
  title = {Approximately matching polygonal curves with respect to the Fre'chet distance},
  journal = {Comput. Geom.},
  year = {2005},
  volume = {30},
  number = {2},
  pages = {113--127},
  url = {http://dx.doi.org/10.1016/j.comgeo.2004.05.004},
  doi = {http://dx.doi.org/10.1016/j.comgeo.2004.05.004}
}
    Munich, M.E. & Perona, P. Continuous Dynamic Time Warping for Translation-Invariant Curve Alignment with Applications to Signature Verification

    [BibTeX]

    		 1999 ICCV, pp. 108-115  inproceedings URL 
    BibTeX: 
    @inproceedings{MunichP99,
  author = {Mario E. Munich and Pietro Perona},
  title = {Continuous Dynamic Time Warping for Translation-Invariant Curve Alignment with Applications to Signature Verification},
  booktitle = {ICCV},
  year = {1999},
  pages = {108--115},
  url = {http://computer.org/proceedings/iccv/0164/vol%201/01640108abs.htm}
}
    Sharir, M. & Shaul, H. Semialgebraic Range Reporting and Emptiness Searching with Applications

    [BibTeX]

    		 2011 SIAM J. Comput.
    Vol. 40(4), pp. 1045-1074     		 article DOI URL 
    BibTeX: 
    @article{SharirS11,
  author = {Micha Sharir and Hayim Shaul},
  title = {Semialgebraic Range Reporting and Emptiness Searching with Applications},
  journal = {SIAM J. Comput.},
  year = {2011},
  volume = {40},
  number = {4},
  pages = {1045--1074},
  url = {http://dx.doi.org/10.1137/090765092},
  doi = {http://dx.doi.org/10.1137/090765092}
}
    Wenk, C. Shape matching in higher dimensions

    [BibTeX]

    		 2002 School: FU Berlin  phdthesis  
    BibTeX: 
    @phdthesis{Wenk02,
  author = {Wenk, Carola},
  title = {Shape matching in higher dimensions},
  school = {FU Berlin},
  year = {2002}
}
    Wenk, C., Salas, R. & Pfoser, D. Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms

    [BibTeX]

    		 2006 18th International Conference on Scientific and Statistical Database Management, SSDBM 2006, 3-5 July 2006, Vienna, Austria, Proceedings, pp. 379-388  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{WenkSP06,
  author = {Carola Wenk and Randall Salas and Dieter Pfoser},
  title = {Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms},
  booktitle = {18th International Conference on Scientific and Statistical Database Management, SSDBM 2006, 3-5 July 2006, Vienna, Austria, Proceedings},
  year = {2006},
  pages = {379--388},
  url = {http://dx.doi.org/10.1109/SSDBM.2006.11},
  doi = {http://dx.doi.org/10.1109/SSDBM.2006.11}
}
    Wiratma, L. Following the Majority: a New Algorithm for Computing a Median Trajectory

    [BibTeX]

    		 2010 School: Utrecht University  phdthesis  
    BibTeX: 
    @phdthesis{Wiratma10,
  author = {Lionov Wiratma},
  title = {Following the Majority: a New Algorithm for Computing a Median Trajectory},
  school = {Utrecht University},
  year = {2010}
}
    Wylie, T. The Discrete Fréchet Distance with Applications

    [BibTeX]

    		 2013 School: Montana State University  phdthesis  
    BibTeX: 
    @phdthesis{Wylie13,
  author = {Tim Wylie},
  title = {The Discrete Fréchet Distance with Applications},
  school = {Montana State University},
  year = {2013}
}
    Wylie, T., Luo, J. & Zhu, B. A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance

    [BibTeX]

    		 2011 Computational Science and Its Applications - ICCSA 2011 - International Conference, Santander, Spain, June 20-23, 2011. Proceedings, Part III, pp. 74-83  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{WylieLZ11,
  author = {Tim Wylie and Jun Luo and Binhai Zhu},
  title = {A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance},
  booktitle = {Computational Science and Its Applications - ICCSA 2011 - International Conference, Santander, Spain, June 20-23, 2011. Proceedings, Part III},
  year = {2011},
  pages = {74--83},
  url = {http://dx.doi.org/10.1007/978-3-642-21931-3_6},
  doi = {http://dx.doi.org/10.1007/978-3-642-21931-3_6}
}
    Wylie, T. & Zhu, B. Protein Chain Pair Simplification under the Discrete Fréchet Distance

    [BibTeX]

    		 2013 IEEE/ACM Trans. Comput. Biology Bioinform.
    Vol. 10(6), pp. 1372-1383     		 article DOI URL 
    BibTeX: 
    @article{WylieZ13,
  author = {Tim Wylie and Binhai Zhu},
  title = {Protein Chain Pair Simplification under the Discrete Fréchet Distance},
  journal = {IEEE/ACM Trans. Comput. Biology Bioinform.},
  year = {2013},
  volume = {10},
  number = {6},
  pages = {1372--1383},
  url = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.17},
  doi = {http://dx.doi.org/10.1109/TCBB.2013.17}
}
    Wylie, T. & Zhu, B. A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance

    [BibTeX]

    		 2012 Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings, pp. 287-298  inproceedings DOI URL 
    BibTeX: 
    @inproceedings{WylieZ12,
  author = {Tim Wylie and Binhai Zhu},
  title = {A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance},
  booktitle = {Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings},
  year = {2012},
  pages = {287--298},
  url = {http://dx.doi.org/10.1007/978-3-642-30191-9_27},
  doi = {http://dx.doi.org/10.1007/978-3-642-30191-9_27}
}
    Zhu, B. Protein Local Structure Alignment Under the Discrete Fréchet Distance

    [BibTeX]

    		 2007 Journal of Computational Biology
    Vol. 14(10), pp. 1343-1351     		 article DOI URL 
    BibTeX: 
    @article{Zhu07,
  author = {Binhai Zhu},
  title = {Protein Local Structure Alignment Under the Discrete Fréchet Distance},
  journal = {Journal of Computational Biology},
  year = {2007},
  volume = {14},
  number = {10},
  pages = {1343--1351},
  url = {http://dx.doi.org/10.1089/cmb.2007.0156},
  doi = {http://dx.doi.org/10.1089/cmb.2007.0156}
}

    Created by JabRef on 22/11/2015.