Related papers: Two-dimensional projections of an hypercube

We fully characterize orthogonal projections of infinite right circular (round) cones in real Hilbert spaces. Another interpretation is that, given two vectors in a real Hilbert space, we establish the optimal estimate on the angle between…

Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem. An important variant of the problem requires scheduling of activities for multiple projects considering…

This paper introduces a method of calculating and rendering shapes in a non-Euclidean 2D space. In order to achieve this, we developed a physics and graphics engine that uses hyperbolic trigonometry to calculate and subsequently render the…

We discuss the problem of projecting a point onto an arbitrary hyperbolicity cone from both theoretical and numerical perspectives. While hyperbolicity cones are furnished with a generalization of the notion of eigenvalues, obtaining closed…

A new method based on nesting Monte Carlo is developed to solve high-dimensional semi-linear PDEs. Convergence of the method is proved and its convergence rate studied. Results in high dimension for different kind of non-linearities show…

Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems. Numerous algorithms have been proposed for determining the projection; however, the primary focus of the literature has been…

This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…

The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…

Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

It is well-known that the sequence of iterations of the composition of projections onto closed affine subspaces converges linearly to the projection onto the intersection of the affine subspaces when the sum of the corresponding linear…

We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…

Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.

Monte Carlo methods play important part in modern statistical physics. The application of these methods suffer from two main difficulties.The first is caused by the relatively small number of particles that can participate in any numerical…

Discontinuous visibility changes remain a major bottleneck when optimizing surfaces within a physically-based inverse renderer. Many previous works have proposed sophisticated algorithms and data structures to sample visibility silhouettes…

We extend a recently developed method to solve semi-linear PDEs to the case of a degenerated diffusion. Being a pure Monte Carlo method it does not suffer from the so called curse of dimensionality and it can be used to solve problems that…

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

This paper is concerned with the use of the stereographic projection to map the points of a design on the sphere in three dimensions onto a two-dimensional stereogram. Details of the projection and its attendant stereogram are given and the…

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective…

In the parallel processing field, graph embedding is motivated by simulation interconnection networks to another. The quadtree is an important technique used to present spatial data and is used in many application domains, especially…