Computing the largest empty convex subset of a set of points

1985 ◽  
Author(s):  
David Avis ◽  
David Rappaport
Keyword(s):  
Convex Subset ◽  
Empty Convex ◽  
Set Of Points

Numerical Range and Convex Sets*

1974 ◽  
Vol 17 (2) ◽  
pp. 295-296 ◽  
Author(s):  
Fredric M. Pollack
Keyword(s):  
Hilbert Space ◽  
Linear Operator ◽  
Convex Subset ◽  
Bounded Linear Operator ◽  
Convex Sets ◽  
Numerical Range ◽  
Bounded Subset ◽  
Bounded Linear ◽  
Empty Convex ◽  
Image Position

The numerical range W(T) of a bounded linear operator T on a Hilbert space H is defined byW(T) is always a convex subset of the plane [1] and clearly W(T) is bounded since it is contained in the ball of radius ‖T‖ about the origin. Which non-empty convex bounded subsets of the plane are the numerical range of an operator? The theorem we prove below shows that every non-empty convex bounded subset of the plane is W(T) for some T.

A Characterization of Convex Fuzzy Mappings

2010 ◽  
Vol 1 (3) ◽  
pp. 40-44
Author(s):  
Chih-Yuan Chen ◽  
Cheng-Pin Wang ◽  
Tetz C. Huang
Keyword(s):  
Convex Subset ◽  
Fuzzy Numbers ◽  
Fuzzy Mapping ◽  
Intermediate Point ◽  
Empty Convex

As any real-valued functions can be regarded as a fuzzy mapping, the research on fuzzy mappings extends the research on real-valued functions. In this paper, a characterization of convex fuzzy mappings is obtained. Supposeis a fuzzy mapping, whereis a non-empty convex subset ofandis the set of all fuzzy numbers. With respect to the fuzzy-max order, is convex if and only if it is both quasi-convex and intermediate-point convex.

Video Graphics and High-Voltage Electron Microscopy For Analysis of Microtubule Distributions In Fixed Cells

1990 ◽  
Vol 48 (1) ◽  
pp. 524-525
Author(s):  
Richard Mcintosh ◽  
David Mastronarde ◽  
Kent McDonald ◽  
Rubai Ding
Keyword(s):  
Electron Microscopy ◽  
Cross Sections ◽  
Cell Shape ◽  
Video Camera ◽  
Computer Memory ◽  
High Voltage Electron Microscopy ◽  
Thin Sections ◽  
Voltage Electron ◽  
Morphogenetic Event ◽  
Set Of Points

Microtubules (MTs) are cytoplasmic polymers whose dynamics have an influence on cell shape and motility. MTs influence cell behavior both through their growth and disassembly and through the binding of enzymes to their surfaces. In either case, the positions of the MTs change over time as cells grow and develop. We are working on methods to determine where MTs are at different times during either the cell cycle or a morphogenetic event, using thin and thick sections for electron microscopy and computer graphics to model MT distributions.One approach is to track MTs through serial thin sections cut transverse to the MT axis. This work uses a video camera to digitize electron micrographs of cross sections through a MT system and create image files in computer memory. These are aligned and corrected for relative distortions by using the positions of 8 - 10 MTs on adjacent sections to define a general linear transformation that will align and warp adjacent images to an optimum fit. Two hundred MT images are then used to calculate an “average MT”, and this is cross-correlated with each micrograph in the serial set to locate points likely to correspond to MT centers. This set of points is refined through a discriminate analysis that explores each cross correlogram in the neighborhood of every point with a high correlation score.

scholarly journals Further steps on the reconstruction of convex polyominoes from orthogonal projections

2021 ◽  
Author(s):  
Paolo Dulio ◽  
Andrea Frosini ◽  
Simone Rinaldi ◽  
Lama Tarsissi ◽  
Laurent Vuillon
Keyword(s):  
Discrete Geometry ◽  
Convex Subset ◽  
Convex Sets ◽  
A Priori ◽  
Orthogonal Projections ◽  
Reconstruction Process ◽  
Combinatorial Properties ◽  
The Family ◽  
Discrete Counterpart ◽  
Interior Part

AbstractA remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.

scholarly journals A plane quartic curve with twelve undulations

1945 ◽  
Vol 35 ◽  
pp. 10-13 ◽  
Author(s):  
W. L. Edge
Keyword(s):  
Homogeneous Coordinates ◽  
Quartic Curve ◽  
Base Points ◽  
Octahedral Group ◽  
Quartic Form ◽  
Image Position ◽  
Quartic Curves ◽  
Set Of Points

The pencil of quartic curveswhere x, y, z are homogeneous coordinates in a plane, was encountered by Ciani [Palermo Rendiconli, Vol. 13, 1899] in his search for plane quartic curves that were invariant under harmonic inversions. If x, y, z undergo any permutation the ternary quartic form on the left of (1) is not altered; nor is it altered if any, or all, of x, y, z be multiplied by −1. There thus arises an octahedral group G of ternary collineations for which every curve of the pencil is invariant.Since (1) may also be writtenthe four linesare, as Ciani pointed out, bitangents, at their intersections with the conic C whose equation is x2 + y2 + z2 = 0, to every quartic of the pencil. The 16 base points of the pencil are thus all accounted for—they consist of these eight contacts counted twice—and this set of points must of course be invariant under G. Indeed the 4! collineations of G are precisely those which give rise to the different permutations of the four lines (2), a collineation in a plane being determined when any four non-concurrent lines and the four lines which are to correspond to them are given. The quadrilateral formed by the lines (2) will be called q.

scholarly journals The set of points with Markovian symbolic dynamics for non-uniformly hyperbolic diffeomorphisms

2020 ◽  
pp. 1-26
Author(s):  
SNIR BEN OVADIA
Keyword(s):  
Symbolic Dynamics ◽  
Full Measure ◽  
Probability Measures ◽  
Positive Entropy ◽  
Surface Diffeomorphisms ◽  
Srb Measures ◽  
Hyperbolic Diffeomorphisms ◽  
Set Of Points ◽  
Math Phys ◽  
Homoclinic Classes

Abstract The papers [O. M. Sarig. Symbolic dynamics for surface diffeomorphisms with positive entropy. J. Amer. Math. Soc.26(2) (2013), 341–426] and [S. Ben Ovadia. Symbolic dynamics for non-uniformly hyperbolic diffeomorphisms of compact smooth manifolds. J. Mod. Dyn.13 (2018), 43–113] constructed symbolic dynamics for the restriction of $C^r$ diffeomorphisms to a set $M'$ with full measure for all sufficiently hyperbolic ergodic invariant probability measures, but the set $M'$ was not identified there. We improve the construction in a way that enables $M'$ to be identified explicitly. One application is the coding of infinite conservative measures on the homoclinic classes of Rodriguez-Hertz et al. [Uniqueness of SRB measures for transitive diffeomorphisms on surfaces. Comm. Math. Phys.306(1) (2011), 35–49].

scholarly journals Multidimensional Multiplicative Combinatorial Properties of Dynamical Syndetic Sets

2021 ◽  
Author(s):  
Jiahao Qiu ◽  
Jianjie Zhao
Keyword(s):  
Normal Subgroup ◽  
Finite Index ◽  
Minimal System ◽  
Combinatorial Properties ◽  
Return Times ◽  
Residual Set ◽  
Closed Sets ◽  
Open Set ◽  
Geometric Progressions ◽  
Set Of Points

AbstractIn this paper, it is shown that for a minimal system (X, G), if H is a normal subgroup of G with finite index n, then X can be decomposed into n components of closed sets such that each component is minimal under H-action. Meanwhile, we prove that for a residual set of points in a minimal system with finitely many commuting homeomorphisms, the set of return times to any non-empty open set contains arbitrarily long geometric progressions in multidimension, extending a previous result by Glasscock, Koutsogiannis and Richter.

scholarly journals Ordinary hyperspheres and spherical curves

2021 ◽  
Vol 21 (1) ◽  
pp. 15-22
Author(s):  
Aaron Lin ◽  
Konrad Swanepoel
Keyword(s):  
Degenerate Case ◽  
Minimum Number ◽  
Set Of Points ◽  
Orchard Problem

Abstract An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-sphere or a (d - 2)-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly d + 1 points of the set. Similarly, a (d + 2)-point hypersphere of such a set is one that contains exactly d + 2 points of the set. We find the minimum number of ordinary hyperspheres, solving the d-dimensional spherical analogue of the Dirac–Motzkin conjecture for d ⩾ 3. We also find the maximum number of (d + 2)-point hyperspheres in even dimensions, solving the d-dimensional spherical analogue of the orchard problem for even d ⩾ 4.

scholarly journals The use of classical methods and neural networks in deformation studies of hydrotechnical objects

2020 ◽  
Vol 12 (1) ◽  
pp. 718-725
Author(s):  
Maria Mrówczyńska ◽  
Jacek Sztubecki ◽  
Małgorzata Sztubecka ◽  
Izabela Skrzypczak
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Cylinder Surface ◽  
Building Structures ◽  
Steel Cylinder ◽  
Factors Affecting ◽  
Initial Stage ◽  
Artificial Neural ◽  
Set Of Points

Abstract Objects’ measurements often boil down to the determination of changes due to external factors affecting on their structure. The estimation of changes in a tested object, in addition to proper measuring equipment, requires the use of appropriate measuring methods and experimental data result processing methods. This study presents a statement of results of geometrical measurements of a steel cylinder that constitutes the main structural component of the historical weir Czersko Polskie in Bydgoszcz. In the initial stage, the estimation of reliable changes taking place in the cylinder structure involved the selection of measuring points essential for mapping its geometry. Due to the continuous operation of the weir, the points covered only about one-third of the cylinder area. The set of points allowed us to determine the position of the cylinder axis as well as skews and deformations of the cylinder surface. In the next stage, the use of methods based on artificial neural networks allowed us to predict the changes in the tested object. Artificial neural networks have proved to be useful in determining displacements of building structures, particularly hydro-technical objects. The above-mentioned methods supplement classical measurements that create the opportunity for carrying out additional analyses of changes in a spatial position of such structures. The purpose of the tests is to confirm the suitability of artificial neural networks for predicting displacements of building structures, particularly hydro-technical objects.

Sign in / Sign up

Export Citation Format

Share Document