JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/4690

Title: Arranging Fewest Possible Probes to Detect a Hidden Object with Industrial Application
Authors: SHIMAMOTO, Taisuke
ASANO, Tetsuo
Keywords: computational geometry
Minkowski sum
light path alignment
dual-plane scheme
Issue Date: 2004-05-01
Publisher: 電子情報通信学会
Magazine name: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Volume: E87-A
Number: 5
Start page: 1053
End page: 1058
Abstract: This paper addresses the problem of arranging fewest possible probes to detect a hidden object in a specified region and presents a reasonable scheme for the purpose. Of special interest is the case where an object is a double-sided conic cylinder which represents the shape of the energy distribution of laser light used in the optical network. The performance of our scheme is evaluated by comparing the number of probes to that of an existing scheme, and our scheme shows a potential for reducing the number of probes. In other words, the time for detection is significantly reduced from a realistic point of view.
Rights: Copyright (C)2004 IEICE. T. Shimamoto and T. Asano, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E87-A(5), 2004, 1053-1058. http://www.ieice.org/jpn/trans_online/
URI: http://hdl.handle.net/10119/4690
Material Type: publisher
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
4243.pdf283KbAdobe PDFView/Open

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


Contact : Library Information Section, Japan Advanced Institute of Science and Technology