Sung Kwon Kim

Learn More
optimization problem. (For other applications of the problem, see [1,3] and references therein.) To explain the problem we need some definitions and terms. For a sequence A = 〈a1, . . . , an〉 of real numbers, a segment of A is a subsequence 〈ai, . . . , aj 〉 E-mail address: (S.K. Kim). 1 Supported by the ITRI of Chung-Ang University.(More)
RFID, Radio Frequency Identification, technology is a contactless automatic identification technology about which a lot of researches and developments are recently progressing. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved.(More)
Rectangles in a plane provide a very useful abstraction for a number of problems in diverse fields. In this paper we consider the problem of computing geometric properties of a set of rectangles in the plane. We give parallel algorithms for a number of problems usingn processors wheren is the number of upright rectangles. Specifically, we present algorithms(More)
Let P be a convex polygon with n vertices. We want to find two congruent disks whose union covers P and whose radius is minimized. We also consider its discrete version with centers restricted to be at vertices of P . Standard and discrete two-center problems are respectively solved in O(n log n log log n) and O(n log n) time. Furthermore, we can solve both(More)
The RFID system is a contactless automatic identification system that identifies tags attached on goods through radio frequency communication. This system is expected to supplant barcode systems, the contact reading technique that is most widely used at present. The RFID system can be applied in a variety of areas. Among those, Ari Juels proposed an(More)
Let P and Q be disjoint polygons in the plane. We consider the problem of finding an optimal bridge (p,q) , p∈ \partial P and q∈ \partial Q , such that the length of the longest path from a point in P , passing through the bridge (p,q) , to a point Q is minimized. We propose efficient algorithms for three cases according to whether P and Q are convex or(More)