ASIA unversity:Item 310904400/4325
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21710084      Online Users : 484
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4325


    Title: The minimum feature point set representing a convex polyhedron
    Authors: J. J. Leou;W. H. Tsai
    Contributors: Department of Information Communication
    Keywords: 3-D object representation;minimum feature point set;minimum measurable feature point set;convex polyhedral object;extended Gaussian image (EGI)
    Date: 1990
    Issue Date: 2009-11-25 02:30:52 (UTC+0)
    Publisher: Asia University
    Abstract: The minimum feature point set representing a convex polyhedral object is derived, based on which the stored data of a 3-D convex polyhedral object can be reduced. The feasibility of the proposed method is shown by several illustrative examples.
    Relation: Pattern Recognition Letters 11 (3): 225-229
    Appears in Collections:[Department of Information Communication] Journal Article

    Files in This Item:

    File Description SizeFormat
    0KbUnknown701View/Open
    310904400-4325.doc31KbMicrosoft Word309View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.

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