Minimum enclosing circle with few extra variables

DOI10.4230/LIPICS.FSTTCS.2012.510MaRDI QIDQ2957525zbMATH OpenFDO

Authors Minati De, Sasanka Roy, Subhas C. Nandy

Publication date 26 January 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2012.510

zbMATH Keywords

minimum enclosing circleprune-and-searchspace-efficient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Prune-and-search with limited workspace
• On enclosing k points by a circle
• Computing the smallest k-enclosing circle and related problems
• Some variations on constrained minimum enclosing circle problem
• Computing the smallest k-enclosing circle and related problems

Cited in

(3)

• Locating a minisum circle in the plane
• Prune-and-search with limited workspace
• Constrained Minimum Enclosing Circle with Center on a Query Line Segment

This page was built for publication: Minimum enclosing circle with few extra variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957525)