An O(n log n) Algorithm for Finding a Shortest Central Link Segment

Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack. An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geometry Appl., 10(2):157-188, 2000.

@article{AleksandrovDS00,
  title = {An O(n log n) Algorithm for Finding a Shortest Central Link Segment},
  author = {Lyudmil Aleksandrov and Hristo Djidjev and Jörg-Rüdiger Sack},
  year = {2000},
  researchr = {https://researchr.org/publication/AleksandrovDS00},
  cites = {0},
  citedby = {0},
  journal = {Int. J. Comput. Geometry Appl.},
  volume = {10},
  number = {2},
  pages = {157-188},
}