Document Open Access Logo

Minimum Enclosing Circle with Few Extra Variables

Authors Minati De, Subhas C. Nandy, Sasanka Roy

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2012.510.pdf
  • Filesize: 0.55 MB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Minimum enclosing circle
  • space-efficient algorithm
  • prune-and-search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Asano et al. [JoCG 2011] proposed  an open problem of computing the minimum enclosing circle of a set of n points in R^2 given in a read-only array in sub-quadratic time. We show that Megiddo's prune and search algorithm for computing the minimum radius circle enclosing the given points can be tailored to work in a read-only environment in O(n^{1+epsilon}) time using O(log n) extra space, where epsilon is a positive constant less than 1. As a warm-up, we first solve the same problem in an in-place setup in linear time with O(1) extra space.

Cite As Get BibTex

Minati De, Subhas C. Nandy, and Sasanka Roy. Minimum Enclosing Circle with Few Extra Variables. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 510-521, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.FSTTCS.2012.510

Author Details

Minati De
Subhas C. Nandy
Sasanka Roy
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact