Library

You have 0 saved results.
Mark results and click the "Add To Watchlist" link in order to add them to this list.
feed icon rss

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 23 (2000), S. 247-259 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We prove that the maximum number of geometric permutations, induced by line transversals to a collection of n pairwise disjoint balls in \R d , is Θ (n d-1 ) . This improves substantially the upper bound of O(n 2d-2 ) known for general convex sets [9]. We show that the maximum number of geometric permutations of a sufficiently large collection of pairwise disjoint unit disks in the plane is two, improving the previous upper bound of three given in [5].
    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...