1 citations · 1 across the 3 of their papers we have counts for
9 papers
Morphing tree drawings in a small 3D grid
Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina
We study crossing-free grid morphs for planar tree drawings using 3D. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at con…
Adjacency Graphs of Polyhedral Surfaces
Elena Arseneva, Linda Kleist, Boris Klemz +4
We study whether a given graph can be realized as an adjacency graph of the polygonal cells of a polyhedral surface in . We show that every graph is realizable as a p…
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…
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons
Elena Arseneva, Stefan Langerman, Boris Zolotov
We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method…
Sublinear Explicit Incremental Planar Voronoi Diagrams
Elena Arseneva, John Iacono, Grigorios Koumoutsos +2
A data structure is presented that explicitly maintains the graph of a Voronoi diagram of point sites in the plane or the dual graph of a convex hull of points in three dimensi…
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 …
Which convex polyhedra can be made by gluing regular hexagons?
Elena Arseneva, Stefan Langerman
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-cover…
Pole Dancing: 3D Morphs for Tree Drawings
Elena Arseneva, Prosenjit Bose, Pilar Cano +5
We study the question whether a crossing-free 3D morph between two straight-line drawings of an -vertex tree can be constructed consisting of a small number of linear morphing s…
Reconstructing a convex polygon from its -cloud
Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel +1
An -wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle . Given a convex polygon…