Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams
Summary :
This paper formulates problems of fitting two corresponding sets of points by translation, rotation and scaling, and proposes efficient algorithms for the fitting. The algorithms are based on the theory of lower envelopes, or Davenport-Schinzel sequences, and linearization techniques in computational geometry, and are related to dynamic furthest Voronoi diagrams.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.11 pp.1162-1171
- Publication Date
- 1998/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Algorithm and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Keiko IMAI, Shigeo SUMINO, Hiroshi IMAI, "Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 11, pp. 1162-1171, November 1998, doi: .
Abstract: This paper formulates problems of fitting two corresponding sets of points by translation, rotation and scaling, and proposes efficient algorithms for the fitting. The algorithms are based on the theory of lower envelopes, or Davenport-Schinzel sequences, and linearization techniques in computational geometry, and are related to dynamic furthest Voronoi diagrams.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_11_1162/_p
Copy
@ARTICLE{e81-d_11_1162,
author={Keiko IMAI, Shigeo SUMINO, Hiroshi IMAI, },
journal={IEICE TRANSACTIONS on Information},
title={Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams},
year={1998},
volume={E81-D},
number={11},
pages={1162-1171},
abstract={This paper formulates problems of fitting two corresponding sets of points by translation, rotation and scaling, and proposes efficient algorithms for the fitting. The algorithms are based on the theory of lower envelopes, or Davenport-Schinzel sequences, and linearization techniques in computational geometry, and are related to dynamic furthest Voronoi diagrams.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams
T2 - IEICE TRANSACTIONS on Information
SP - 1162
EP - 1171
AU - Keiko IMAI
AU - Shigeo SUMINO
AU - Hiroshi IMAI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 1998
AB - This paper formulates problems of fitting two corresponding sets of points by translation, rotation and scaling, and proposes efficient algorithms for the fitting. The algorithms are based on the theory of lower envelopes, or Davenport-Schinzel sequences, and linearization techniques in computational geometry, and are related to dynamic furthest Voronoi diagrams.
ER -
English
