7 citations · 9 across the 6 of their papers we have counts for
3 papers · 2 filters
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particu…
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash, Sandor P. Fekete, Seoung Kyou Lee +3
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as…
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature
Anna Lubiw, Daniela Maftuleac, Megan Owen
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest pa…