English
Related papers

Related papers: Generalized convex sets and shadows problem

200 papers

We explore the shadow of certain class generalized Kerr black holes, which are non vacuum solutions of the Einstein equations with exotic matter. The images depend on the angular momentum of the compact object, the characteristic parameter…

General Relativity and Quantum Cosmology · Physics 2016-02-23 Vassil K. Tinchev

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

A compact object illuminated by background radiation produces a dark silhouette. The edge of the silhouette or shadow (alternatively, the apparent boundary or the critical curve) is commonly determined by the presence of the photon sphere…

General Relativity and Quantum Cosmology · Physics 2025-09-09 Parth Bambhaniya , Saurabh , Elisabete M. de Gouveia Dal Pino

In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…

Optimization and Control · Mathematics 2024-04-10 Mattias Fält , Pontus Giselsson

We study the shadow cast by a large gravitating sphere, similar to our Sun. For this, we consider the gravitational field produced by a static mass monopole within the first post-Newtonian approximation of the general theory of relativity.…

General Relativity and Quantum Cosmology · Physics 2018-11-15 Slava G. Turyshev , Viktor T. Toth

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…

Numerical Analysis · Computer Science 2009-06-01 Laura Maruster , Stefan Maruster

This paper establishes several new facts on generalized polyhedral convex sets and shows how they can be used in vector optimization. Among other things, a scalarization formula for the efficient solution sets of generalized vector…

Optimization and Control · Mathematics 2017-05-22 Nguyen Ngoc Luan

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

We demonstrate that there is a large class of compact metric spaces for which the shadowing property can be characterized as a structural property of the space of dynamical systems. We also demonstrate for this class of spaces, that in…

Dynamical Systems · Mathematics 2021-06-30 Jonathan Meddaugh

The concept of illumination bodies studied in convex geometry is used to amend the halfspace depth for multivariate data. The proposed notion of illumination enables finer resolution of the sample points, naturally breaks ties in the…

Statistics Theory · Mathematics 2021-05-28 Stanislav Nagy , Jiří Dvořák

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

Optimization and Control · Mathematics 2017-05-22 Nguyen Ngoc Luan , Jen-Chih Yao , Nguyen Dong Yen

A shadow of a geometric object $A$ in a given direction $v$ is the orthogonal projection of $A$ on the hyperplane orthogonal to $v$. We show that any topological embedding of a circle into Euclidean $d$-space can have at most two shadows…

Metric Geometry · Mathematics 2017-06-09 Michael Gene Dobbins , Heuna Kim , Luis Montejano , Edgardo Roldán-Pensado

This paper investigates the transformation of a convex hull, derived from a d-dimensional point cloud, into a concave surface. Our primary focus is on the development of a methodology that ensures all points in the point cloud are…

Optimization and Control · Mathematics 2024-03-07 Netzer Moriya

Let $X$ be a vertex subset of a graph $G$. Then $u, v\in V(G)$ are $X$-positionable if $V(P)\cap X \subseteq \{u,v\}$ holds for any shortest $u,v$-path $P$. If each two vertices from $X$ are $X$-positionable, then $X$ is a general position…

Combinatorics · Mathematics 2024-02-28 Jing Tian , Sandi Klavžar

Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We establish solution existence theorems, necessary and sufficient optimality conditions,…

Optimization and Control · Mathematics 2017-10-02 Nguyen Ngoc Luan , Jen-Chih Yao

The Shape From Shading is one of a computer vision field. It studies the 3D reconstruction of an object from a single grayscale image. The difficulty of this field can be expressed in the local ambiguity (convex / concave). J.Shi and Q.Zhu…

Computer Vision and Pattern Recognition · Computer Science 2016-07-13 Lyes Abada , Saliha Aouat , Omar el farouk Bourahla

The recent significant enrichment of the Order Completion Method for nonlinear Systems of PDEs resulted in the global existence of generalized solutions to a large class of such equations. In this paper we investigate the existence and…

Analysis of PDEs · Mathematics 2007-09-14 Jan Harm van der Walt

We strengthen the analogy between convex co-compact Kleinian groups and convex co-compact subgroups of the mapping class group of a surface (in the sense of B. Farb and L. Mosher).

Geometric Topology · Mathematics 2007-05-23 Richard P. Kent , Christopher J. Leininger

Illuminating the surface of a convex body with parallel beams of light in a given direction generates a shadow region. We prove sharp regularity results for the boundary of this shadow in every direction of illumination. Moreover,…

Analysis of PDEs · Mathematics 2013-11-25 Emanuel Indrei , Levon Nurbekyan

The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…

Combinatorics · Mathematics 2013-03-19 Antoine Deza , Frédéric Meunier , Pauline Sarrabezolles