16
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Intersection removal for simple polygons

&
Pages 211-223 | Received 28 May 1996, Published online: 19 Mar 2007

References

  • Behzad , M. , Chartrand , G. and Lesniak-Foster , L. 1979 . Graphs and Digraphs , Prindle : Weber and Schmidt international series .
  • Buckley , C. E. 1989 . A foundation for the flexible-trajectory approach to numeric path planning . International Journal of Robotics Research , 8 ( 3 ) : 44 – 64 .
  • Mount , D. M. 1992 . Intersection detection and separators for simple polygons . ACM Symposium on Computational Geometry , : 303 – 311 .
  • Preparata , F. P. and Shamos , M. I. 1985 . Computational Geometry: An Introduction ,
  • Sancheti N. K. Efficient Algorithms for Linearly Constrained Convex Programming and Some Proximity Problems PhD thesis, Indian Institute of Science. 1993

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.