Before revision: We devise  dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to  simple polygon amid vertex insertions and deletions to  simple polygon.
After revision: We devise dynamic algorithms for both maintaining as well as querying for the visibility and weak visibility polygons amid vertex insertions and/or deletions to the simple polygon. * Maintaining visibility polygon of a fixed point located interior to simple polygon amid vertex insertions and deletions to simple polygon.