Optimal algorithms for two-guard walkability of simple polygons Conference

Bhattacharya, B, Mukhopadhyay, A, Narasimhan, G. (2001). Optimal algorithms for two-guard walkability of simple polygons . LECTURE NOTES IN COMPUTER SCIENCE, 2125 438-449.

International Collaboration

cited authors

  • Bhattacharya, B; Mukhopadhyay, A; Narasimhan, G

authors

date/time interval

  • August 8, 2001 -

publication date

  • January 1, 2001

published in

keywords

  • Computer Science
  • Computer Science, Theory & Methods
  • HAMILTONIAN TRIANGULATIONS
  • Mathematics
  • Mathematics, Applied
  • Physical Sciences
  • Science & Technology
  • Technology
  • VISIBILITY

Location

  • RI, PROVIDENCE

International Standard Book Number (ISBN) 10

Conference

  • 7th International Workshop on Algorithms and Data Structures (WADS 01)

publisher

  • SPRINGER-VERLAG BERLIN

start page

  • 438

end page

  • 449

volume

  • 2125