Skip to main content

Questions tagged [computational-geometry]

Using computers to solve geometric problems. Questions with this tag should typically have at least one other tag indicating what sort of geometry is involved, such as ag.algebraic-geometry or mg.metric-geometry.

14 votes
2 answers
3k views

Given the vertices of a convex polytope, how can we construct its half-space representation?

Let us say I have the vertices of a polytope $V = \{v_1,\dots,v_k\} \subset \mathbb R^n$. Is it possible to write $V$ as intersection of half-spaces using the information from the vertices, i.e., can ...
user27396's user avatar
  • 163
11 votes
3 answers
6k views

Random Sampling a linearly constrained region in n-dimensions...

Hi, So here is my problem: Given a nonlinear, discontinous, cost function $f(x_1,x_2,..,x_N)$ along with linear constraints $x_n \ge 0, \forall n$ $x_n \le c_n$ and $\sum_{n=1}^N x_n = 1$ find an ...
user1's user avatar
  • 113
27 votes
3 answers
4k views

Can squares of side 1/2, 1/3, 1/4, … be packed into three quarters of a unit square?

My question is prompted by this illustration from Eugenia Cheng’s book Beyond Infinity, where it appears in reference to the Basel problem. Is it known whether the infinite set of squares of side $\...
Robin Houston's user avatar
20 votes
2 answers
24k views

Partitioning a polygon into convex parts

I'm looking for an algorithm to partition any simple closed polygon into convex sub-polygons--preferably as few as possible. I know almost nothing about this subject, so I've been searching on Google ...
user14059's user avatar
  • 201
14 votes
2 answers
535 views

Are all well behaved "mean" functions on $\mathbb{R}^+$ equivalent?

Given a set $S$, a function $M: S\times S \rightarrow S$ is a mean if it satisfies the properties: $M(a,a)=a\qquad$ (identity) $M(a,b)=M(b,a)\qquad$ (commutativity). and possibly $M(M(a,b),M(a,c))=...
Yaakov Baruch's user avatar
13 votes
3 answers
1k views

(non-)existence of the aperiodic monotile

The aperiodic monotile problem asks whether there exists a single tile that every tiling of the plane made with it results non-periodic. What is known about this problem? If this tile exists, how can ...
Melquíades Ochoa's user avatar
10 votes
2 answers
3k views

Algorithm for embedding a graph with metric constraints

Suppose I have a graph $G$ with vertex set $V$, edge set $E \subseteq {V \choose 2}$, a poistive integer $d$, and a weight function $w:E \to \mathbb{R}^{+}$. Is there a nice algorithmic way to decide ...
Matthew Kahle's user avatar
7 votes
2 answers
3k views

Conic hulls and cones

Suppose I have a number of vectors in $\mathbb{R}^n.$ The first question is: what is the most efficient algorithm to compute their "conic hull" (the minimal convex cone which contains them)? The next ...
Igor Rivin's user avatar
  • 95.9k
6 votes
1 answer
2k views

Given a set of 2D vertices, how to create a minimum-area polygon which contains all the given vertices?

Not sure whether this question belongs here or math.stackexchange. You can assume that all the vertices are unique. The given vertices can be the vertices of the polygon, thus they do NOT have to be ...
fajrian's user avatar
  • 163
5 votes
1 answer
153 views

On folding a polygonal sheet

Consider a polygonal sheet $P$ of area $A$ with $N$ vertices (it material is not stretchable or tearable). Let $n$ be a positive integer >=2. Question: Let $P$ lie on a flat plane. We need to fold ...
Nandakumar R's user avatar
  • 5,827
3 votes
0 answers
140 views

Optimal intersections between planar convex regions

Here is an earlier discussion that could be related: On comparing planar convex regions of equal perimeter and area We are broadly interested in placing two given planar convex regions so that the ...
Nandakumar R's user avatar
  • 5,827
2 votes
1 answer
570 views

Inverse Problem for Pullback

Let $M$ and $N$ be smooth manifolds and $T: M \to N$ be a smooth map. Let $ \mathcal{F}(M,\mathbb{R})$ (resp.$ \mathcal{F}(N,\mathbb{R})$) denote the space of smooth functions from $M$ (resp. $N$) ...
compmath's user avatar
1 vote
1 answer
128 views

Computational Geometric Aspects of Greedy Tour Expansion

Has the following problem already been investigated from the Computational Geometry point of view and what are the results regarding worst case complexity? Given a finite set $\mathcal{P}...
Manfred Weis's user avatar
  • 12.8k
1 vote
0 answers
121 views

A center of convex planar regions based on chords

This is based on Chapter 6 of 'Convex figures' by Yaglom and Boltyanskii. This post also continues On two centers of convex regions. A point $P$ in the interior of a planar convex region $C$ divides ...
Nandakumar R's user avatar
  • 5,827
1 vote
0 answers
89 views

Bounds for minimax facility location in a convex region

An earlier question: Facility location on manifolds A possibly related earlier post: Cutting convex regions into equal diameter and equal least width pieces - 2 The minimax facility location problem ...
Nandakumar R's user avatar
  • 5,827

15 30 50 per page
1
2 3 4 5