Crystal voronoi diagram and its applications to collision-free paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 738-747

  Kobayashi, Kei ^a   Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FINITE DIFFERENCE METHOD; GRAPHIC METHODS; ROBOT PROGRAMMING;

COLLISION-FREE PATHS; FAST MARCHING METHODS; GROWTH SPEED; ITS APPLICATIONS; VORONOI DIAGRAMS;

APPROXIMATION ALGORITHMS;

EID: 84949671159     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45545-0_85     Document Type: Article

References (9)

1. B.F. Schaudt and R.L. Drysdale: Multiplicatively weighted crystal growth Voronoi diagram. Proceedings of the Seventh Annual Symposium on Computational Geometry (North Conway, June 1991), pp. 214-223.
2. F. Aurenhammer: Voronoi diagrams-A survey of a fundamental Geometric data structure. ACM Computing Surveys, vol. 23, no. 3 (1991), pp. 345-405.
3. A. Okabe, B. Boots, and K. Sugihara: Spatial Tessellations-Concepts and Applications of Voronoi Diagrams. John Wiley, Chickester, 1992.
4. J.A. Sethian: Fast marching methods. SIAM Review, vol. 41, no. 2 (1999), pp. 199-235.
5. C.A. Wang and P.Y. Tsin: Finding constrained and weighted Voronoi diagrams in the plane. Proceedings of the Second Canadian Conference in Computational Geometry (Ottawa, August 1990), pp.200-203.
6. D. Pedoe: Geometry-A Comprehensive Course. Cambridge University Press, Lon- don, 1970.
7. A. Rosenfeld and J. Pfalts: Sequential operations in digital picture processing. Journal of ACM, vol. 13 (1966), pp. 471-494.
8. L. Chen and H.Y.H. Chuang. A fast algorithm for Euclidean distance maps of a 2-d binary image. Infor. Process. Lett. vol. 51 (1994), pp. 25-29.
9. T. Hirata: A unified linear-time algorithm for computing distance maps. Infor. Process. Lett., vol. 58 (1996), pp. 129-133.