External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon

Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack. An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. In Burkhard Monien, Robert Cori, editors, STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings. Volume 349 of Lecture Notes in Computer Science, pages 96-107, Springer, 1989.

Authors

Hristo Djidjev

This author has not been identified. Look up 'Hristo Djidjev' in Google

Andrzej Lingas

This author has not been identified. Look up 'Andrzej Lingas' in Google

Jörg-Rüdiger Sack

This author has not been identified. Look up 'Jörg-Rüdiger Sack' in Google
runs on