Chan-Su Shin

713 total citations
37 papers, 196 citations indexed

About

Chan-Su Shin is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Signal Processing. According to data from OpenAlex, Chan-Su Shin has authored 37 papers receiving a total of 196 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computer Graphics and Computer-Aided Design, 15 papers in Computer Vision and Pattern Recognition and 10 papers in Signal Processing. Recurrent topics in Chan-Su Shin's work include Computational Geometry and Mesh Generation (29 papers), Data Management and Algorithms (10 papers) and Robotic Path Planning Algorithms (8 papers). Chan-Su Shin is often cited by papers focused on Computational Geometry and Mesh Generation (29 papers), Data Management and Algorithms (10 papers) and Robotic Path Planning Algorithms (8 papers). Chan-Su Shin collaborates with scholars based in South Korea, United States and Germany. Chan-Su Shin's co-authors include Hee-Kap Ahn, Alexander Wolff, Antoine Vigneron, Peter Braß, Otfried Cheong, Kyung‐Yong Chwa, Hyeon-Suk Na, Tycho Strijk, Christian Knauer and Takeaki Uno and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Algorithmica.

In The Last Decade

Chan-Su Shin

33 papers receiving 184 citations

Peers

Chan-Su Shin

CGCD

CVPR

SP

IME

CTM

Manuel Abellanas Spain

Matias Korman Japan

J. Antoni Sellarès Spain

Paz Carmi Israel

Wolfgang Mulzer Germany

F. Hurtado Spain

J. Matoušek Czechia

Maarten Löffler Netherlands

Pablo Pérez-Lantero Chile

Hannes Krasser Austria

Manuel Abellanas Spain

Chan-Su Shin

140 ×1.1

CGCD

60 ×0.9

CVPR

60 ×1.2

SP

22 ×0.7

IME

67 ×2.2

CTM

Citations per year, relative to Chan-Su Shin Chan-Su Shin (= 1×) peers Manuel Abellanas

Countries citing papers authored by Chan-Su Shin

Since Specialization

Citations

This map shows the geographic impact of Chan-Su Shin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chan-Su Shin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chan-Su Shin more than expected).

Fields of papers citing papers by Chan-Su Shin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chan-Su Shin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chan-Su Shin. The network helps show where Chan-Su Shin may publish in the future.

Co-authorship network of co-authors of Chan-Su Shin

This figure shows the co-authorship network connecting the top 25 collaborators of Chan-Su Shin. A scholar is included among the top collaborators of Chan-Su Shin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chan-Su Shin. Chan-Su Shin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Chung, Jaehoon, et al.. (2024). Largest unit rectangles inscribed in a convex polygon. Computational Geometry. 124-125. 102135–102135. 1 indexed citations

2.

Bae, Sang Won, Chan-Su Shin, & Antoine Vigneron. (2019). Tight bounds for beacon-based coverage in simple rectilinear polygons. Computational Geometry. 80. 40–52.

3.

Ahn, Hee-Kap, et al.. (2018). The minimum convex container of two convex polytopes under translations. Computational Geometry. 77. 40–50. 1 indexed citations

4.

Bae, Sang Won, et al.. (2016). Covering points with convex sets of minimum size. Theoretical Computer Science. 718. 14–23. 1 indexed citations

5.

Braß, Peter, Hyeon-Suk Na, & Chan-Su Shin. (2015). Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. Theoretical Computer Science. 607. 96–112. 1 indexed citations

6.

Ahn, Hee-Kap & Chan-Su Shin. (2014). Algorithms and Computation : 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. CERN Document Server (European Organization for Nuclear Research). 1 indexed citations

7.

Ahn, Hee-Kap, et al.. (2014). Minimum Convex Container of Two Convex Polytopes under Translations.. Canadian Conference on Computational Geometry. 1 indexed citations

8.

Ahn, Hee-Kap, Sang Won Bae, Christian Knauer, et al.. (2013). Realistic roofs over a rectilinear polygon. Computational Geometry. 46(9). 1042–1055. 1 indexed citations

9.

Ahn, Hee-Kap, et al.. (2012). Covering and piercing disks with two centers. Computational Geometry. 46(3). 253–262. 3 indexed citations

10.

Ahn, Hee-Kap, Peter Braß, Christian Knauer, Hyeon-Suk Na, & Chan-Su Shin. (2009). Covering a simple polygon by monotone directions. Computational Geometry. 43(5). 514–523. 1 indexed citations

11.

Braß, Peter, et al.. (2008). Escaping offline searchers and isoperimetric theorems. Computational Geometry. 42(2). 119–126. 6 indexed citations

12.

Ahn, Hee-Kap, et al.. (2006). Maximizing the overlap of two planar convex sets under rigid motions. Computational Geometry. 37(1). 3–15. 14 indexed citations

13.

Daescu, Ovidiu, Ningfang Mi, Chan-Su Shin, & Alexander Wolff. (2005). Farthest-point queries with geometric and combinatorial constraints. Computational Geometry. 33(3). 174–185. 10 indexed citations

14.

Ahn, Hee-Kap, Peter Braß, Otfried Cheong, et al.. (2005). Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Computational Geometry. 33(3). 152–164. 13 indexed citations

15.

Ahn, Hee-Kap, et al.. (2005). Maximizing the overlap of two planar convex sets under rigid motions. National University of Singapore. 356–363. 4 indexed citations

16.

Gudmundsson, Joachim, Herman Haverkort, Sang‐Min Park, Chan-Su Shin, & Alexander Wolff. (2003). Facility location and the geometric minimum-diameter spanning tree. Computational Geometry. 27(1). 87–106. 5 indexed citations

17.

Cheong, Otfried, Chan-Su Shin, & Antoine Vigneron. (2003). Computing farthest neighbors on a convex polytope. Theoretical Computer Science. 296(1). 47–58. 6 indexed citations

18.

Shin, Chan-Su, et al.. (2000). Area-efficient algorithms for straight-line tree drawings. Computational Geometry. 15(4). 175–202. 13 indexed citations

19.

Shin, Chan-Su, et al.. (1998). Two-Center Problems for a Convex Polygon.

20.

Shin, Chan-Su, Sung Yong Shin, & Kyung‐Yong Chwa. (1998). The widest k-dense corridor problems. Information Processing Letters. 68(1). 25–31. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact