Joondong Kim
Stony Brook University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Joondong Kim.
Discrete and Computational Geometry | 2012
Therese C. Biedl; Mohammad Tanvir Irfan; Justin Iwerks; Joondong Kim; Joseph S. B. Mitchell
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P. In particular, we show that
AIAA Guidance, Navigation, and Control Conference | 2009
Joondong Kim; Jingyu Zou; Joseph S. B. Mitchell
\lfloor\frac{m+1}{3} \rfloor
Information & Computation | 2012
Pablo Montes; Heraldo Memelli; Charles B. Ward; Joondong Kim; Joseph S. B. Mitchell; Steven Skiena
point guards are always sufficient and sometimes necessary to cover an m-polyomino, possibly with holes. When
symposium on computational geometry | 2008
Joondong Kim; Joseph S. B. Mitchell; Valentin Polishchuk; Arto Vihavainen
m \leq\frac{3n}{4} - 4
AIAA Guidance, Navigation and Control Conference and Exhibit | 2008
Joseph Prete; Jimmy Krozel; Joseph S. B. Mitchell; Joondong Kim; Jason Zou
, the sufficiency condition yields a strictly lower guard number than
AIAA Guidance, Navigation and Control Conference and Exhibit | 2008
Jimmy Krozel; Joseph Prete; Joseph S. B. Mitchell; Joondong Kim; Jason Zou
\lfloor\frac{n}{4}\rfloor
algorithmic approaches for transportation modeling optimization and systems | 2009
Joondong Kim; Alexander Kroeller; Joseph S. B. Mitchell
, given by the art gallery theorem for orthogonal polygons.
Computational Geometry: Theory and Applications | 2012
Joondong Kim; Joseph S. B. Mitchell; Valentin Polishchuk; Shang Yang; Jingyu Zou
In this paper, we investigate the sensitivity of capacity estimation results subject to convective weather forecast errors. Our goal is to examine how throughput estimates vary with different types of weather forecast errors, including time shifting, coverage/intensity, and position shifting. We investigate capacity estimates in both en route airspace and transition airspace for Next Generation Air Transportation System (NextGen) routing scenarios. We consider capacity estimation for a variety of weather forecast look-ahead times, ranging from 5 minutes to 2 hours.
Air traffic control quarterly | 2011
Shang Yang; Joseph S. B. Mitchell; Jimmy Krozel; Valentin Polishchuk; Joondong Kim; Jingyu Zou
Restriction enzymes are the workhorses of molecular biology. We introduce a new problem which arises in the course of our project to design virus variants to serve as potential vaccines: we wish to modify virus-length genomes to introduce large numbers of unique restriction enzyme recognition sites while preserving wild-type function by substitution of synonymous codons. We show that the resulting problem is NP-Complete, give an exponential-time algorithm, as well as well-performing heuristics, and give excellent results for five sample viral genomes. Our resulting modified genomes have several times more unique restriction sites and reduce the maximum gap between adjacent sites by three to nine-fold.
symposium on computational geometry | 2011
Therese C. Biedl; Mohammad Tanvir Irfan; Justin Iwerks; Joondong Kim; Joseph S. B. Mitchell
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated by applications in air traffic management: aircraft must be routed while avoiding no-fly zones and weather constraints and while maintaining at least a specified horizontal separation distance between themselves. Given a polygonal domain with moving obstacles, our goal is to determine the maximum number of unit disks (aircraft with safety zones) that can be routed safely through the domain, entering/exiting through specified edges of the domain. The video is meant to accompany the paper [1], which gives details of the algorithm and its analysis.