Casting an object with a core (2005)
Ahn, Hee-Kap, Cheng, Siu-Wing, Bae, Sang Won, Chwa, Kyung-Yong
This paper addresses geometric problems that concern manufacturing an object using a cast with a core. In casting, molten material is poured into the cavity of the cast and allowed to solidify. The...
On the arrangement of cliques in chordal graphs with respect to the cuts (2004)
Chandran, L. Sunil, Narayanaswamy, N.S., Chwa, Kyung-Yong, Munro, J. Ian
Kyung-Yong Chwa, Byung-Cheol Jo, (2003)
Rene Oostrum, Chan-su Shin, Kyung-yong Chwa, Byung-cheol Jo, Christian Knauer, Esther Moet
Let P be a simple polygon. We define a witness set W to be a set of points such that if any (prospective) guard set G guards W , then it is guaranteed that G guards P .
Journal of Graph Algorithms and Applications (2001)
Jae-ha Lee, Chong-dae Park, Kyung-yong Chwa
We introduce an online relocation problem on a graph, in which a player that walks around the vertices makes decisions on whether to relocate mobile resources, while not knowing the future requests....
Carrying Umbrellas: An Online Relocation Game on a Graph (2001)
Jae-ha Lee, Chong-dae Park, Kyung-yong Chwa
We introduce an online relocation problem on a graph, in which a player that walks around the vertices makes decisions on whether to relocate mobile resources, while not knowing the future requests....
A Characterization of the Class of Polygons Searchable by a 1-Searcher (2001)
Sang-min Park, Jae-ha Lee, Kyung-yong Chwa
The 1-searcher is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. We...
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher (2001)
Sang-min Park, Jae-ha Lee, Kyung-yong Chwa
We consider the most basic visibility-based pursuit-evasion problem defined as follows: Given a polygonal region, a searcher with 360 # vision, and an unpredictable intruder that is arbitrarily...
On the Polygon-Search Conjecture (2000)
Sang-min Park, Kyung-yong Chwa, Jae-ha Lee
The polygon search problem is the problem of searching a mobile intruder in a polygonal region by a mobile searcher with various visibility. The k-searcher is a mobile guard whose visibility is...
Searching a Polygonal Room with One Door by a 1-Searcher (2000)
Jae-ha Lee, Sang-min Park, Kyung-yong Chwa
The 1-searcher is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed....
Recursive Circulants and their Embeddings among Hypercubes (2000)
We propose an interconnection structure for multicomputer networks, called recursive circulant. Recursive circulant G(N; d) is dened to be a circulant graph with N nodes and jumps of powers of d....
Image Morphing Using Deformable Surfaces (1999)
Seung-yong Lee, Kyung-yong Chwa, James Hahn
This paper presents a new image morphing technique using deformable surfaces. Drawbacks of previous techniques are overcome by a physically-based approach which provides an intuitive model for a...
Online Scheduling of Parallel Communications with Individual Deadlines (1999)
We consider the online competitiveness for scheduling a set of communication jobs (best described in terms of a weighted graph where nodes denote the communication agents and edges denote...
Image Morphing Using Deformable Surfaces (1998)
Seung-yong Lee, Kyung-yong Chwa, James Hahn
This paper presents a new image morphing technique using deformable surfaces. Drawbacks of previous techniques are overcome by a physically-based approach which provides an intuitive model for a...
Image Morphing Using Deformable Surfaces (1998)
Seung-yong Lee, Kyung-yong Chwa, James Hahn
This paper presents a new image morphing technique using deformable surfaces. Drawbacks of previous techniques are overcome by a physically-based approach which provides an intuitive model for a...
Image Morphing Using Deformable Surfaces (1998)
Seung-yong Lee, Kyung-yong Chwa, James Hahn
This paper presents a new image morphing technique using deformable surfaces. Drawbacks of previous techniques are overcome by a physically-based approach which provides an intuitive model for a...
Two-Center Problems for a Convex Polygon (1998)
Jung-hyun Kim, Sung Kwon Kim, Kyung-yong Chwa
this paper, we consider some variants of the 2-center problems for the point set. Let
Two-Center Problems for a Convex Polygon (1998)
Jung-hyun Kim, Sung Kwon Kim, Kyung-yong Chwa
this paper, we consider some variants of the 2-center problems for the point set. Let
Computing Two Centers of a Convex Polygon (1998)
Jung-hyun Kim, Sung Kwon Kim, Kyung-yong Chwa
this paper, we consider some variants of the 2-center problems for the point set. Let G be a convex polygon of n vertices in the plane. We consider the standard 2-center problem for the convex...
Embeddings Of Butterflies Into Hypermeshes (1998)
Sook-yeon Kim, Kyung-yong Chwa
Hypermeshes have been given much attention as a versatile interconnection network of parallel computers. A hypermesh is obtained from a mesh by replacing each linear connection with a hyperedge. In...
Embeddings of Butterflies into Hypermeshes (1997)
Sook-yeon Kim, Oh-heum Kwon, Kyung-yong Chwa
Hypermeshes have been given much attention as a versatile interconnection network of parallel computers. A hypermesh is obtained from a mesh by replacing each linear connection with a hyperedge. In...
Image Metamorphosis with Scattered Feature Constraints (1997)
Seungyong Lee, George Wolberg, Kyung-yong Chwa, Sung Yong Shin
This paper describes an image metamorphosis technique to handle scattered feature constraints specified with points, polylines, and splines. Solutions to the following three problems are presented:...
Optimal Embeddings of Multiple Graphs into a Mesh of Buses (1997)
Sook-yeon Kim, Kyung-yong Chwa
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by replacing each linear connection with a bus. We optimally embed multiple graphs into a MOB by a...
Optimal Embeddings of Multiple Graphs into a Hypermesh (1997)
Sook-yeon Kim, Kyung-yong Chwa
A hypermesh, a versatile parallel architecture, is obtained from a 2-dimensional mesh by replacing each linear connection with a hyper-edge. We optimally embed multiple graphs into a hypermesh by a...
Image Metamorphosis Using Snakes and Free-Form Deformations (1997)
Seung-yong Lee, Kyung-yong Chwa, Sung Yong Shin, George Wolberg
This paper presents new solutions to the following three problems in image morphing: feature specification, warp generation, and transition control. To reduce the burden of feature specification, we...
Image Metamorphosis with Scattered Feature Constraints (1997)
Seungyong Lee, George Wolberg, Kyung-yong Chwa, Sung Yong Shin
This paper describes an image metamorphosis technique to handle scattered feature constraints specified with points, polylines, and splines. Solutions to the following three problems are presented:...
Image Morphing Using Deformation Techniques (1997)
Seung-yong Lee, Kyung-yong Chwa, James Hahn
This paper presents a new image morphing method using a two-dimensional deformation technique which provides an intuitive model for a warp. The deformation technique derives a C
Embedding Tree-Related Graphs Into Hypercubes (1997)
Sook-yeon Kim, Kyung-yong Chwa
We propose a general strategy of many-to-one embedding of treerelated graphs into hypercubes. These tree-related graphs include complete binary tree (CBT), mesh of trees (MOT), pyramid and so on....
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons (Extended Abstract) (1996)
We consider searching problems in robotics that a robot has to find a path to a target by traveling in an unknown star-shaped polygon P. The goal is to minimize the ratio of the distance traveled by...