English

Blocking Delaunay Triangulations from the Exterior

Computational Geometry 2022-10-24 v1 Discrete Mathematics

Abstract

Given two distinct point sets PP and QQ in the plane, we say that QQ \emph{blocks} PP if no two points of PP are adjacent in any Delaunay triangulation of PQP\cup Q. Aichholzer et al. (2013) showed that any set PP of nn points in general position can be blocked by 32n\frac{3}{2}n points and that every set PP of nn points in convex position can be blocked by 54n\frac{5}{4}n points. Moreover, they conjectured that, if PP is in convex position, nn blocking points are sufficient and necessary. The necessity was recently shown by Biniaz (2021) who proved that every point set in general position requires nn blocking points. Here we investigate the variant, where blocking points can only lie outside of the convex hull of the given point set. We show that 54nO(1)\frac{5}{4}n-O(1) such \emph{exterior-blocking} points are sometimes necessary, even if the given point set is in convex position. As a consequence we obtain that, if the conjecture of Aichholzer et al. for the original setting was true, then minimal blocking sets of some point configurations PP would have to contain points inside of the convex hull of PP.

Keywords

Cite

@article{arxiv.2210.12015,
  title  = {Blocking Delaunay Triangulations from the Exterior},
  author = {Oswin Aichholzer and Thomas Hackl and Maarten Löffler and Alexander Pilz and Irene Parada and Manfred Scheucher and Birgit Vogtenhuber},
  journal= {arXiv preprint arXiv:2210.12015},
  year   = {2022}
}
R2 v1 2026-06-28T04:11:16.837Z