https://github.com/justinmanley/graphics.partialpolylinesimilarity
Implementation of Guibas & Cohen (1997) partial polyline matching algorithm: http://robotics.stanford.edu/~scohen/pssp-soda-final.pdf
https://github.com/justinmanley/graphics.partialpolylinesimilarity
computer-graphics polyline-algorithm
Last synced: 4 months ago
JSON representation
Implementation of Guibas & Cohen (1997) partial polyline matching algorithm: http://robotics.stanford.edu/~scohen/pssp-soda-final.pdf
- Host: GitHub
- URL: https://github.com/justinmanley/graphics.partialpolylinesimilarity
- Owner: justinmanley
- License: mit
- Created: 2017-04-25T16:38:16.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2017-04-25T16:48:17.000Z (almost 9 years ago)
- Last Synced: 2025-03-02T11:25:35.161Z (12 months ago)
- Topics: computer-graphics, polyline-algorithm
- Language: Haskell
- Size: 14.6 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Bibliography
============
Partial Matching of Planar Polylines Under Similarity Transformations
http://robotics.stanford.edu/~scohen/pssp-soda-final.pdf
Computing the Frechet Distance Between two Polygonal Curves
http://www.staff.science.uu.nl/~kreve101/asci/ag-cfdbt-95.pdf
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
http://sarielhp.org/research/papers/01/morph/morph.pdf
Sketching Contours
https://www.cs.rutgers.edu/~nealen/research/sc_preprint.pdf
- Uses a modified version of the Guibas & Cohen algorithm
Optimal Partial Shape Similarity
https://cis.temple.edu/~latecki/Papers/ivc05.pdf
Curve Matching, Time Warping, and Light Fields
https://www.researchgate.net/publication/220146268_Curve_Matching_Time_Warping_and_Light_Fields_New_Algorithms_for_Computing_Similarity_between_Curves
Optimal Similarity of Polylines
http://www.sfbtr8.uni-bremen.de/project/r3/shape/tracking/optimal-matching.html
How can I define a measure of similarity between two line segments?
http://math.stackexchange.com/questions/860503/how-can-i-define-a-measure-of-similarity-between-two-line-segments-in-mathbbr
http://gis.stackexchange.com/questions/44299/how-to-rank-polylines-according-to-their-similarity-to-a-ref-polyline
Tufts implementation of topological sweep
http://www.cs.tufts.edu/r/geometry/other/sweep/
Topologically Sweeping an Arrangement (Edelsbrunner & Guibas)
http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-9.pdf
Guibas handout on topological line sweep:
http://graphics.stanford.edu/courses/cs368-06-spring/handouts/basic.pdf
Alternative line sweep algorithms:
https://pdfs.semanticscholar.org/a571/cc92218132a1b0e65c2adbf663c79d015737.pdf
http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f03/Artikler/12/Chazelle92.pdf
Key words:
frechet distance
procrustes analysis
statistical shape similarity
dynamic time warping