article

Computing some distance functions between polygons

Authors:

Mikhail J. Atallah,

Celso C. Ribeiro,

Sergio LifschitzAuthors Info & Claims

Pattern Recognition, Volume 24, Issue 8

Pages 775 - 781

https://doi.org/10.1016/0031-3203(91)90045-7

Published: 01 August 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Luque-Suarez FLópez-López JChavez E(2021)Indexed Polygon Matching Under SimilaritiesSimilarity Search and Applications10.1007/978-3-030-89657-7_22(295-306)Online publication date: 29-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-89657-7_22
Ahmed Sherif MNgonga Ngomo A(2018)A systematic survey of point set distance measures for link discoverySemantic Web10.3233/SW-1702859:5(589-604)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/SW-170285
Sahuguède AFergani SCorronc ELann M(2018)Mapping Chronicles to a $k$-dimensional Euclidean Space via Random Projections2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)10.1109/COASE.2018.8560562(1177-1182)Online publication date: 20-Aug-2018
https://dl.acm.org/doi/10.1109/COASE.2018.8560562
Show More Cited By

Index Terms

Computing some distance functions between polygons
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
  2. Computer graphics
    1. Shape modeling
2. Theory of computation

Recommendations

Computing the Fréchet distance between simple polygons

We present the first polynomial-time algorithm for computing the Frechet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes. For this, we show that ...
Computing the Fréchet distance between folded polygons
WADS'11: Proceedings of the 12th international conference on Algorithms and data structures

Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fréchet distance for a class of non-flat ...
Computing the Fréchet distance between simple polygons in polynomial time
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry

We present the first polynomial-time algorithm for computing the Fréchet for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other ...

Comments

Information & Contributors

Information

Published In

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 01 August 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Luque-Suarez FLópez-López JChavez E(2021)Indexed Polygon Matching Under SimilaritiesSimilarity Search and Applications10.1007/978-3-030-89657-7_22(295-306)Online publication date: 29-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-89657-7_22
Ahmed Sherif MNgonga Ngomo A(2018)A systematic survey of point set distance measures for link discoverySemantic Web10.3233/SW-1702859:5(589-604)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/SW-170285
Sahuguède AFergani SCorronc ELann M(2018)Mapping Chronicles to a $k$-dimensional Euclidean Space via Random Projections2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)10.1109/COASE.2018.8560562(1177-1182)Online publication date: 20-Aug-2018
https://dl.acm.org/doi/10.1109/COASE.2018.8560562
Davoodi MMohades ASheikhi FKhanteimouri P(2015)Data imprecision under λ-geometry modelInformation Sciences: an International Journal10.1016/j.ins.2014.10.017295:C(126-144)Online publication date: 20-Feb-2015
https://dl.acm.org/doi/10.1016/j.ins.2014.10.017
Wang SEick C(2014)A polygon-based clustering and analysis framework for mining spatial datasetsGeoinformatica10.1007/s10707-013-0190-218:3(569-594)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1007/s10707-013-0190-2
Ngonga Ngomo A(2013)ORCHID Reduction-Ratio-Optimal Computation of Geo-spatial Distances for Link DiscoveryProceedings of the 12th International Semantic Web Conference - Part I10.1007/978-3-642-41335-3_25(395-410)Online publication date: 21-Oct-2013
https://dl.acm.org/doi/10.1007/978-3-642-41335-3_25
Wang SChen CRinsurongkawong VAkdag FEick CLin JCervone GWaters N(2010)A polygon-based methodology for mining related spatial datasetsProceedings of the 1st ACM SIGSPATIAL International Workshop on Data Mining for Geoinformatics10.1145/1869890.1869891(1-8)Online publication date: 2-Nov-2010
https://dl.acm.org/doi/10.1145/1869890.1869891

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Computing the Fréchet distance between simple polygons

Computing the Fréchet distance between folded polygons

Computing the Fréchet distance between simple polygons in polynomial time

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations