Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Elena Arseneva"'
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff35a91e97058a907335d92d88fe1b21
https://doi.org/10.1007/978-3-030-96731-4_8
https://doi.org/10.1007/978-3-030-96731-4_8
Autor:
Tamara Mchedlidze, Elena Arseneva
Publikováno v:
Computational Geometry. 110:101962
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9634d8efa416a852fc36e5ed2acf8c43
https://doi.org/10.1016/j.comgeo.2022.101962
https://doi.org/10.1016/j.comgeo.2022.101962
Autor:
Saeed Mehrabi, Pilar Cano, Elena Arseneva, Irene Parada, Linda Kleist, Pavel Valtr, Tamara Mchedlidze
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030682101
WALCOM
WALCOM
We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set S has size at least the number of vertices in the tree. For the special case where the tree is a path P we show that: (a) If S is one-si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77b193ca3f8b40efa29c15de00ac85ed
https://doi.org/10.1007/978-3-030-68211-8_19
https://doi.org/10.1007/978-3-030-68211-8_19
Publikováno v:
Journal of Information Processing, 28
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 of determining the graph structure of the polyhedra from a gluing is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e5ce2d0828a1f27b973c0562c105a9d
Publikováno v:
Journal of Information Processing, 28 (0
A data structure is presented that explicitly maintains the graph of a Voronoi diagram of $N$ point sites in the plane or the dual graph of a convex hull of points in three dimensions while allowing insertions of new sites/points. Our structure suppo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e31411326b4039cd788d1a8564c539f
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
LATIN
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The final authenticated version is available online at https://doi.org/10.1007/978-3-030-61792-9_18 We study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c14afcbf28361aef7d5b8ca926bcb914
https://doi.org/10.1007/978-3-030-61792-9_18
https://doi.org/10.1007/978-3-030-61792-9_18
Autor:
Elena Arseneva, Stefan Langerman
Publikováno v:
Graphs and combinatorics
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-covered 2D polygons. We give examples for most of them, including all simpl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc99174ae8379ea9ba3d664d4505b1d7
Autor:
Evanthia Papadopoulou, Elena Arseneva
Publikováno v:
Journal of Combinatorial Optimization. 37:579-600
The Hausdorff Voronoi diagram of clusters of points in the plane is a generalization of Voronoi diagrams based on the Hausdorff distance function. Its combinatorial complexity is $$O(n+m)$$ , where n is the total number of points and $$m$$ is the num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4f541eb5585d0f34d36b1d1713d9fd2
https://doi.org/10.1007/s10878-018-0347-x
https://doi.org/10.1007/s10878-018-0347-x
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030199548
CSR
CSR
An \(\omega \)-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 \(\omega < \pi \). Given a convex polygon P, we place the \(\omega \)-wedge such that P is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab467cd49cc735111024f21f1e373838
https://doi.org/10.1007/978-3-030-19955-5_3
https://doi.org/10.1007/978-3-030-19955-5_3
Autor:
Fabrizio Frati, Pilar Cano, Vida Dujmović, Alessandra Tappini, Stefan Langerman, Elena Arseneva, Prosenjit Bose, Anthony D’Angelo
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Graph Drawing and Network Visualization-26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings
Journal of Graph Algorithms and Applications
Lecture Notes in Computer Science-Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Graph Drawing and Network Visualization-26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings
Journal of Graph Algorithms and Applications
We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63e00165dbf6cf80e88ec65658d914a6
http://arxiv.org/abs/1808.10738
http://arxiv.org/abs/1808.10738