Chan-Su Shin

Hankuk University of Foreign Studies — South Korea

Computer Science · Physical Sciences

14h-index713citations88works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(69), Data Management and Algorithms(18), Robotic Path Planning Algorithms(16), Digital Image Processing Techniques(11), Remote Sensing and LiDAR Applications(10)

Publications88 total

Inscribed and circumscribed histogons of a convex polygon
Computational Geometry·2025
Largest unit rectangles inscribed in a convex polygon
Computational Geometry·2024· 1 cited
Inscribing or Circumscribing a Histogon to a Convex Polygon
SSRN Electronic Journal·2024Open Access
Largest Unit Rectangles Inscribed in a Convex Polygon
SSRN Electronic Journal·2023Open Access
The Lower Bound of the Distance between the Start point and End point of Axis-reachable 2-dimensional Rectilinear Chain
KIISE Transactions on Computing Practices·2022
Reachability of turn sequences
arXiv (Cornell University)·2022Open Access
One-to-One Disjoint Cover of Non-bipartite k-ary n-cube with Faulty Edges
Journal of KIISE·2021· 1 cited
Minimum rectilinear polygons for given angle sequences
Computational Geometry·2021· 3 citedOpen Access
Area bounds of rectilinear polygons realized by angle sequences
Computational Geometry·2019· 3 cited
Tight bounds for beacon-based coverage in simple rectilinear polygons
Computational Geometry·2019· 4 cited
Minimum-width annulus with outliers: Circular, square, and rectangular cases
Information Processing Letters·2019· 1 cited
The minimum convex container of two convex polytopes under translations
Computational Geometry·2018· 4 cited
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
Lecture notes in computer science·2018
Covering points with convex sets of minimum size
Theoretical Computer Science·2016· 5 cited
Guest Editor’s Foreword
Algorithmica·2016Open Access
Covering Points with Convex Sets of Minimum Size
Lecture notes in computer science·2016· 4 cited
Minimum Rectilinear Polygons for Given Angle Sequences
Lecture notes in computer science·2016· 4 cited
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
Lecture notes in computer science·2016· 2 cited
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme
Theoretical Computer Science·2015· 1 cited
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons
arXiv (Cornell University)·2015· 3 citedOpen Access
page 1 of 5Next →

Frequent Co-authors

Hee-Kap Ahn(12), Antoine Vigneron(12), Alexander Wolff(11), Sung Kwon Kim(9), Peter Braß(9), Christian Knauer(9), Kyung‐Yong Chwa(8), Sang Won Bae(8), Otfried Cheong(7), Hyeon-Suk Na(7), Noushin Saeedi(4), Sheung-Hung Poon(3), Yoshio Okamoto(3), William Evans(3), Tycho Strijk(2), Chong-Dae Park(2), Byung-Cheol Jo(2), Esther Moet(2), René van Oostrum(2), Sung Yong Shin(2)