Cover Image

Exact Algorithms for Minimum Dilation Triangulation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fekete, Sándor P., Keldenich, Phillip, Perk, Michael
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)

Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
by: Fekete, Sándor P., et al.
Published: (2025)

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

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
by: Guitouni, Mariem, et al.
Published: (2025)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
by: Becker, Aaron T., et al.
Published: (2024)

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
by: Loi, Chek-Manh, et al.
Published: (2026)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
by: Dhar, Anubhav, et al.
Published: (2024)

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
by: Krupke, Dominik, et al.
Published: (2025)

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

External Incremental Delaunay Triangulation
by: Cai, Yifeng
Published: (2025)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
by: Garcia, Javier, et al.
Published: (2022)

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

Provable Methods for Searching with an Imperfect Sensor
by: Chakraborty, Nilanjan, et al.
Published: (2024)

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

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

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)

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

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
by: Chan, Timothy M.
Published: (2026)

A Universal Triangulation for Flat Tori
by: Lazarus, Francis, et al.
Published: (2022)

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)

Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)

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

Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
by: Dubois, Loïc
Published: (2026)

Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)

Computing Diverse and Nice Triangulations
by: Gálvez, Waldo, et al.
Published: (2025)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
by: Fekete, Sándor P., et al.
Published: (2025)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

ETH Flippers Approach to Parallel Reconfiguration of Triangulations: SAT formulation and Heuristics
by: Battini, Lorenzo, et al.
Published: (2026)

Geometric Bipartite Matching Based Exact Algorithms for Server Problems
by: Raghvendra, Sharath, et al.
Published: (2025)

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

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

On The Heine-Borel Property and Minimum Enclosing Balls
by: Banerjee, Hridhaan, et al.
Published: (2024)

Recognizing Subgraphs of Regular Tilings
by: Ingervo, Eliel, et al.
Published: (2026)

Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)