English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49983/85139 (59%)
Visitors : 7798393      Online Users : 96
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95753


    Title: Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm
    Authors: Chao, Louis R.;Liu, Hoo-Chen;Kou, Ying-Feng
    Contributors: 淡江大學資訊工程學系
    Keywords: 平面凸殼;四邊貪婪演算法;凸殼建構;四邊演算法;Planar Convex Hull;Quadrilateral Devour Algorithm;Convex Hull Construction;Quadrilateral Algorithm
    Date: 1994-12
    Issue Date: 2014-02-13
    Abstract: The algorithm to construct the convex hull for a set of finite points in two-dimensional Euclidean space has been applied in many applications. In this paper, a modified quadrilateral algorithm is proposed to construct the convex hull. This method is based on a divide-and- conquer strategy and divides the input finite points into two parts. All the quadrilaterals can be found in each part by just comparing the x-coordinate of every point and the internal points are eliminated. When all of the points have been processed, the vertices of the convex hull belong to all the vertices of the quadrilaterals. Some distributed data samples are examined to demonstrate the efficiency of this algorithm. The average and worst cases are also discussed.
    Relation: 1994 International Computer Symposium Conference Proceeding Volume 2 of 2,頁744-749
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File SizeFormat
    Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm_西文摘要.docx13KbMicrosoft Word89View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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