4
votes
1answer
295 views

Biggest ball included in an intersection of balls

I would like to prove that for any family of balls $\{B(c_i,r_i)\}_i \subset \mathbb{R}^d$ such that $\{c_1, \dots, c_n\} \subset \bigcap_i B(c_i,r_i) $ and $\forall i, r_i \geq 1$, there exists a ...
1
vote
0answers
95 views

Boundary surfaces in a 3d Voronoi tessellation with obstacles

Let $x_1,\dots,x_n$ be a set of points in $\mathbb{R}^3$ and let $\mathcal{O}_1 ,\dots, \mathcal{O}_m$ denote a set of polyhedral obstacles. What is the name for the surfaces that describe the ...
11
votes
0answers
392 views

Does every connected set that is not a line segment cross some dyadic square?

A dyadic square is a subset of $R^2$ of the form $x + 2^{-n} [0,1]^2$ with $x \in 2^{-m} Z^2$, for integers $m,n \geq 0$. We say that a set $A$ crosses a square $S$ if there exists a connected subset ...
2
votes
2answers
99 views

Worst-case nearest-neighbor distances between regions

Suppose that $S_1,\dots,S_n$ is a collection of disjoint shapes in the plane, and let $\mathcal{X}$ denote the set of all $n$-tuples of points $\lbrace x_1,\dots,x_n\rbrace$ such that $x_i\in S_i$ for ...
5
votes
1answer
620 views

theorems equivalent to the parallel postulate

Is there a good survey article listing all the theorems of Euclidean geometry that are equivalent to the parallel postulate?
2
votes
0answers
224 views

Minimum solid angle and aspect ratio of an $n$-simplex

In computational geometry and other fields, it is of interest to have degeneracy measures for shapes of simplices, which quantitatively seperate the regular simplex from degenerate simplices. In two ...
1
vote
2answers
298 views

Triangles with Congruent Corresponding Sides that Cannot fold into a Tetrahedron

I've been trying to find, without much success, 4 triangles whose corresponding sides are congruent that cannot be folded into a tetrahedron. Anyone has any clue how to approach this problem?
0
votes
1answer
338 views

Action of Isometries on a Line in the Plane

I'm trying to determine the stabilizer of a line in a plane when acted upon by the group of isometries of the plane. Please note that I'm using the notation found in the Wikipedia article on Euclidean ...
10
votes
1answer
504 views

Polygons uniquely inducing arrangements

A beautiful, relatively recent result is that, Every simple arrangement $\cal{A}$ of $n$ lines in the plane is induced by a simple $n$-gon $P$. In a simple arrangement, every pair of lines ...
11
votes
1answer
502 views

Ratio of circumscribed/inscribed $(n{-}1)$-gons

As a discrete analog of the MO question, "Löwner-John Ellipsoid: incribed and circumscribed," I've been wondering what might be the maximum ratio of this quantity? Let $P$ be a convex polygon of $n$ ...
11
votes
2answers
533 views

Maximum thickness of three linked Euclidean solid tori

Consider three circles of radius 1 in $\mathbb{R}^3$, linked with each other in the same arrangement as three fibers of the Hopf fibration. Now thicken the circles up into non-overlapping standard ...
5
votes
2answers
531 views

Can we alter the axioms of Euclidean space to have $\mathbb{Q}^3$ as a unique model?

I posted this question at math.stackexchange.com but didn't get an answer. Motivation Physicists are in search for a model of discrete space(-time) for a long time. So I wondered why not start with ...
3
votes
0answers
308 views

Characterizations of Euclidean space

I posted this question at math.stackexchange.com but didn't get an answer. Is it a dumb question, eventually? There are three ways of characterizing the abstract Euclidean space $E^n$ that are quite ...
10
votes
6answers
663 views

Decomposing the plane into intervals

I posted this on Stack Exchange and got a lot of interest, but no answer. A recent Missouri State problem stated that it is easy to decompose the plane into half-open intervals and asked us to do so ...
5
votes
1answer
1k views

Point cloud that maximizes the minimum pairwise distance in Euclidean space

I am interested finding the collection of points in the Euclidean space that has the maximal minimal pairwise distance subject to an average norm constraint, that is, how to maximize $min_{i \neq j} ...
2
votes
1answer
2k views

Maximum number of mutually equidistant points in an n-dimensional Euclidean space is (n+1). Proof? [closed]

How to prove that the maximum number of mutually equidistant points in an n-dimensional Euclidean space is (n+1)?