Geometric Algorithms for Portable devices

2018 Fiscal Year Research-status Report

• Project/Area Number: 17K12635
• Research Institution: Tohoku University
• Principal Investigator: Korman Matias 東北大学, 情報科学研究科, 助教 (80732718)
• Project Period (FY): 2017-04-01 – 2020-03-31
• Keywords: Computational Geometry / Algorithms / Data Structures / Simple Polygons / Routing

Outline of Annual Research Achievements

Research is well underway. Milestones for 2018 have been met, and the goals for 2019 are well underway. We highlight the following results:
Routing in the presence of obstacles: we provided two strategies in 2017. In 2018 we extended the strategies to consider the presence of obstacles. We are currently writing a third one that is under review for publication.
Graph separation: We have introduced a new concept so that a dense graphs can be split into disjoint plane layers. In each layer we can afterwards use the routing techniques described above.
Ball tournament: we introduced several subquadratic algorithms for a label visualization problems.

Current Status of Research Progress

2: Research has progressed on the whole more than it was originally planned.

Reason

Results for 2018 have already been sent for journal publication (or have already been accepted).

The problems planned for 2019 are well on their way. Results are being written and will be submitted for publication soon

Strategy for Future Research Activity

In 2019 we will continue as planned.

Research Products

• [Journal Article] Faster algorithms for growing prioritized disks and rectangles (2019)
  • Author(s): Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, Ande van Renssen, Antoine Vigneron
  • Journal Title: Comput. Geom Volume: 80 Pages: 23-39
  • DOI: https://doi.org/10.1016/j.comgeo.2019.02.001
• [Journal Article] Computing the geodesic centers of a polygonal domain (2019)
  • Author(s): S. W. Bae, M. Korman, and Y. Okamoto
  • Journal Title: Computational Geometry: Theory and Applications Volume: 77 Pages: 3-9
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Gap-planar graphs (2018)
  • Author(s): S. W. Bae, J.-F. Baffier, J. Chun, P. Eades, K. Eickmeyer, L. Grilli, S.-H. Hong, M. Korman, F. Montecchiani, I. Rutter, and C. D. Toth
  • Journal Title: Theoretical Computer Science Volume: 745 Pages: 36-52
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Computational geometry column 67. (2018)
  • Author(s): B. Banyassady, M. Korman, and W. Mulzer
  • Journal Title: SIGACT News, 49 Volume: 2 Pages: 77-94
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Improved time-space trade-offs for computing voronoi diagrams (2018)
  • Author(s): B. Banyassady, M. Korman, W. Mulzer, A. v. Renssen, M. Roeloffzen, P. Seiferth, and Y. Stein
  • Journal Title: Journal of Computational Geometry Volume: 1 Pages: 191-212
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Dynamic graph coloring (2018)
  • Author(s): L.Barba, J.Cardinal, M.Korman, S.Langerman, A.v.Renssen, M.Roeloffzen,and S.Verdonschot
  • Journal Title: Algorithmica Volume: 1 Pages: 1-1
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Routing on the visibility graph (2018)
  • Author(s): P. Bose, M. Korman, A. van Renssen, and S. Verdonschot
  • Journal Title: Journal of Computational Geometry Volume: 9(1) Pages: 430-453
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] High dimensional consistent digital segments (2018)
  • Author(s): M.Chiu and M.Korman
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 32(4) Pages: 2566-2590
  • Peer Reviewed / Int'l Joint Research
• [Presentation] Circumscribing polygons and polygonizations for disjoint line segments. (2019)
  • Author(s): H. Akitaya, M. Korman, M. Rudoy, D. Souvaine, and C. Toth.
  • Organizer: Symposium on Computational geometry (SoCG’19)
  • Int'l Joint Research
• [Presentation] Rectilinear link diameter and radius in a rectilinear polygonal domain (2018)
  • Author(s): E. Arseneva, M. Chiu, M. Korman, A. Markovic, Y. Okamoto, A. Ooms, A. van Renssen, and M. Roeloffzen.
  • Organizer: International Symposium on Algorithms and Computation
  • Int'l Joint Research
• [Presentation] Experimental Study of Compressed Stack Algorithms in Limited Memory Environments (2018)
  • Author(s): Jean-Francois Baffier, Yago Diez, Matias Korman
  • Organizer: Symposium on Experimental Algorithms
  • Int'l Joint Research