Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 4 (1989), S. 253-258 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We define Π(n) to be the largest number such that for every setP ofn points in the plane, there exist two pointsx, y ε P, where every circle containingx andy contains Π(n) points ofP. We establish lower and upper bounds for Π(n) and show that [n/27]+2≤Π(n)≤[n/4]+1. We define $$\bar \Pi (n)$$ for the special case where then points are restricted to be the vertices of a convex polygon. We show that $$\bar \Pi (n) = [n/3] + 1$$ .
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...