Chan-Su Shin

Orcid: 0000-0003-3073-6863

According to our database1, Chan-Su Shin authored at least 59 papers between 1996 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Reachability of turn sequences.
CoRR, 2022

Minimum rectilinear polygons for given angle sequences.
Comput. Geom., 2022

Inscribing or Circumscribing a Histogon to a Convex Polygon.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Approximating Convex Polygons by Histogons.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2019
Minimum-width annulus with outliers: Circular, square, and rectangular cases.
Inf. Process. Lett., 2019

Tight bounds for beacon-based coverage in simple rectilinear polygons.
Comput. Geom., 2019

Area bounds of rectilinear polygons realized by angle sequences.
Comput. Geom., 2019

The minimum convex container of two convex polytopes under translations.
Comput. Geom., 2019

Representing Graphs and Hypergraphs by Touching Polygons in 3D.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Covering points with convex sets of minimum size.
Theor. Comput. Sci., 2018

2016
Guest Editor's Foreword.
Algorithmica, 2016

Covering Points with Convex Sets of Minimum Size.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme.
Theor. Comput. Sci., 2015

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons.
CoRR, 2015

2014
Minimum Convex Container of Two Convex Polytopes under Translations.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
A note on minimum-sum coverage by aligned disks.
Inf. Process. Lett., 2013

Covering and piercing disks with two centers.
Comput. Geom., 2013

Realistic roofs over a rectilinear polygon.
Comput. Geom., 2013

Range-Aggregate Queries for Geometric Extent Problems.
Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012
The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications.
Int. J. Comput. Geom. Appl., 2012

A Note on Minimum-Cost Coverage by Aligned Disks
CoRR, 2012

2011
The Aligned k-Center Problem.
Int. J. Comput. Geom. Appl., 2011

Generating Realistic Roofs over a Rectilinear Polygon.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Guarding a Polygon from Two Nearly-Opposite Directions.
Int. J. Comput. Geom. Appl., 2010

Covering a simple polygon by monotone directions.
Comput. Geom., 2010

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract).
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

Untangling a Planar Graph.
Discret. Comput. Geom., 2009

Computing k-Centers On a Line
CoRR, 2009

Escaping offline searchers and isoperimetric theorems.
Comput. Geom., 2009

On the minimum total length of interval systems expressing all intervals, and range-restricted queries.
Comput. Geom., 2009

2008
Constructing the City Voronoi Diagram Faster.
Int. J. Comput. Geom. Appl., 2008

Maximum overlap and minimum convex hull of two convex polyhedra under translations.
Comput. Geom., 2008

2007
Maximizing the overlap of two planar convex sets under rigid motions.
Comput. Geom., 2007

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Moving Vertices to Make Drawings Plane.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Guarding Art Galleries by Guarding Witnesses.
Int. J. Comput. Geom. Appl., 2006

Farthest-point queries with geometric and combinatorial constraints.
Comput. Geom., 2006

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Comput. Geom., 2006

2005
Adaptive Zooming in Point Set Labeling.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Facility location and the geometric minimum-diameter spanning tree.
Comput. Geom., 2004

Labeling Points with Weights.
Algorithmica, 2004

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Computing farthest neighbors on a convex polytope.
Theor. Comput. Sci., 2003

Building bridges between convex region.
Comput. Geom., 2003

2001
Computing the Optimal Bridge between Two Polygons.
Theory Comput. Syst., 2001

Labeling a Rectilinear Map with Sliding Labels.
Int. J. Comput. Geom. Appl., 2001

Labeling Points with Weights.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes.
J. Parallel Distributed Comput., 2000

Placing two disks in a convex polygon.
Inf. Process. Lett., 2000

Area-efficient algorithms for straight-line tree drawings.
Comput. Geom., 2000

Efficient Algorithms for Two-Center Problems for a Convex Polygon.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998
The Widest <i>k</i>-Dense Corridor Problems.
Inf. Process. Lett., 1998

Algorithms for Drawing Binary Trees in the Plane.
Inf. Process. Lett., 1998

Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Two-Center Problems for a Convex Polygon (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Directed Hamiltonian Packing in <i>d</i>-Dimensional Meshes and Its Application (Extended Abstract).
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996


  Loading...