On determining the cover of a simplex by spheres centered at its vertices

Authors:
L. G. Casado;I. García;B. G. Tóth;E. M. Hendrix
Affiliations:
Computer Architecture and Electronics Department, University of Almería, Almeria, Spain 04120;Computer Architecture and Electronics Department, University of Almería, Almeria, Spain 04120;Department of Differential Equations, Budapest University of Technology and Economics, Budapest, Hungary;Department of Computer Architecture, University of Málaga, Málaga, Spain 29017
Venue:
Journal of Global Optimization
Year:
2011

Citing 4
Cited 2

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
The union of balls and its dual shape

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Surface and medial axis topology through distance flows induced by discrete samples

Surface and medial axis topology through distance flows induced by discrete samples
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints

Journal of Global Optimization

Global optimization simplex bisection revisited based on considerations by reiner horst

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
A threaded approach of the quadratic bi-blending algorithm

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.