메뉴 건너뛰기




Volumn 6, Issue 3, 1985, Pages 381-392

A linear algorithm for determining the separation of convex polyhedra

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33749778536     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(85)90007-0     Document Type: Article
Times cited : (150)

References (16)
  • 1
    • 84910931896 scopus 로고
    • Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons
    • Department of Computer Science, University of Alberta, Edmonton, Alberta, Canada
    • (1982) Technical Report TR 82-8
    • Chin1    Wang2
  • 4
    • 84915155145 scopus 로고    scopus 로고
    • D. P. Dobkin and D. G. Kirkpatrick, Fast algorithms for preprocessed polyhedral intersection detection, in preparation.
  • 5
    • 84915171868 scopus 로고    scopus 로고
    • M. E. Dyer, A simplified O(n log n) algorithm for the intersection of 3-polyhedra, unpublished manuscript.
  • 6
    • 84915141579 scopus 로고    scopus 로고
    • M. E. Dyer, An O(n) algorithm for locating a point in the intersection of polyhedra, unpublished manuscript.
  • 7
    • 0037539894 scopus 로고
    • On Computing the Extreme Distances between Two Convex Polygons
    • Institut fur Informationsverarbeitung, Technical Univ. of Graz, Graz, Austria
    • (1982) Report No. 96
    • Edelsbrunner1
  • 13
    • 0017453547 scopus 로고
    • Convex hulls of finite sets in two and three dimensions
    • (1977) Comm. ACM , vol.20 , pp. 87-93
    • Preparata1    Hong2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.