English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14936536      Online Users : 75
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  The Average Performance Analysis of a Closest Pair Algorithm

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80785

    Title: The Average Performance Analysis of a Closest Pair Algorithm
    Authors: Chang, R. C.;Lee, R. C. T.
    教師: 李家同
    Date: 1984
    Publisher: Taylor & Francis
    Relation: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, Taylor & Francis, Volume 16, Issue 2, 1984, Pages 125-130
    Keywords: Analysis of algorithm
    computational geometry
    closest-pair problems
    probabilistic analysis of algorithms
    geometric probability
    Abstract: Bentley proposed a divide‐and‐conquer approach to solve the planar closest pair problem. In this paper, we shall show that the average case performance of this algorithm is proportional to the number of poins being examined.
    Relation Link: http://www.tandf.co.uk/journals/default.asp
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80785
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback