Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures

Original language	American English
Title of host publication	2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)
State	Published - 1991

Bibliographical note

Place of conference:San Francisco, CA

Other files and links

• link

Cite this

• APA
• Author
• BIBTEX
• Harvard
• Standard
• RIS
• Vancouver

Amihood, A., & Farach, M. (1991). Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. In 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)

Amihood, A. ; Farach, M. / Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA). 1991.

@inproceedings{0608b31367b74260984c674dd8b75dee,

title = "Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures",

author = "A. Amihood and M. Farach",

note = "Place of conference:San Francisco, CA",

year = "1991",

language = "American English",

booktitle = "2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)",

}

Amihood, A & Farach, M 1991, Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. in 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA).

Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. / Amihood, A.; Farach, M.
2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA). 1991.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures

AU - Amihood, A.

AU - Farach, M.

N1 - Place of conference:San Francisco, CA

PY - 1991

Y1 - 1991

UR - https://scholar.google.co.il/scholar?q=Efficient+2-dimensional+Approximate+Matching+of+Non-rectangular+Figures&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)

ER -

Amihood A, Farach M. Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. In 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA). 1991