New similarity measures between polylines with applications to morphing and polygon sweeping

Discrete and Computational Geometry

Volumn 28, Issue 4, 2002, Pages 535-569

  Efrat, Alon ^a   Guibas, Leonidas J ^b   Har Peled, Sariel ^c   Mitchell, Joseph S B ^d   Murali, T M ^e  

^a University of Arizona   (United States)

^b Stanford University   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d STONY BROOK UNIVERSITY   (United States)

^e BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036973020     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2886-1     Document Type: Article

References (48)

1. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri. Can visibility graphs be represented compactly? Discrete Comput. Geom., 12:347-365, 1994.
2. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75-91, 1995.
3. H. Alt and L. Guibas. Discrete geometric shapes: matching, interpolation, and approximation, a survey. In J. Urrutia and J.-R. Sack, editors, Handbook of Computational Geometry, pp. 121-153. North-Holland, Amsterdam, 1999.
4. E. M. Arkin, J. S. B. Mitchell, and S. Suri. Logarithmic-time link path queries in a simple polygon. Internat. J. Comput. Geom. Appl., 5(4):369-395, 1995.
5. B. Aronov, R. Seidel, and D. Souvaine. On compatible triangulations of simple polygons. Comput. Geom. Theory Appl., 3(1):27-35, 1993.
6. S. Bespamyatnikh. An optimal morphing between polylines. Internat. J. Comput. Geom. Appl., 12(3):217-228, 2002.
7. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5):485-524, 1991.
8. B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
9. D. Cohen-Or, A. Solomovic, and D. Levin. Three-dimensional distance field metamorphosis. ACM Trans. Graphics, 17(2):116-141, 1998.
10. D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a corridor-the open edge variant of the polygon search problem. Internat. J. Comput. Geom. Appl., 5:397-412, 1995.
11. H. N. Djidjev, A. Lingas, and J. Sack. An O(n log n) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom., 8(2):131-152, 1992.
12. A. Efrat, L. J. Guibas, S. Har-Peled, D. C. Lin, J. S. B. Mitchell, and T. M. Murali. Sweeping simple polygons with a chain of guards. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 927-936, 2000.
13. A. Efrat, L. J. Guibas, S. Har-Peled, and T. M. Murali. Morphing between curves. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 680-689, 2001.
14. M. S. Etzion and A. Rappoport. Shape blending using the star-skeleton representation. IEEE Comput. Graph. Appl., 15(2):44-50, 1995.
15. M. Fréchet. Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo, 22:1-74, 1906.
16. A. Gregory, A. State, M. Lin, D. Manocha, and M. Livingston. Interactive surface decomposition for polyhedral morphing. Visual Comput., 15:453-470, 1999.
17. L. J. Guibas and J. Hershberger. Morphing simple polygons. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 267-276, 1994.
18. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
19. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion in a polygonal environment. In Proc. Workshop Algorithms Data Structures, pp. 17-30, 1997.
20. H. Gupta and R. Wenger. Constructing piecewise linear homeomorphisms of simple polygons. J. Algorithms, 22:142-157, 1997.
21. T. He, S. Wang, and A. Kaufman. Wavelet-based volume morphing. In R. D. Bergeron and A. E. Kaufman, editors, Proc. IEEE Visualization, pp. 85-92. IEEE Computer Society Press, Los Alamitos, CA, 1994.
22. P. J. Heffernan. An optimal algorithm for the two-guard problem. Internat. J. Comput. Geom. Appl., 6:15-44, 1996.
23. J. Hershberger and S. Suri. Morphing binary trees. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pp. 396-404, 1995.
24. J. F. Hughes. Scheduled Fourier volume morphing. In Comput. Graph. (SIGGRAPH '92), 26:43-46, 1992.
25. D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge. Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell., 15:850-863, 1993.
26. C. Icking and R. Klein. The two guards problem. Internat. J. Comput. Geom. Appl., 2(3):257-285, 1992.
27. A. Kaul and J. Rossignac. Solid-interpolating deformations: construction and animation of PIPs. In Proc. Eurographics '91, pp. 493-505, 1991.
28. Y. Ke. An efficient algorithm for link-distance problems. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pp. 69-78, 1989.
29. Y. Ke. Polygon visibility algorithms for weak visibility and link distance problems. Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD, 1989.
30. J. R. Kent, W. E. Carlson, and R. E. Parent. Shape transformation for polyhedral objects. In Comput. Graph. (SIGGRAPH '92), 26:47-54, 1992.
31. R. Klein. Moving along a street. In Proc. Computational Geometry: Methods, Algorithms and Applications, pp. 123-140. Volume 553 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
32. S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE Internat. Conf. Robot. Automat., 1997.
33. J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Simple algorithms for searching a polygon with flashlights. Inform. Process. Lett., 81:265-270, 2002.
34. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach., 30(4):852-865, 1983.
35. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. On the complexity of searching a graph. J. Assoc. Comput. Mach., 35:18-44, 1988.
36. E. Papadopoulou and D. T. Lee. Efficient computation of the geodesic Voronoi diagram of points in a simple polygon. In P. G. Spirakis, editor, Proc. Third Annu. European Sympos. (ESA '95), pp. 238-251. Volume 979 of Lecture Notes Computer Science, Springer-Verlag, Berlin, 1995.
37. T. D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. Lick, editors, Theory and Applications of Graphs, pp. 426-441. Volume 642 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1976.
38. T. Sederberg, P. Gao, G. Wang, and H. Mu. 2-D shape blending: an intrinsic solution to the vertex path problem. In Comput. Graph. (SIGGRAPH '93), 27:15-18, 1993.
39. T. Sederberg and E. Greenwood. A physically based approach to 2-D shape blending. In Comput. Graph. (SIGGRAPH '92), 26:25-34, 1992.
40. V. Surazhsky and C. Gotsman. Guaranteed intersection-free polygon morphing. Comput. Graphics, 25(1):67-75, 2001.
41. V. Surazhsky and C. Gotsman. Controllable morphing of compatible planar triangulations. ACM Trans. Graphics, 20(4):203-231, 2001.
42. V. Surazhsky and C. Gotsman. Morphing stick figures using optimized compatible triangulations. In Proc. Pacific Graphics, Tokyo, 2001.
43. S. Suri. Minimum link paths in polygons and related problems. Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD, 1987.
44. S. Suri. On some link distance problems in a simple polygon. IEEE Trans. Robot. Automat., 6:108-113, 1990.
45. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput., 21:863-888, 1992.
46. X. Tan. Searching a simple polygon by a k-searcher. In Proc. 11th Annu. Internat. Sympos. Algorithms Comput. (ISAAC '00), pp. 503-514. Volume 1969 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
47. L. H. Tseng, P. Heffernan, and D. T. Lee, Two-guard walkability of simple polygons. Internat. J. Comput. Geom. Appl., 8(1):85-116, 1998.
48. G. Turk and J. F. O'Brien. Shape transformation using variational implicit functions. In Comput. Graph. Annu. Conf. Ser. (SIGGRAPH '99), pp. 335-342, 1999.