Imagen de Portada

Simultaneous Embedding of Two Paths on the Grid

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kobourov, Stephen, Lenhart, William, Liotta, Giuseppe, Perz, Daniel, Valtr, Pavel, Zink, Johannes
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Three Edge-disjoint Plane Spanning Paths in a Point Set
por: Kindermann, Philipp, et al.
Publicado: (2023)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
por: Förster, Henry, 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)

Edge-Constrained Hamiltonian Paths on a Point Set
por: Antić, Todor, et al.
Publicado: (2025)

Outerplanar and Forest Storyplans
por: Fiala, Jiří, et al.
Publicado: (2023)

Using Reinforcement Learning to Optimize the Global and Local Crossing Number
por: Brand, Timo, et al.
Publicado: (2025)

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

Noncrossing Longest Paths and Cycles
por: Aloupis, Greg, et al.
Publicado: (2024)

Flips in Odd Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

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

Flipping Matchings is Hard
por: Binucci, Carla, et al.
Publicado: (2025)

Tangling and Untangling Trees on Point-sets
por: Di Battista, Giuseppe, et al.
Publicado: (2025)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

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

Bounding and computing obstacle numbers of graphs
por: Balko, Martin, et al.
Publicado: (2022)

Optimal Orthogonal Drawings in Linear Time
por: Didimo, Walter, et al.
Publicado: (2025)

Size Should not Matter: Scale-invariant Stress Metrics
por: Ahmed, Reyan, et al.
Publicado: (2024)

Parameterized Approaches to Orthogonal Compaction
por: Didimo, Walter, et al.
Publicado: (2022)

Hypercube drawings with no long plane paths
por: Antić, Todor, et al.
Publicado: (2026)

Counting of Shortest Paths in Cubic Grid
por: Dutt, Mousumi, et al.
Publicado: (2018)

Simultaneous Drawing of Layered Trees
por: Katheder, Julia, et al.
Publicado: (2023)

Min-$k$-planar Drawings of Graphs
por: Binucci, Carla, et al.
Publicado: (2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
por: Blažej, Václav, et al.
Publicado: (2024)

ENS-t-SNE: Embedding Neighborhoods Simultaneously t-SNE
por: Miller, Jacob, et al.
Publicado: (2022)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
por: Bekos, Michael A., et al.
Publicado: (2025)

Linear Layouts of Graphs with Priority Queues
por: Di Giacomo, Emilio, et al.
Publicado: (2025)

Morphing Graph Drawings in the Presence of Point Obstacles
por: Firman, Oksana, et al.
Publicado: (2023)

Exact Wavefront Propagation for Globally Optimal One-to-All Path Planning on 2D Cartesian Grids
por: Ibrahim, Ibrahim, et al.
Publicado: (2024)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

Flipping odd matchings in geometric and combinatorial settings
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Flip Paths Between Lattice Triangulations
por: Sims, William, et al.
Publicado: (2020)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
por: Ibrahim, Ibrahim, et al.
Publicado: (2024)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

The Price of Upwardness
por: Angelini, Patrizio, et al.
Publicado: (2024)

Two-Disk Compound Symmetry Groups
por: Hearn, Robert A., et al.
Publicado: (2023)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
por: Di Battista, Giuseppe, et al.
Publicado: (2024)

Cayley Configuration Spaces of a Common Class of Mechanisms in Two Dimensions
por: Sitharam, Meera, et al.
Publicado: (2011)

On Quad Mesh Extraction From Messy Grid Preserving Maps
por: Ray, Nicolas
Publicado: (2025)

Shortest Paths of Mutually Visible Robots
por: Alsaedi, Rusul J., et al.
Publicado: (2023)

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