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.

Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible

Binay K. Bhattacharya, Asish Mukhopadhyay. Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. In John Staples, Peter Eades, Naoki Katoh, Alistair Moffat, editors, Algorithms and Computation, 6th International Symposium, ISAAC 95, Cairns, Australia, December 4-6, 1995, Proceedings. Volume 1004 of Lecture Notes in Computer Science, pages 22-31, Springer, 1995.

Abstract

Abstract is missing.

runs on