325 citations
- Seoul National UniversityKR9 papers
- Laboratoire d'Informatique Gaspard-MongeFR6 papers
- Université Gustave EiffelFR6 papers
- Ajou UniversityKR5 papers
- Hanyang UniversityKR5 papers
- Korea Advanced Institute of Science and TechnologyKR5 papers
- Inha UniversityKR4 papers
- Korea UniversityKR4 papers
- National Institute for Mathematical SciencesKR3 papers
- Anyang UniversityKR2 papers
- Charles UniversityCZ2 papers
- COMSATS University IslamabadPK2 papers
4 papers · 1 filter
Reachability of turn sequences
William S. Evans, Noushin Saeedi, Chan-Su Shin +1
A turn sequence of left and right turns is realized as a simple rectilinear chain of integral segments whose turns at its bends are the same as the turn sequence. The chain starts…
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\…
Untangling a Planar Graph
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto +3
A straight-line drawing of a planar graph need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of . Let shift de…
Moving Vertices to Make Drawings Plane
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto +2
A straight-line drawing of a planar graph need not be plane, but can be made so by moving some of the vertices. Let shift denote the minimum number of vertices that…