1 citations · 1 across the 3 of their papers we have counts for
7 papers
Dynamic Schnyder Woods
Sujoy Bhore, Prosenjit Bose, Pilar Cano +2
A realizer, commonly known as Schnyder woods, of a triangulation is a partition of its interior edges into three oriented rooted trees. A flip in a realizer is a local operation th…
Fragile Complexity of Adaptive Algorithms
Prosenjit Bose, Pilar Cano, Rolf Fagerberg +3
The fragile complexity of a comparison-based algorithm is if each input element participates in comparisons. In this paper, we explore the fragile complexity of al…
Upward Point Set Embeddings of Paths and Trees
Elena Arseneva, Pilar Cano, Linda Kleist +4
We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set has size at least the number of vertices in the tree. For the…
Affine invariant triangulations
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
We study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set for any (unknown) affine transformation of . Our wor…
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …
On the number of crossings in a random labelled tree with vertices in convex position
Octavio Arizmendi, Pilar Cano, Clemens Huemer
We prove that the number of crossings in a random labelled tree with vertices in convex position is asymptotically Gaussian with mean and variance . A similar res…