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 PROBABILISTIC FEASIBILITY OF THE RECONSTRUCTION PROCESS OF RUSSIAN-ORTHODOX CHURCHES

2016 ◽  
Vol XLI-B5 ◽  
pp. 221-227
Author(s):  
M. Chizhova ◽  
A. Brunn ◽  
U. Stilla
Keyword(s):  
Point Cloud ◽  
A Priori ◽  
Simulated Dataset ◽  
Russian Orthodox ◽  
3D Point Cloud ◽  
Probabilistic Framework ◽  
Reconstruction Process ◽  
Virtual Reconstruction ◽  
Cultural Constructions ◽  
Geometric Primitives

The cultural human heritage is important for the identity of following generations and has to be preserved in a suitable manner. In the course of time a lot of information about former cultural constructions has been lost because some objects were strongly damaged by natural erosion or on account of human work or were even destroyed. It is important to capture still available building parts of former buildings, mostly ruins. This data could be the basis for a virtual reconstruction. Laserscanning offers in principle the possibility to take up extensively surfaces of buildings in its actual status. <br><br> In this paper we assume a priori given 3d-laserscanner data, 3d point cloud for the partly destroyed church. There are many well known algorithms, that describe different methods of extraction and detection of geometric primitives, which are recognized separately in 3d points clouds. In our work we put them in a common probabilistic framework, which guides the complete reconstruction process of complex buildings, in our case russian-orthodox churches. <br><br> Churches are modeled with their functional volumetric components, enriched with a priori known probabilities, which are deduced from a database of russian-orthodox churches. Each set of components represents a complete church. The power of the new method is shown for a simulated dataset of 100 russian-orthodox churches.

Convergence of the Ishikawa Iterates for Multi-Valued Mappings in Convex Metric Spaces

2008 ◽  
Vol 15 (1) ◽  
pp. 39-43
Author(s):  
Ljubomir B. Ćirić ◽  
Nebojša T. Nikolić
Keyword(s):  
Metric Space ◽  
Convex Subset ◽  
Metric Spaces ◽  
Satisfy Condition ◽  
Convex Metric Space ◽  
Convex Metric Spaces ◽  
The Family

Abstract Let (𝑋, 𝑑) be a convex metric space, 𝐶 be a closed and convex subset of 𝑋 and let 𝐵(𝐶) be the family of all nonempty bounded subsets of 𝐶. In this paper some results are obtained on the convergence of the Ishikawa iterates associated with a pair of multi-valued mappings 𝑆,𝑇 : 𝐶 → 𝐵(𝐶) which satisfy condition (2.1) below.

Counterexamples Concerning Support Theorems for Convex Sets in Hilbert Space

1988 ◽  
Vol 31 (1) ◽  
pp. 121-128 ◽  
Author(s):  
R. R. Phelps
Keyword(s):  
Banach Space ◽  
Hilbert Space ◽  
Convex Function ◽  
Convex Subset ◽  
Convex Sets ◽  
Lower Semicontinuous ◽  
Nonempty Closed Convex Subset ◽  
Common Point ◽  
Support Points ◽  
Support Theorems

AbstractThe Bishop-Phelps theorem guarantees the existence of support points and support functionals for a nonempty closed convex subset of a Banach space; equivalently, it guarantees the existence of subdifferentials and points of subdifferentiability of a proper lower semicontinuous convex function on a Banach space. In this note we show that most of these results cannot be extended to pairs of convex sets or functions, even in Hilbert space. For instance, two proper lower semicontinuous convex functions need not have a common point of subdifferentiability nor need they have a subdifferential in common. Negative answers are also obtained to certain questions concerning density of support points for the closed sum of two convex subsets of Hilbert space.

scholarly journals Continued fractions built from convex sets and convex functions

2015 ◽  
Vol 17 (05) ◽  
pp. 1550003 ◽  
Author(s):  
Ilya Molchanov
Keyword(s):  
Convex Functions ◽  
Continued Fractions ◽  
Convex Sets ◽  
Sufficient Conditions ◽  
Ordered Semigroup ◽  
Minkowski Addition ◽  
Partially Ordered ◽  
The Family ◽  
Sufficient Conditions For Convergence

In a partially ordered semigroup with the duality (or polarity) transform, it is possible to define a generalization of continued fractions. General sufficient conditions for convergence of continued fractions are provided. Two particular applications concern the cases of convex sets with the Minkowski addition and the polarity transform and the family of non-negative convex functions with the Legendre–Fenchel and Artstein-Avidan–Milman transforms.

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.

scholarly journals Computing from projections of random points

2019 ◽  
Vol 20 (01) ◽  
pp. 1950014
Author(s):  
Noam Greenberg ◽  
Joseph S. Miller ◽  
André Nies
Keyword(s):  
Cost Function ◽  
Random Sequence ◽  
Turing Degrees ◽  
Orthogonal Projections ◽  
Open Set ◽  
Proper Subclass ◽  
The Family ◽  
Function Characterization ◽  
The Cost ◽  
The Ideal

We study the sets that are computable from both halves of some (Martin–Löf) random sequence, which we call [Formula: see text]-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the [Formula: see text]-trivial sets. We characterize [Formula: see text]-bases as the sets computable from both halves of Chaitin’s [Formula: see text], and as the sets that obey the cost function [Formula: see text]. Generalizing these results yields a dense hierarchy of subideals in the [Formula: see text]-trivial degrees: For [Formula: see text], let [Formula: see text] be the collection of sets that are below any [Formula: see text] out of [Formula: see text] columns of some random sequence. As before, this is an ideal generated by its c.e. elements and the random sequence in the definition can always be taken to be [Formula: see text]. Furthermore, the corresponding cost function characterization reveals that [Formula: see text] is independent of the particular representation of the rational [Formula: see text], and that [Formula: see text] is properly contained in [Formula: see text] for rational numbers [Formula: see text]. These results are proved using a generalization of the Loomis–Whitney inequality, which bounds the measure of an open set in terms of the measures of its projections. The generality allows us to analyze arbitrary families of orthogonal projections. As it turns out, these do not give us new subideals of the [Formula: see text]-trivial sets; we can calculate from the family which [Formula: see text] it characterizes. We finish by studying the union of [Formula: see text] for [Formula: see text]; we prove that this ideal consists of the sets that are robustly computable from some random sequence. This class was previously studied by Hirschfeldt [D. R. Hirschfeldt, C. G. Jockusch, R. Kuyper and P. E. Schupp, Coarse reducibility and algorithmic randomness, J. Symbolic Logic 81(3) (2016) 1028–1046], who showed that it is a proper subclass of the [Formula: see text]-trivial sets. We prove that all such sets are robustly computable from [Formula: see text], and that they form a proper subideal of the sets computable from every (weakly) LR-hard random sequence. We also show that the ideal cannot be characterized by a cost function, giving the first such example of a [Formula: see text] subideal of the [Formula: see text]-trivial sets.

scholarly journals Some fixed-point theorems on locally convex linear topological spaces

1975 ◽  
Vol 13 (2) ◽  
pp. 241-254 ◽  
Author(s):  
E. Tarafdar
Keyword(s):  
Fixed Point ◽  
Topological Space ◽  
Convex Subset ◽  
Fixed Point Theorems ◽  
Nonexpansive Mappings ◽  
Topological Spaces ◽  
The Family ◽  
Image Position ◽  
Commutative Family ◽  
Locally Convex

Let (E, τ) be a locally convex linear Hausdorff topological space. We have proved mainly the following results.(i) Let f be nonexpansive on a nonempty τ-sequentially complete, τ-bounded, and starshaped subset M of E and let (I-f) map τ-bounded and τ-sequentially closed subsets of M into τ-sequentially closed subsets of M. Then f has a fixed-point in M.(ii) Let f be nonexpansive on a nonempty, τ-sequentially compact, and starshaped subset M of E. Then f has a fixed-point in M.(iii) Let (E, τ) be τ-quasi-complete. Let X be a nonempty, τ-bounded, τ-closed, and convex subset of E and M be a τ-compact subset of X. Let F be a commutative family of nonexpansive mappings on X having the property that for some f1 ∈ F and for each x ∈ X, τ-closure of the setcontains a point of M. Then the family F has a common fixed-point in M.

The Demyanov metric and some other metrics in the family of convex sets

2012 ◽  
Vol 10 (6) ◽  
Author(s):  
Tadeusz Rzeżuchowski
Keyword(s):  
Convex Sets ◽  
Hausdorff Metric ◽  
Facial Structure ◽  
The Family

AbstractWe describe some known metrics in the family of convex sets which are stronger than the Hausdorff metric and propose a new one. These stronger metrics preserve in some sense the facial structure of convex sets under small changes of sets.

Sign in / Sign up

Export Citation Format

Share Document