메뉴 건너뛰기




Volumn 6, Issue 5, 1996, Pages 329-354

Hunting Voronoi vertices

Author keywords

[No Author keywords available]

Indexed keywords


EID: 2842600558     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(96)00002-8     Document Type: Article
Times cited : (9)

References (29)
  • 1
    • 0002599292 scopus 로고
    • Algorithmic aspect of motion planning: A tutorial, part 2
    • H. Alt and C.K. Yap, Algorithmic aspect of motion planning: a tutorial, part 2, Algorithms Rev. 1(2) (1990) 61-77.
    • (1990) Algorithms Rev. , vol.1 , Issue.2 , pp. 61-77
    • Alt, H.1    Yap, C.K.2
  • 2
    • 84976826673 scopus 로고
    • Voronoi diagrams: A survey of a fundamental geometric data structure
    • F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structure, ACM Comput. Surv. 23 (1991) 345-405.
    • (1991) ACM Comput. Surv. , vol.23 , pp. 345-405
    • Aurenhammer, F.1
  • 3
    • 0242429305 scopus 로고
    • Algorithms for computing d-dimensional Voronoi diagrams and their duals
    • F.P. Preparata, ed., JAI Press, London
    • D. Avis and B.K. Bhattacharya, Algorithms for computing d-dimensional Voronoi diagrams and their duals, in: F.P. Preparata, ed., Computational Geometry, Advances in Computing Research, Vol. 1 (JAI Press, London, 1983) 159-180.
    • (1983) Computational Geometry, Advances in Computing Research , vol.1 , pp. 159-180
    • Avis, D.1    Bhattacharya, B.K.2
  • 9
    • 0027544261 scopus 로고
    • Two-dimensional robot navigation among unknown stationary polygonal obstacles
    • G. Foux, M. Heymann and A. Bruckstein, Two-dimensional robot navigation among unknown stationary polygonal obstacles, IEEE J. Robot. Autom. 9 (1993) 96-102.
    • (1993) IEEE J. Robot. Autom. , vol.9 , pp. 96-102
    • Foux, G.1    Heymann, M.2    Bruckstein, A.3
  • 10
  • 11
    • 0001954038 scopus 로고
    • Distance functions and their application to robot path planning in the presence of obstacles
    • E.G. Gilbert and D.W. Johnson, Distance functions and their application to robot path planning in the presence of obstacles, IEEE J. Robot. Autom. RA-1 (1985) 21-30.
    • (1985) IEEE J. Robot. Autom. RA-1 , pp. 21-30
    • Gilbert, E.G.1    Johnson, D.W.2
  • 12
    • 0003420930 scopus 로고
    • Penguin Books, London, Chapter 16: Mathematical chaos and strange attractors
    • D.R. Hofstadter, Metamagical Themas (Penguin Books, London, 1986) (Chapter 16: Mathematical chaos and strange attractors.)
    • (1986) Metamagical Themas
    • Hofstadter, D.R.1
  • 18
    • 0002275443 scopus 로고
    • Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
    • D. Leven and M. Sharir, Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discrete Comput. Geom. 2 (1987) 9-31.
    • (1987) Discrete Comput. Geom. , vol.2 , pp. 9-31
    • Leven, D.1    Sharir, M.2
  • 19
    • 0042969785 scopus 로고
    • Technical report, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, July
    • E. Mazer, J.M. Ahuactzin, E.-G. Talbi and P. Bessiere, The Ariadne's clew algorithm. Technical report, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, July 1992.
    • (1992) The Ariadne's Clew Algorithm
    • Mazer, E.1    Ahuactzin, J.M.2    Talbi, E.-G.3    Bessiere, P.4
  • 22
    • 84990619101 scopus 로고
    • Generalized Voronoi diagrams for moving a ladder, I: Topological analysis
    • C. Ó'Dúnlaing, M. Sharir and C.K. Yap, Generalized Voronoi diagrams for moving a ladder, I: topological analysis, Comm. Pure Appl. Math. 39 (1986) 423-483.
    • (1986) Comm. Pure Appl. Math. , vol.39 , pp. 423-483
    • Ó'dúnlaing, C.1    Sharir, M.2    Yap, C.K.3
  • 26
    • 0026239323 scopus 로고
    • An axiomatic approach to Voronoi-diagrams in 3D
    • S. Stifter, An axiomatic approach to Voronoi-diagrams in 3D, J. Comput. Syst. Sci. 43 (1991) 361-374.
    • (1991) J. Comput. Syst. Sci. , vol.43 , pp. 361-374
    • Stifter, S.1
  • 29
    • 0346755279 scopus 로고
    • An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
    • C.K. Yap, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete Comput. Geom. 2 (1987) 365-393.
    • (1987) Discrete Comput. Geom. , vol.2 , pp. 365-393
    • Yap, C.K.1


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