A linear time algorithm for the computation of some distance functions between convex polygons

M. J. Atallah; C. C. Ribeiro; S. Lifschitz

RAIRO - Operations Research - Recherche Opérationnelle (1991)

  • Volume: 25, Issue: 4, page 413-424
  • ISSN: 0399-0559

How to cite

top

Atallah, M. J., Ribeiro, C. C., and Lifschitz, S.. "A linear time algorithm for the computation of some distance functions between convex polygons." RAIRO - Operations Research - Recherche Opérationnelle 25.4 (1991): 413-424. <http://eudml.org/doc/105023>.

@article{Atallah1991,
author = {Atallah, M. J., Ribeiro, C. C., Lifschitz, S.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {computational geometry; convex polygons; distance computation; contour fitting; robot vision; algorithms},
language = {eng},
number = {4},
pages = {413-424},
publisher = {EDP-Sciences},
title = {A linear time algorithm for the computation of some distance functions between convex polygons},
url = {http://eudml.org/doc/105023},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Atallah, M. J.
AU - Ribeiro, C. C.
AU - Lifschitz, S.
TI - A linear time algorithm for the computation of some distance functions between convex polygons
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 4
SP - 413
EP - 424
LA - eng
KW - computational geometry; convex polygons; distance computation; contour fitting; robot vision; algorithms
UR - http://eudml.org/doc/105023
ER -

References

top
  1. 1. M. J. ATALLAH, A Linear Time Algorithm for the Hausdorff Distance between Convex Polygons, Inform. Process. Lett., 1983, 17, pp. 207-209. Zbl0527.68051MR742070
  2. 2. P. Cox, H. MAITRE, and M. MINOUX and C. C. RIBEIRO, Optimal Matching of Convex Polygons, Pattern Recognition Lett., 1989, 9, pp.327-334. Zbl0800.68758
  3. 3. H. EDELSBRUNNER, Computing the Extreme Distances between Two Convex Polygons, J. Algorithms, 1985, 6, pp. 213-224. Zbl0604.68079MR789904
  4. 4. B. GRUNBAUM, 1967Convex Polytopes, Wiley, New York. Zbl0163.16603MR226496
  5. 5. J. O'ROURKE, C.-B. CHIEN, T. OLSON and D. NADDOR, A New Linear Time Algorithm for Intersecting Convex Polygons, Comput. Graph. Image Process., 1982, 19, pp. 384-391. Zbl0533.52001

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.