Imagen de Portada

Long Plane Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cabello, Sergio, Hoffmann, Michael, Klost, Katharina, Mulzer, Wolfgang, Tkadlec, Josef
Formato:	Preprint
Publicado:	2021
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
por: Klost, Katharina, et al.
Publicado: (2024)

Minimum spanning blob-trees
por: Klost, Katharina, et al.
Publicado: (2025)

Geometric Give and Take
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Maximum Matchings in Geometric Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2019)

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

Lattice and Non-lattice Piercing of Axis-Parallel Rectangles
por: Dumitrescu, Adrian, et al.
Publicado: (2022)

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
por: Löffler, Maarten, et al.
Publicado: (2024)

Disjoint Compatibility via Graph Classes
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Garment numbers of bi-colored point sets in the plane
por: Aichholzer, Oswin, et al.
Publicado: (2026)

How many times can two minimum spanning trees cross?
por: Antić, Todor, et al.
Publicado: (2026)

Crossing Number of 3-Plane Drawings
por: Goetze, Miriam, et al.
Publicado: (2025)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
por: Gao, Jie, et al.
Publicado: (2025)

Compatible Triangulations of Simple Polygons
por: Afshani, Peyman, et al.
Publicado: (2026)

Searching in Euclidean Spaces with Predictions
por: Cabello, Sergio, et al.
Publicado: (2024)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
por: de Berg, Mark, et al.
Publicado: (2025)

Minimum Plane Bichromatic Spanning Trees
por: Akitaya, Hugo A., et al.
Publicado: (2024)

Packing d-dimensional balls into a d+1-dimensional container
por: Alt, Helmut, et al.
Publicado: (2021)

On $k$-Plane Insertion into Plane Drawings
por: Katheder, Julia, et al.
Publicado: (2024)

Covering the Euclidean Plane by a Pair of Trees
por: Le, Hung, et al.
Publicado: (2025)

Eliminating Crossings in Ordered Graphs
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Better Late than Never: the Complexity of Arrangements of Polyhedra
por: Aronov, Boris, et al.
Publicado: (2025)

Untangling Segments in the Plane
por: da Fonseca, Guilherme D., et al.
Publicado: (2025)

Delaunay Triangulations with Predictions
por: Cabello, Sergio, et al.
Publicado: (2026)

Undecidability of Translational Tiling of the Plane with Four Tiles
por: Yang, Chao, et al.
Publicado: (2025)

Connected Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
por: Yang, Chao, et al.
Publicado: (2025)

An Improved Bound for Plane Covering Paths
por: Akitaya, Hugo A., et al.
Publicado: (2025)

Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
por: Cornelsen, Sabine, et al.
Publicado: (2025)

A New Approach in Plane Kinematics
por: Goessner, Stefan
Publicado: (2026)

Sweeping Arrangements of Non-Piercing Curves in Plane
por: Dalal, Suryendu, et al.
Publicado: (2024)

An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
por: Sukkasem, Phapaengmuang, et al.
Publicado: (2025)

Recognition of Unit Segment and Polyline Graphs is $\exists\mathbb{R}$-Complete
por: Hoffmann, Michael, et al.
Publicado: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
por: Cabello, Sergio, et al.
Publicado: (2021)

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
por: Edelsbrunner, Herbert, et al.
Publicado: (2022)

Tiling Rectangles and the Plane using Squares of Integral Sides
por: Bigham, Bahram Sadeghi, et al.
Publicado: (2021)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)

Dynamic Geometric Connectivity in the Plane with Constant Query Time
por: Chan, Timothy M., et al.
Publicado: (2024)

Curve Stabbing Depth: Data Depth for Plane Curves
por: Durocher, Stephane, et al.
Publicado: (2023)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
por: Chhabra, Himanshu, et al.
Publicado: (2024)