scholarly journals On the maximal circumradius of a planar convex set containing one lattice point

1995 ◽  
Vol 52 (1) ◽  
pp. 137-151 ◽  
Author(s):  
Poh W. Awyong ◽  
Paul R. Scott
Keyword(s):  
Lattice Point ◽  
Convex Set ◽  
Compact Convex ◽  
Lattice Points ◽  
Compact Convex Set ◽  
Planar Convex

We obtain a result about the maximal circumradius of a planar compact convex set having circumcentre O and containing no non-zero lattice points in its interior. In addition, we show that under certain conditions, the set with maximal circumradius is a triangle with an edge containing two lattice points.

scholarly journals Circumradius-diameter and width-inradius relations for lattice constrained convex sets

1999 ◽  
Vol 59 (1) ◽  
pp. 147-152 ◽  
Author(s):  
Poh Wah Awyong ◽  
Paul R. Scott
Keyword(s):  
Lattice Point ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Integer Lattice ◽  
Lattice Points ◽  
Compact Convex Set ◽  
Planar Convex ◽  
Rectangular Lattices

Let K be a planar, compact, convex set with circumradius R, diameter d, width w and inradius r, and containing no points of the integer lattice. We generalise inequalities concerning the ‘dual’ quantities (2R − d) and (w − 2r) to rectangular lattices. We then use these results to obtain corresponding inequalities for a planar convex set with two interior lattice points. Finally, we conjecture corresponding results for sets containing one interior lattice point.

scholarly journals On the width of a planar convex set containing zero or one lattice points

1993 ◽  
Vol 48 (1) ◽  
pp. 47-53
Author(s):  
Paul R. Scott
Keyword(s):  
Triangular Lattice ◽  
Short Proof ◽  
Convex Set ◽  
Compact Convex ◽  
Lattice Points ◽  
Rectangular Lattice ◽  
Integral Lattice ◽  
Compact Convex Set ◽  
Maximal Width ◽  
Planar Convex

We generalise to a rectangular lattice a known result about the maximal width of a planar compact convex set containing no points of the integral lattice. As a corollary we give a new short proof that the planar compact convex set of greatest width which contains just one point of the triangular lattice is an equilateral triangle.

Two Inequalities for Planar Convex Sets

1985 ◽  
Vol 28 (1) ◽  
pp. 60-66 ◽  
Author(s):  
George Tsintsifas
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Compact Convex Set ◽  
Planar Convex ◽  
Straight Lines

AbstractB. Grünbaum, J. N. Lillington and lately R. J. Gardner, S. Kwapien and D. P. Laurie have considered inequalities defined by three concurrent straight lines in the interior of a planar compact convex set. In this note we prove two elegant conjectures by R. J. Gardner, S. Kwapien and D. P. Laurie.

scholarly journals Diameter-preserving linear bijections of function spaces

2001 ◽  
Vol 70 (3) ◽  
pp. 323-336 ◽  
Author(s):  
T. S. S. R. K. Rao ◽  
A. K. Roy
Keyword(s):  
Maximal Ideal ◽  
Convex Set ◽  
Compact Convex ◽  
Extreme Points ◽  
Continuous Functions ◽  
Ideal Space ◽  
Function Algebras ◽  
Compact Convex Set ◽  
Vector Valued Functions ◽  
Vector Valued

AbstractIn this paper we give a complete description of diameter-preserving linear bijections on the space of affine continuous functions on a compact convex set whose extreme points are split faces. We also give a description of such maps on function algebras considered on their maximal ideal space. We formulate and prove similar results for spaces of vector-valued functions.

Densities for stationary random sets and point processes

1984 ◽  
Vol 16 (02) ◽  
pp. 324-346 ◽  
Author(s):  
Wolfgang Weil ◽  
John A. Wieacker
Keyword(s):  
Poisson Process ◽  
Point Processes ◽  
Convex Set ◽  
Compact Convex ◽  
Random Sets ◽  
Intensity Measure ◽  
Additive Functionals ◽  
Compact Convex Set ◽  
Classical Integral

For certain stationary random setsX, densitiesDφ(X) of additive functionalsφare defined and formulas forare derived whenKis a compact convex set in. In particular, for the quermassintegrals and motioninvariantX, these formulas are in analogy with classical integral geometric formulas. The case whereXis the union set of a Poisson processYof convex particles is considered separately. Here, formulas involving the intensity measure ofYare obtained.

Densities for stationary random sets and point processes

1984 ◽  
Vol 16 (2) ◽  
pp. 324-346 ◽  
Author(s):  
Wolfgang Weil ◽  
John A. Wieacker
Keyword(s):  
Poisson Process ◽  
Point Processes ◽  
Convex Set ◽  
Compact Convex ◽  
Random Sets ◽  
Intensity Measure ◽  
Additive Functionals ◽  
Compact Convex Set ◽  
Classical Integral

For certain stationary random sets X, densities Dφ (X) of additive functionals φ are defined and formulas for are derived when K is a compact convex set in . In particular, for the quermassintegrals and motioninvariant X, these formulas are in analogy with classical integral geometric formulas. The case where X is the union set of a Poisson process Y of convex particles is considered separately. Here, formulas involving the intensity measure of Y are obtained.

Hyperplans poissoniens et compacts de Steiner

1974 ◽  
Vol 6 (03) ◽  
pp. 563-579 ◽  
Author(s):  
G. Matheron
Keyword(s):  
Stationary Process ◽  
Convex Set ◽  
Compact Convex ◽  
Minkowski Sum ◽  
Isotropic Case ◽  
Geometrical Properties ◽  
Steiner Formula ◽  
Compact Convex Set ◽  
Finite Sums ◽  
Linear Variety

A compact convex set in RN is Steiner if it is a finite Minkowski sum of line segments, or a limit of such finite sums, and then satisfies an extension of the Steiner formula. With each Poisson hyperplane stationary process A is uniquely associated a Steiner set M, and for any linear variety V, the Steiner set associated with is the projection of M on V. The density of the order k network Ak (i.e., the set of the intersections of k hyperplanes belonging to A) is linked with simple geometrical properties of M. In the isotropic case, the expression of the covariance measures associated with Ak is derived and compared with the analogous results obtained for (N — k)-dimensional Poisson flats.

Some Remarks on Translative Coverings of Convex Domains by Strips

1984 ◽  
Vol 27 (2) ◽  
pp. 233-237 ◽  
Author(s):  
H. Groemer
Keyword(s):  
Euclidean Plane ◽  
Convex Set ◽  
Compact Convex ◽  
Convex Domains ◽  
Minimal Width ◽  
Compact Convex Set

AbstractIn the euclidean plane let K be a compact convex set and Sl, S2,… strips of respective widths wl, w2,… Some conditions on Σ wi are given that imply that K can be covered by translates of the strips Si. These conditions involve the perimeter, the diameter, or the minimal width of K and yield improvements of previously known results.

Rates of convergence for random approximations of convex sets

1996 ◽  
Vol 28 (02) ◽  
pp. 384-393 ◽  
Author(s):  
Lutz Dümbgen ◽  
Günther Walther
Keyword(s):  
Convex Subset ◽  
Hausdorff Distance ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Almost Sure Convergence ◽  
Rates Of Convergence ◽  
Random Sets ◽  
Compact Convex Set

The Hausdorff distance between a compact convex set K ⊂ ℝd and random sets is studied. Basic inequalities are derived for the case of being a convex subset of K. If applied to special sequences of such random sets, these inequalities yield rates of almost sure convergence. With the help of duality considerations these results are extended to the case of being the intersection of a random family of halfspaces containing K.

Sign in / Sign up

Export Citation Format

Share Document