GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • English  (8)
  • 1
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 1992
    In:  Discrete & Computational Geometry Vol. 7, No. 3 ( 1992-3), p. 219-226
    In: Discrete & Computational Geometry, Springer Science and Business Media LLC, Vol. 7, No. 3 ( 1992-3), p. 219-226
    Type of Medium: Online Resource
    ISSN: 0179-5376 , 1432-0444
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 1992
    detail.hit.zdb_id: 1459007-4
    detail.hit.zdb_id: 53957-0
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Cambridge University Press (CUP) ; 1993
    In:  Advances in Applied Probability Vol. 25, No. 02 ( 1993-06), p. 373-394
    In: Advances in Applied Probability, Cambridge University Press (CUP), Vol. 25, No. 02 ( 1993-06), p. 373-394
    Abstract: While the convex hull of n d -dimensional balls is not a polytope, it does have an underlying combinatorial structure similar to that of a polytope. In the worst case, its combinatorial complexity can be of order Ω( n [ d /2] ). The thrust of this work is to show that its complexity is typically much smaller, and that it can therefore be constructed more quickly on average than in the worst case. To this end, four models of the random d -ball are developed, and the expected combinatorial complexity of the convex hull of n independent random d -balls is investigated for each. As n grows without bound, these expectations are O (1), O ( n ( d –1)/( d +4) ), O (1) (for d = 2 only), and O ( n ( d– 1)/( d+ 3) ).
    Type of Medium: Online Resource
    ISSN: 0001-8678 , 1475-6064
    RVK:
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 1993
    detail.hit.zdb_id: 1474602-5
    detail.hit.zdb_id: 160005-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cambridge University Press (CUP) ; 1993
    In:  Advances in Applied Probability Vol. 25, No. 2 ( 1993-06), p. 373-394
    In: Advances in Applied Probability, Cambridge University Press (CUP), Vol. 25, No. 2 ( 1993-06), p. 373-394
    Abstract: While the convex hull of n d -dimensional balls is not a polytope, it does have an underlying combinatorial structure similar to that of a polytope. In the worst case, its combinatorial complexity can be of order Ω( n [ d /2] ). The thrust of this work is to show that its complexity is typically much smaller, and that it can therefore be constructed more quickly on average than in the worst case. To this end, four models of the random d -ball are developed, and the expected combinatorial complexity of the convex hull of n independent random d -balls is investigated for each. As n grows without bound, these expectations are O (1), O ( n ( d –1)/( d +4) ), O (1) (for d = 2 only), and O ( n ( d– 1)/( d+ 3) ).
    Type of Medium: Online Resource
    ISSN: 0001-8678 , 1475-6064
    RVK:
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 1993
    detail.hit.zdb_id: 1474602-5
    detail.hit.zdb_id: 160005-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Wiley ; 1988
    In:  Journal of Microscopy Vol. 151, No. 3 ( 1988-09), p. 277-287
    In: Journal of Microscopy, Wiley, Vol. 151, No. 3 ( 1988-09), p. 277-287
    Abstract: For any convex body K in d ‐dimensional Euclidean space E d ( d ≥2) and for integers n and i, n ≥ d + 1,1 ≤ i ≤ n , let V ( d ) n‐i i(K ) be the expected volume of the convex hull H n‐i, i of n independent random points, of which n‐i are uniformly distributed in the interior, the other i on the boundary of K . We develop an integral formula for V ( d ) n‐i, i ( K ) for the case that K is a d ‐dimensional unit ball by considering an adequate decomposition of V ( d ) n‐i , i into d ‐dimensional simplices. To solve the important case i = 0, that is the case in which all points are chosen at random from the interior of B d , we require in addition Crofton's theorem on mean values. We illustrate the usefulness of our results by treating some special cases and by giving numerical values for the planar and the three‐dimensional cases.
    Type of Medium: Online Resource
    ISSN: 0022-2720 , 1365-2818
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 1988
    detail.hit.zdb_id: 219263-9
    detail.hit.zdb_id: 2007259-4
    SSG: 11
    SSG: 12
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 1991
    In:  Discrete & Computational Geometry Vol. 6, No. 3 ( 1991-9), p. 291-305
    In: Discrete & Computational Geometry, Springer Science and Business Media LLC, Vol. 6, No. 3 ( 1991-9), p. 291-305
    Type of Medium: Online Resource
    ISSN: 0179-5376 , 1432-0444
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 1991
    detail.hit.zdb_id: 1459007-4
    detail.hit.zdb_id: 53957-0
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 1990
    In:  Archiv der Mathematik Vol. 55, No. 1 ( 1990-7), p. 74-81
    In: Archiv der Mathematik, Springer Science and Business Media LLC, Vol. 55, No. 1 ( 1990-7), p. 74-81
    Type of Medium: Online Resource
    ISSN: 0003-889X , 1420-8938
    RVK:
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 1990
    detail.hit.zdb_id: 1458441-4
    detail.hit.zdb_id: 475-3
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Cambridge University Press (CUP) ; 1989
    In:  Journal of Applied Probability Vol. 26, No. 02 ( 1989-06), p. 408-412
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 26, No. 02 ( 1989-06), p. 408-412
    Abstract: This note gives the solution of the following problem concerning geometric probabilities. What is the probability p ( B d ; 2) that the circumference determined by three points P, P 1 and P 2 chosen independently and uniformly at random in the interior of a d -dimensional unit ball B d in Euclidean space E d ( d ≧ 2) is entirely contained in B d ? From our result we conclude that p ( B d ; 2) →π /(3√3) as d →∞.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    RVK:
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 1989
    detail.hit.zdb_id: 219147-7
    detail.hit.zdb_id: 1474599-9
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Cambridge University Press (CUP) ; 1989
    In:  Journal of Applied Probability Vol. 26, No. 2 ( 1989-06), p. 408-412
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 26, No. 2 ( 1989-06), p. 408-412
    Abstract: This note gives the solution of the following problem concerning geometric probabilities. What is the probability p ( B d ; 2) that the circumference determined by three points P, P 1 and P 2 chosen independently and uniformly at random in the interior of a d -dimensional unit ball B d in Euclidean space E d ( d ≧ 2) is entirely contained in B d ? From our result we conclude that p ( B d ; 2) →π /(3√3) as d →∞.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    RVK:
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 1989
    detail.hit.zdb_id: 219147-7
    detail.hit.zdb_id: 1474599-9
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...