The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
An efficiently computable metric for comparing polygonal shapes
Abstract
A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub 2/ distance between the turning functions of the two polygons. It works for both convex and nonconvex polygons and runs in time O(mn log mn), where m is the number of vertices in one polygon and n is the number of vertices in the other. Some examples showing that the method produces answers that are intuitively reasonable are presented.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Schwartz, J. T., & Sharir, M. (1987) · The International Journal of Robotics Research · doi:10.1177/027836498700600203 · Cited by 230
Wolfson, H. J. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.55108 · Cited by 226
Willmore, T. J. (1969) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-44.1.667 · Cited by 138
Computing the minimum Hausdorff distance for point sets under translation
Huttenlocher, D. P., & Kedem, K. (1990) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/98524.98599 · Cited by 120
Self-citation
Cited by
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
Self-citationOsada, R., Funkhouser, T., Chazelle, B., & Dobkin, D. (2002) · ACM Transactions on Graphics · doi:10.1145/571647.571648 · Cited by 1,661
Image Retrieval: Current Techniques, Promising Directions, and Open Issues
Rui, Y., Huang, T. S., & Chang, S.-F. (1999) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.1999.0413 · Cited by 1,601
A survey of shape analysis techniques
Loncaric, S. (1998) · Pattern Recognition · doi:10.1016/s0031-2023(97)00122-2 · Cited by 950
Funkhouser, T., Min, P., Kazhdan, M., Chen, J., Halderman, A., Dobkin, D., & Jacobs, D. (2003) · ACM Transactions on Graphics · doi:10.1145/588272.588279 · Cited by 935
Matching 3D models with shape distributions
Osada, R., Funkhouser, T., Chazelle, B., & Dobkin, D. (2002) · Proceedings International Conference on Shape Modeling and Applications · doi:10.1109/sma.2001.923386 · Cited by 591
State of the Art in Shape Matching
Veltkamp, R. C., & Hagedoorn, M. (2001) · Advances in Pattern Recognition · doi:10.1007/978-1-4471-3702-3_4 · Cited by 535
Fundamentals of Content-Based Image Retrieval
Long, F., Zhang, H., & Feng, D. D. (2003) · Signals and Communication Technology · doi:10.1007/978-3-662-05300-3_1 · Cited by 511
Shape similarity measure based on correspondence of visual parts
Latecki, L. J., & Lakamper, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.879802 · Cited by 461
Shape matching: similarity measures and algorithms
Veltkamp, R. C. (2002) · Proceedings International Conference on Shape Modeling and Applications · doi:10.1109/sma.2001.923389 · Cited by 434
Quality assessment for building footprints data on OpenStreetMap
Fan, H., Zipf, A., Fu, Q., & Neis, P. (2014) · International Journal of Geographical Information Science · doi:10.1080/13658816.2013.867495 · Cited by 421
Multimedia content analysis-using both audio and visual clues
Wang, Y., Liu, Z., & Huang, J.-C. (2000) · IEEE Signal Processing Magazine · doi:10.1109/79.888862 · Cited by 409
Accuracy Assessment Measures for Object-based Image Segmentation Goodness
Clinton, N., Holt, A., Scarborough, J., Yan, L., & Gong, P. (2010) · Photogrammetric Engineering & Remote Sensing · doi:10.14358/pers.76.3.289 · Cited by 336
Matching shape sequences in video with applications in human movement analysis
Veeraraghavan, A., Roy-Chowdhury, A. K., & Chellappa, R. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.246 · Cited by 333
VideoQ: an automated content based video search system using visual cues
Chang, S.-F., Chen, W., Meng, H. J., Sundaram, H., & Zhong, D. (1997) · Proceedings of the fifth ACM international conference on Multimedia - MULTIMEDIA '97 · doi:10.1145/266180.266382 · Cited by 317
Yan, X., Ai, T., Yang, M., & Yin, H. (2019) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2019.02.010 · Cited by 269
Graph2Plan: learning floorplan generation from layout graphs
Hu, R., Huang, Z., Tang, Y., Van Kaick, O., Zhang, H., & Huang, H. (2020) · ACM Transactions on Graphics · doi:10.1145/3386569.3392391 · Cited by 266
Active Boundary Component Models for robotic dressing assistance
Twardon, L., & Ritter, H. (2016) · 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2016.7759436 · Cited by 18
“Alignment is expressed through an angular constraint on the last skeleton segment q2q1 and the unit normal n̂p of the boundary component: C6(p, q1, q2) = arccos ( (n̂p) T ( q2−q1|q2−q1| ) ) − φAl (24) The formulas for the gradients with respect to the boundary and skeleton points are similar to the…”
Background
Metadata
- Authors
- Arkin, E. M., Chew, L. P., Huttenlocher, D. P., Kedem, K., & Mitchell, J. S. B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1991-03
- Volume
- 13
- Issue
- 3
- Pages
- 209-216
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2071867759
- Cited by
- 628
- References
- 4
- FWCI
- 11.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.