Abstract
Commanding motion is supported by a touch screen interface. Human input demonstrating trajectories by a sequence of points may be incomplete, distorted etc. Theses effects are compensated by a transformation of vertex sequences of a regular grid into paths of a planar graph which codes feasible motions. The transformation is based on alteration operations including re-routings and on a so-called graph Voronoi regions which partition the plane according to proximity to vertices and edges.
Chapter PDF
Similar content being viewed by others
References
Cloppet, F., Olivia, J.-M., Stamon, G., “Angular bisector network, a simplified generalized Voronoi diagram: applications to processing complex intersections in biomedical images”, IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 2000, p. 120–128.
Cohen, P. et al., “Multimodal interaction for 2D and 3D environments”, Computer Graphics and Applications, July/August 1999, p. 10–13.
Gusfield, D., “Algorithms on strings, trees, and sequences: computer science and computational biology”, Cambridge University Press, Cambridge, 1997.
Hopcroft, J. E., Ullman, J., “Introduction to automata theory, languages and computation”, Addison-Wesley, New York, 1979.
Kämpke, T., “Interfacing graphs”, Journal of Machine Graphics and Vision 9, 2000, p. 797–824.
Leeuwen, J.v. (ed.), “Handbook of theoretical computer science: algorithms and complexity”, vol. A, Elsevier, Amsterdam, 1990.
O’Rourke, J., “Computational Gemetry in C”, 2nd ed., Cambridge University Press, Cambridge, 1998.
Sugihara, K., “Approximations of generalized Voronoi diagrams by ordinary Voronoi diagrams”, Computer Vision and Graphic Image Processing 55, 1993, p. 522–531.
Yap, C. K., “An O(n * log n) algorithm for Voronoi diagrams of a set of simple curve segments”, Discrete and Computational Geometry 2, 1987, p. 365–393.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kämpke, T., Strobel, M. (2001). Graph Voronoi Regions for Interfacing Planar Graphs. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_82
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive