Imagen de Portada

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Löffler, Maarten, Mchedlidze, Tamara, Orden, David, Tkadlec, Josef, Wulms, Jules
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Same Quality Metrics, Different Graph Drawings
por: van Wageningen, Simon, et al.
Publicado: (2025)

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

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

Counting Triangulations of Fixed Cardinal Degrees
por: Chambers, Erin, et al.
Publicado: (2025)

Preprocessing Disks for Convex Hulls, Revisited
por: Löffler, Maarten, et al.
Publicado: (2025)

Boundary Labeling in a Circular Orbit
por: Bonerath, Annika, et al.
Publicado: (2024)

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

Transitions in Dynamic Point Labeling
por: Depian, Thomas, et al.
Publicado: (2022)

A Framework for Algorithm Stability
por: Meulemans, Wouter, et al.
Publicado: (2017)

Competitive Searching over Terrains
por: de Berg, Sarita, et al.
Publicado: (2024)

Long Plane Trees
por: Cabello, Sergio, et al.
Publicado: (2021)

The Complexity of Geodesic Spanners using Steiner Points
por: de Berg, Sarita, et al.
Publicado: (2024)

An algorithm for accurate and simple-looking metaphorical maps
por: Katsanou, Eleni, et al.
Publicado: (2025)

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

Adjacency Graphs of Polyhedral Surfaces
por: Arseneva, Elena, et al.
Publicado: (2021)

Capturing the Shape of a Point Set with a Line Segment
por: van Beusekom, Nathan, et al.
Publicado: (2024)

tue-alga/NoisyGraphPatterns: Noisy Graph Patterns via Ordered Matrices
por: JulesWulms
Publicado: (2026)

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

On 1-bend Upward Point-set Embeddings of $st$-digraphs
por: Di Giacomo, Emilio, et al.
Publicado: (2024)

Drawing Reeb Graphs
por: Chambers, Erin, et al.
Publicado: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Reconfiguration of Squares Using a Constant Number of Moves Each
por: van der Horst, Thijs, et al.
Publicado: (2026)

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
por: Bui, Hong Duc
Publicado: (2025)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

Morphing Planar Graph Drawings Through 3D
por: Buchin, Kevin, et al.
Publicado: (2022)

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

Drawings of Complete Multipartite Graphs Up to Triangle Flips
por: Aichholzer, Oswin, et al.
Publicado: (2023)

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

External Incremental Delaunay Triangulation
por: Cai, Yifeng
Publicado: (2025)

Practical Software for Triangulating and Simplifying 4-Manifolds
por: Burke, Rhuaidi Antonio
Publicado: (2024)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
por: Firman, Oksana, et al.
Publicado: (2024)

Noisy Graph Patterns via Ordered Matrices
por: Wulms, Jules, et al.
Publicado: (2026)

Shadoks Approach to Parallel Reconfiguration of Triangulations
por: da Fonseca, Guilherme D., et al.
Publicado: (2026)

Exact Algorithms for Minimum Dilation Triangulation
por: Fekete, Sándor P., et al.
Publicado: (2025)

An Improved Physically-Based Surface Triangulation Method
por: Shangyu, Lei, et al.
Publicado: (2025)

Approximating shortest paths in weighted square and hexagonal meshes
por: Bose, Prosenjit, et al.
Publicado: (2024)

On approximating shortest paths in weighted triangular tessellations
por: Bose, Prosenjit, et al.
Publicado: (2021)

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

Computing Non-Obtuse Triangulations with Few Steiner Points
por: Abrahamsen, Mikkel, et al.
Publicado: (2025)