This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in the sense that a change to the structure destroys the old version, leaving only the new versionâ€¦ (More)

A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, givenâ€¦ (More)

The fully dynamic planarity testing problem consists of performing an arbitrary sequence of the following three kinds of operations on a planar graph G (i) insert an edge if the i resultant graphâ€¦ (More)

This paper introduces compressed certificates for planarity, biconnectivity and triconnectivity in planar graphs, and proves many structural properties of certificates in planar graphs. As anâ€¦ (More)

if the structure to be mapped is a DAG. We presented heuristics to handle the above cases. Finally we presented a performance study that bears out our analytical results, and shows that the optimalâ€¦ (More)

A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, givenâ€¦ (More)