Imagen de Portada

Exact Algorithms for Minimum Dilation Triangulation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fekete, Sándor P., Keldenich, Phillip, Perk, Michael
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Recognizing Subgraphs of Regular Tilings
por: Ingervo, Eliel, et al.
Publicado: (2026)

Multivariate Exploration of Metric Dilation
por: Banik, Aritra, et al.
Publicado: (2025)

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