Image de couverture de livre

ETH Flippers Approach to Parallel Reconfiguration of Triangulations: SAT formulation and Heuristics

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Battini, Lorenzo, Milenković, Marko
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Shadoks Approach to Parallel Reconfiguration of Triangulations
par: da Fonseca, Guilherme D., et autres
Publié: (2026)

Randomized HyperSteiner: A Stochastic Delaunay Triangulation Heuristic for the Hyperbolic Steiner Minimal Tree
par: Medbouhi, Aniss Aiman, et autres
Publié: (2025)

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

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

External Incremental Delaunay Triangulation
par: Cai, Yifeng
Publié: (2025)

Exact Algorithms for Minimum Dilation Triangulation
par: Fekete, Sándor P., et autres
Publié: (2025)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Counting Triangulations of Fixed Cardinal Degrees
par: Chambers, Erin, et autres
Publié: (2025)

An Improved Physically-Based Surface Triangulation Method
par: Shangyu, Lei, et autres
Publié: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
par: An, Shinwoo, et autres
Publié: (2024)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2020)

Covering the Euclidean Plane by a Pair of Trees
par: Le, Hung, et autres
Publié: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
par: Aichholzer, Oswin, et autres
Publié: (2026)

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
par: Chan, Timothy M.
Publié: (2026)

Computing Non-Obtuse Triangulations with Few Steiner Points
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

A Universal Triangulation for Flat Tori
par: Lazarus, Francis, et autres
Publié: (2022)

Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
par: Dubois, Loïc
Publié: (2026)

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
par: Löffler, Maarten, et autres
Publié: (2024)

Flip Paths Between Lattice Triangulations
par: Sims, William, et autres
Publié: (2020)

Computing Diverse and Nice Triangulations
par: Gálvez, Waldo, et autres
Publié: (2025)

Practical Software for Triangulating and Simplifying 4-Manifolds
par: Burke, Rhuaidi Antonio
Publié: (2024)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
par: van Renssen, Andrè, et autres
Publié: (2022)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
par: Firman, Oksana, et autres
Publié: (2024)

Optimal Euclidean Tree Covers
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection
par: Clément, François, et autres
Publié: (2023)

Order-2 Delaunay Triangulations Optimize Angles
par: Edelsbrunner, Herbert, et autres
Publié: (2023)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
par: Bhore, Sujoy, et autres
Publié: (2026)

Polygonal Sequence-driven Triangulation Validator: An Incremental Approach to 2D Triangulation Verification
par: Sawai, Sora, et autres
Publié: (2024)

HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees
par: García-Castellanos, Alejandro, et autres
Publié: (2024)

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
par: Touli, Elena Farahbakhsh, et autres
Publié: (2025)

Input-Sensitive Reconfiguration of Sliding Cubes
par: Akitaya, Hugo, et autres
Publié: (2025)

Relative Stability Conditions on Triangulated Categories
par: Liu, Bowen, et autres
Publié: (2024)

Investigating Simple Drawings of $K_n$ using SAT
par: Bergold, Helena, et autres
Publié: (2025)

A Fast Quasi-Linear Heuristic for the Close-Enough Traveling Salesman Problem
par: Duong, Khoi
Publié: (2026)

Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
par: Wetzels, Florian, et autres
Publié: (2025)

Some Counterexamples for Compatible Triangulations
par: Barnson, Cody, et autres
Publié: (2016)

Relaxed Total Generalized Variation Regularized Piecewise Smooth Mumford-Shah Model for Triangulated Surface Segmentation
par: Zhang, Huayan, et autres
Publié: (2025)

Image Triangulation Using the Sobel Operator for Vertex Selection
par: Laske, Olivia, et autres
Publié: (2024)