Minimax geometric fitting of two corresponding sets of points and dynamic furthest voronoi diagrams

IEICE Transactions on Information and Systems

Volumn E81-D, Issue 11, 1998, Pages 1162-1171

  Imai, Keiko ^a   Sumino, Shigeo ^a   Imai, Hiroshi ^a  

^a CHUO UNIVERSITY   (Japan)

Author keywords

Computational geometry; Davenport schinzel sequences; Linearization; Lower envelopes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CURVE FITTING; LINEARIZATION; PROBLEM SOLVING;

DAVENPORT-SCHINZEL SEQUENCES; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 0032205948     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. G. Albers, L.J. Guibas, J.S.B. Mitchell, and T. Roos, "Voronoi diagrams of moving points," International Journal of Computational Geometry & Applications, vol.8, no.3, pp.365-379, 1998.
2. H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, "Congruence, similarity, and symmetries of geometric objects," Discrete and Computational Geometry, vol.3, pp.237-256, 1988.
3. M.J. Atallah, "Some dynamic computational geometry problems," Computers and Mathematics with Applications, vol.11, pp.1171-1181, 1985.
4. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, 1987.
5. H. Edelsbrunner, J. Pach, J.T. Schwartz, and M. Sharir, "On the lower envelope of bivariate functions and its applications," Proc. 28th IEEE Annual Symposium on Foundations of Computer Science, pp.27-37, 1987. [6] J. Hershberger, "Finding the upper envelope of n line segments in O(nlogn) time," Information Processing Letters, vol.33, no.4, pp.169-174, 1989.
6. K. Imai, "Voronoi diagrams for moving points and its applications," Transactions of the Japan Society for Industrial and Applied Mathematics, vol.1, pp. 127-134, 1991. [8] H. Imai and K. Imai, "Computational Geometry," Kyoritsu Shuppan, Tokyo, 1995.
7. K. Imai and H. Imai, "Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets," Optimization Methods and Software, 1998, in press.
8. K. Imai, S. Sumino, and H. Imai, "Minimax geometric fitting of two corresponding sets of points," Proc. 5th ACM Symposium on Computational Geometry, pp.266275, 1989.
9. H.G. Mairson and J. Stolfi, "Reporting and counting intersections between two sets of line segments," Nato Adv. Study Inst. on Theoretical Foundations of Computer Graphics and CAD, Lucca, Italy, July 1987.
10. S.J. Maybank, "Applications of algebraic geometry to computer vision," in Computational Algebraic Geometry, Nice, 1992, Progr. Math., 109, Birkhäuser, Boston, pp.185194, 1993.
11. N. Megiddo, "Linear programming in linear time when the dimension is fixed," J. ACM, vol.31, pp. 114-127, 1984.
12. N. Megiddo, "Dynamic location problems," Annals of Operations Research, vol.6, pp.313-319, 1986.
13. S. Naito, "Applications of visual sensors to industrial robots," Sensor Technology, vol.7, pp.90-93, 1987.
14. P.P. Preparata and M.I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, 1985.
15. E.A. Ramos, "Construction of 1-d lower envelopes and applications," Proc. 13th Annual ACM Symposium on Computational Geometry, pp.57-66, 1997.
16. R. Seidel, "Small-dimensional linear programming and convex hulls made easy," Discrete and Computational Geometry, vol.6, no.5, pp.423-434, 1991.
17. M. Sharir, private communication, 1988.
18. M. Sharir, "Almost tight upper bounds for lower envelopes in higher dimensions," Discrete and Computational Geometry, "vol.12, pp.327-345, 1994.
19. M. Sharir and P.K. Agarwal, "Davenport-Schinzel Se-quences and Their Geometric Applications," Cambridge University Press, Cambridge, 1995.
20. E. Szemerédi, "On a problem by Davenport and Schinzel," Acta Arithmetica, vol.25, pp.213-224, 1974.
21. A. Takahashi, I. Ishii, H. Makino, and M. Nakashizuka, "A camera calibration method using parallelogrammatic grid points," IEICE Trans. Inf. & Syst., voI.E79-D, no.ll, pp.1579-1587, 1996.