Related Experiment Video
Updated: May 13, 2026

3D Printing of Preclinical X-ray Computed Tomographic Data Sets
Published on: March 22, 2013
Blocking Delaunay triangulations
Oswin Aichholzer1, Ruy Fabila-Monroy, Thomas Hackl
1Institute for Software Technology, University of Technology, Graz, Austria.
Abstract:
Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) [Formula: see text] white points are always sufficient to block a set of n black points, (ii) if B is in convex position, [Formula: see text] white points are always sufficient to block it, and (iii) at least [Formula: see text] white points are always necessary to block a set of n black points.
Related Concept Videos
Mesh Analysis
A fundamental concept in mesh analysis is the definition of meshes and mesh currents. A mesh is a closed...
Boundary Conditions: Lossless Lines
At the receiving end, the boundary condition states that the voltage equals the product of the receiving-end impedance and current. This relationship is expressed as a function of the incident and...
Plastic Deformations of Members with a Single Plane of Symmetry
Gauss's Law: Planar Symmetry
Coordination Number and Geometry
Parallel-axis Theorem

