Union of random Minkowski sums and network vulnerability analysis

DOI10.1007/s00454-014-9626-1zbMath1302.52023arXiv1310.5647OpenAlexW1968547693MaRDI QIDQ471144

Haim Kaplan, Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir

Publication date: 14 November 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5647

zbMATH Keywords

arrangementMinkowski sumstochastic modelnetwork vulnerability

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45)

Related Items

From proximity to utility: a Voronoi partition of Pareto optima ⋮ Minimum shared‐power edge cut ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ⋮ The number of holes in the union of translates of a convex set in three dimensions ⋮ Union of hypercubes and 3D Minkowski sums with random sizes ⋮ On the complexity of randomly weighted multiplicative Voronoi diagrams

Cites Work

• Relative \((p,\varepsilon )\)-approximations in geometry
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• On the boundary of the union of planar convex sets
• Applications of random sampling in computational geometry. II
• Realistic input models for geometric algorithms
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• Near-linear approximation algorithms for geometric hitting sets
• Add isotropic Gaussian kernels at own risk
• On Approximating the Depth and Related Problems
• Univariate Discrete Distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Union of random Minkowski sums and network vulnerability analysis