Kyonggi University

output

20072026

most citedMotion Corrected Multishot MRI Reconstruction Using Generative Networks with Sensitivity Encoding

87 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

S. Bae11 · h 14
Dongseok Kim7 · h 9
Matias Korman2 profiles7 · h 18
H. Lee5 · h 16
Jaeun Lee5 · h 16
Sun Kwang Kim5 · h 13
Hee-Kap Ahn4 · h 17
Jinmyoung Seok4 · h 14
Sangrak Kim4 · h 5
Y. Kwon4 · h 14
A. Vigneron3 · h 16
Pilsoo Shin3 · h 7

collaborating institutions

Pohang University of Science and TechnologyKR6 papers
Dongguk UniversityKR5 papers
Seoul National UniversityKR5 papers
Korea Advanced Institute of Science and TechnologyKR4 papers
Yeungnam UniversityKR4 papers
The University of SydneyAU3 papers
Tohoku UniversityJP3 papers
Université Libre de BruxellesBE3 papers
University of Electro-CommunicationsJP3 papers
Utah State UniversityUS3 papers
Yonsei UniversityKR3 papers
Carleton UniversityCA2 papers

Showing 2018 · cs.CGShow all

2 papers · 2 filters

cs.CG2018★ 1 cited

$L_{1}$ Shortest Path Queries in Simple Polygons

Sang Won Bae, Haitao Wang

Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_{1}$ shortest path queries in $P$ . We build a data structure of $O (n)$ size in $O (n)$ time such that given any t…

cs.CG2018★ 3 cited

Closest-Pair Queries in Fat Rectangles

Sang Won Bae, Michiel Smid

In the range closest pair problem, we want to construct a data structure storing a set $S$ of $n$ points in the plane, such that for any axes-parallel query rectangle $R$ , the clos…

L1​ Shortest Path Queries in Simple Polygons

Closest-Pair Queries in Fat Rectangles

$L_{1}$ Shortest Path Queries in Simple Polygons