Computation of the tangent graph of polygonal obstacles by moving-line processing

@article{Liu1994ComputationOT,
  title={Computation of the tangent graph of polygonal obstacles by moving-line processing},
  author={Yunhui Liu and Suguru Arimoto},
  journal={IEEE Trans. Robotics and Automation},
  year={1994},
  volume={10},
  pages={823-830}
}
The tangent graph is a powerful graphic data structure for the path-planning of a mobile robot among obstacles because it has fewer edges than the widely used visibility graph. This paper proposes an efficient algorithm for computing the tangent graph of a set of polygonal obstacles. The algorithm at first detects common tangents of obstacle boundaries by movingline processing that cooperatively moves a straight segment on the boundaries, and then checks for intersections among detected… CONTINUE READING

From This Paper

Topics from this paper.
8 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The Complexity of Robot Motion Planning

  • J. F. Canny
  • 1988

On the piano movers ’ problem : The case of a two - dimensional rigid polygonal body amidst polygonal barriers

  • Schwartz, M. Sharir
  • Information Processing Letters
  • 1987

An algorithm for planning collision - free paths among polyhedral obstacles

  • T. Naniwa Noborio, S. Arimoto
  • Commun , ACM
  • 1979

M’76-SM’82-F’83) received the B.S. degree in mathematics from Kyoto University, Kyoto, Japan, in 1959, and the Dr. Eng. degree in control engineering from the University of Tokyo, Tokyo, Japan

  • Suguru Arimoto
  • 1967

Similar Papers

Loading similar papers…