Related papers: Computational Geometry Column 42

The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.

Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two…

The concept of pointed pseudo-triangulations is defined and a few of its applications described.

Computational models pervade all branches of the exact sciences and have in recent times also started to prove to be of immense utility in some of the traditionally 'soft' sciences like ecology, sociology and politics. This volume is a…

In this expository paper we present a brief introduction to the geometrical modeling of some quantum computing problems. After a brief introduction to establish the terminology, we focus on quantum information geometry and ZX-calculus,…

This is a structured compilation of some of my favourite open problems.

Most of the literature of computational geometry concerns geometric properties of sets of static points. M.J. Atallah introduced dynamic computational geometry, concerned with both momentary and long-term geometric properties of sets of…

Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.…

Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…

This report records a large number of open problems in Affine Algebraic Geometry that were proposed by participants in a Conference on Open Algebraic Varieties at the Centre de Recherches en Mathematiques in Montreal at December 1994.

The recent result that n congruent balls in R^d have at most 4 distinct geometric permutations is described.

This paper presents the computational challenge on differential geometry and topology that happened within the ICLR 2021 workshop "Geometric and Topological Representation Learning". The competition asked participants to provide creative…

The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.

We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…

A list of open problems on holomorphic symplectic, contact and Poisson manifolds.

We present a collection of easily stated open problems in the theory of compact constant mean curvature surfaces with boundary. We also survey the current status of answering them.

We survey several results known on sampling in computational geometry.

This document is a brief summary of progress that has been made on the problems posed in the document "Twenty Open Problems in Enumeration of Matchings" (also available from this server as math.CO/9801060). NOTE: This article has now been…

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this…

We draw two incomplete, biased maps of challenges in computational complexity lower bounds.