IEICE Technical Committee Submission System Conference Paper's Information Online Proceedings [Sign in] ... (for ESS/CS/ES/ISS) Tech. Rep. Archives ... (for ES/CS)
 Go Top Page Go Previous [Japanese] / [English]

 Paper Abstract and Keywords Presentation 2012-06-21 16:20 A method for computing a sequence of circumscribing polygonsKensuke Onishi (Tokai Univ.), Mamoru Hoshi (UEC) COMP2012-23 Abstract (in Japanese) (See Japanese page) (in English) We have studied algorithm for computing a sequence of circumscribing polygons. In our previous paper, we proposed two constructive methods for convex polygon: optimal and greedy. The former computes the smallest k-gons, the latter quickly computes nearly smallest k-gons with small memory for k >= 5. In this paper, we propose two methods for computing a sequence of polygons circumscribing a given simple polygon which is more general rather than convex. Since the previous paper showed the greedy method is fairly good, we propose two methods based on the greedy method, called naive method and pocket method. The computation complexity of two methods is O(n^2) time and O(n) space in the worst case for a simple polygon with n vertices. The pocket method is done in O(n^2/log n) time for points selected from square region and O(n^{5/3}) time for that from disk region on average. Moreover, we apply the methods to sets of simple polygons. The execution time of the naive method and that of the pocket methods are O(n^2), O(n^2/ log n) for square region and O(n^{5/3}) for disk region, respectively. Keyword (in Japanese) (See Japanese page) (in English) simple polygon / circumscribing polygon / retrieval by shape / / / / / Reference Info. IEICE Tech. Rep., vol. 112, no. 93, COMP2012-23, pp. 87-93, June 2012. Paper # COMP2012-23 Date of Issue 2012-06-14 (COMP) ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380 Copyrightandreproduction All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) Download PDF COMP2012-23

 Conference Information Committee COMP Conference Date 2012-06-21 - 2012-06-21 Place (in Japanese) (See Japanese page) Place (in English) Hokkaido University Topics (in Japanese) (See Japanese page) Topics (in English) Paper Information Registration To COMP Conference Code 2012-06-COMP Language Japanese Title (in Japanese) (See Japanese page) Sub Title (in Japanese) (See Japanese page) Title (in English) A method for computing a sequence of circumscribing polygons Sub Title (in English) Keyword(1) simple polygon Keyword(2) circumscribing polygon Keyword(3) retrieval by shape Keyword(4) Keyword(5) Keyword(6) Keyword(7) Keyword(8) 1st Author's Name Kensuke Onishi 1st Author's Affiliation Tokai University (Tokai Univ.) 2nd Author's Name Mamoru Hoshi 2nd Author's Affiliation The University of Electro-Communications (UEC) 3rd Author's Name 3rd Author's Affiliation () 4th Author's Name 4th Author's Affiliation () 5th Author's Name 5th Author's Affiliation () 6th Author's Name 6th Author's Affiliation () 7th Author's Name 7th Author's Affiliation () 8th Author's Name 8th Author's Affiliation () 9th Author's Name 9th Author's Affiliation () 10th Author's Name 10th Author's Affiliation () 11th Author's Name 11th Author's Affiliation () 12th Author's Name 12th Author's Affiliation () 13th Author's Name 13th Author's Affiliation () 14th Author's Name 14th Author's Affiliation () 15th Author's Name 15th Author's Affiliation () 16th Author's Name 16th Author's Affiliation () 17th Author's Name 17th Author's Affiliation () 18th Author's Name 18th Author's Affiliation () Speaker 1 Date Time 2012-06-21 16:20:00 Presentation Time 25 Registration for COMP Paper # IEICE-COMP2012-23 Volume (vol) IEICE-112 Number (no) no.93 Page pp.87-93 #Pages IEICE-7 Date of Issue IEICE-COMP-2012-06-14