Minimum enclosing circle of a set of fixed points and a mobile point

DOI10.1016/j.comgeo.2014.04.006zbMath1306.65165OpenAlexW2047509194MaRDI QIDQ396467

Bhaswar B. Bhattacharya, Aritra Banik, Sandip Das

Publication date: 13 August 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.04.006

zbMATH Keywords

algorithmmobile facility locationcentre functionEuclidean 1-centre problemfarthest-point Voronoi diagramminimum enclosing circle

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Space-aware reconfiguration ⋮ Discrete and mixed two-center problems for line segments

Cites Work

• Discrete mobile centers
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Kinetic Red-Blue Minimum Separating Circle
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum enclosing circle of a set of fixed points and a mobile point