scientific article; zbMATH DE number 3160756

zbMATH Open0098.35501MaRDI QIDQ3278735FDOQ3278735

Authors: I. M. Yaglom, V. G. Boltyanski 

Publication date: 1961

Title of this publication is not available (Why is that?)

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Cited In (87)

• Optimal Embedded and Enclosing Isosceles Triangles
• On covering problems of Rado
• Limit theorems for areas and perimeters of random inscribed and circumscribed polygons
• Orienting polygonal parts without sensors
• Shortest paths for line segments
• Approximation of convex set-valued functions
• Title not available (Why is that?)
• A convex hull algorithm for discs, and applications
• A generalized Winternitz theorem
• The \(n\)-point and six-partite point of a convex polygon
• Aligning two convex figures to minimize area or perimeter
• Enumerating isodiametric and isoperimetric polygons
• Dynamic computational geometry on meshes and hypercubes
• Caustics for inner and outer billiards
• Reinventing the wheel: Non-circular wheels
• On Pólya's inequality for torsional rigidity and first Dirichlet eigenvalue
• Transnormal hypersurfaces. Generalized constant width for Riemannian manifolds
• Inflection points and double tangents on anti-convex curves in the real projective plane
• \(\epsilon\)-nets and simplex range queries
• Notes on Schneider's stability estimates for convex sets
• The existence problem for Steiner networks in strictly convex domains
• On the upper bound on the average distance from the Fermat-Weber center of a convex body
• Long non-crossing configurations in the plane
• Polygons inscribed in a convex figure
• Error estimates for generalized barycentric interpolation
• The perimeter of rounded convex planar sets
• Topological planes
• Ball polytopes and the Vázsonyi problem
• Common diagonal Lyapunov function for third order linear switched system
• The geometry of graphs and some of its algorithmic applications
• Inequalities for a simplex and the number e
• The small octagons of maximal width
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Computing Opaque Interior Barriers à la Shermer
• Opaque sets
• Computing a centerpoint of a finite planar set of points in linear time
• A simple algorithm for enumerating longest distances in the plane
• Addition and decomposition of convex polytopes
• On classes of convex sets that permit plane coverings
• The Blaschke-Steinhardt point of a planar convex set
• Maximum density space packing with parallel strings of spheres
• A new interface tracking method: the polygonal area mapping method
• Algorithms for computing centroids
• On the length of optimal TSP circuits in sets of bounded diameter
• On Covering Problems of Rado
• A generalization of domains of constant width
• Sweeping an oval to a vanishing point
• Extremal polygons circumscribed an oval
• Isoperimetric constants and some lower bounds for the eigenvalues of the P-laplacian
• On minimal diameters of algebraic integers in J-fields
• A convex combinatorial property of compact sets in the plane and its roots in lattice theory
• Two measures of asymmetry for revolutionary constant width bodies in \(\mathbb{R}^3\)
• On the average perimeter of the inscribed random polygon
• Algorithms for plane representations of acyclic digraphs
• Borsuk covering and planar sets with unique completion
• On the geometric dilation of closed curves, graphs, and point sets
• The upper bound of minimum moment on inertial of equi-area convex domains
• Positive center sets of convex curves
• New bounds on the average distance from the Fermat-Weber center of a planar convex body
• Analytic parametrization of three-dimensional bodies of constant width
• On the deterministic and stochastic approximation of regions
• Title not available (Why is that?)
• Maximal perimeter, diameter and area of equilateral unit-width convex polygons
• Reduced convex bodies in Euclidean space -- a survey
• Nonuniqueness of sixpartite points
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
• Generalized plane offsets and rational parameterizations
• Progress on maximum weight triangulation
• The pentagonal pizza conjecture
• You Can’t Cut Two Pancakes With Compass and Straightedge
• Tripod configurations of curves
• Generalized limit theorems forU-max statistics
• Computing grasp functions
• Limit theorems for generalized perimeters of random inscribed polygons. I
• Deforming a convex domain into a disk by Klain's cyclic rearrangement
• Chebyshev constant and Chebyshev points
• \(U\)-max-statistics and limit theorems for perimeters and areas of random polygons
• On the diminishing process of Bálint Tóth
• The missing \((A,D,r)\) diagram
• Rotors in triangles and tetrahedra
• Dividing a convex figure by a system of rays and inscribed polygons
• Some results about equichordal convex bodies
• An estimate for the Hausdorff distance between a set and its convex hull in Euclidean spaces of small dimension
• A new lower bound for the integral of the \((n-2)nd\) mean curvature over the boundary of a compact domain in \(\mathbb{R}^ n\)
• Algebraic equations for constant width curves and Zindler curves
• Offsets and front tire tracks to projective hedgehogs
• Some characterizations of the disc by properties of isoptic triangles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3278735)