The euclidean-geometry tag has no wiki summary.

**12**

votes

**0**answers

437 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 ...

**10**

votes

**0**answers

120 views

### Dividing a convex region to minimize average distances

Let $C$ be a convex region in the plane with area 1 that contains distinct points $p_1,\dots,p_n$. Say I'd like to divide $C$ into $n$ pieces $C_1,\dots,C_n$, each of area $1/n$, and I'd like to ...

**10**

votes

**0**answers

357 views

### What is the field generated by an Archimedean Spiral?

Let $F \subset \mathbb R$ be the set of lengths of line segments that one can construct, starting from the points $(0,0)$ and $(1,0)$, using a straightedge, compass, and an Archimedean spiral - the ...

**9**

votes

**0**answers

851 views

### 3-piece dissection of square to equilateral triangle?

At a workshop it was suggested that it likely remains an open problem
whether or not there is a 3- or 2 -piece
dissection
of a square to an equilateral triangle.
Can anyone confirm that this is ...

**7**

votes

**0**answers

119 views

### Ricocheting pinball-like shot: Complexity?

Suppose one has $n$ perfect two-sided mirror segments in the plane $\mathbb{R}^2$.
The segments are open, excluding their endpoints.
They are disjoint as closed segments, i.e., no pair shares an ...

**6**

votes

**0**answers

857 views

### Interpolating points with minimum curvature constraint

I have $n$ points $p_i$ strictly interior to a rectangle $R$,
and I would like to connect them with a curve $C$ whose curvature is as low as possible.
Let $\kappa_\max(C)$ be the sharpest (largest ...

**4**

votes

**0**answers

432 views

### sine and Archimedes' derivation of the area of the circle

The elementary "opposite over hypotenuse" definition of the sine function defines the sine of an angle, not a real number. As discussed in the article "A Circular Argument" [Fred Richman, The College ...

**3**

votes

**0**answers

82 views

### Containing a “fuzzy” ellipsoid within an ordinary ellipsoid

Consider the ellipsoid described by the inequality $(x - x_c)^T P^{-1} (x - x_c) \leq 1$, where the vector $x_c \in \mathbb{R}^n$ denotes the center of the ellipsoid and the symmetric positive ...

**3**

votes

**0**answers

42 views

### Number of not self-intersecting closed paths spanning $n$ iid uniform points

Let $X_1,X_2,\dots,X_n$ be independent uniform variables in the square. What is the number of piece-wise linear paths which vertices are all the $X_i$ and that do not self-intersect? In other words, ...

**3**

votes

**0**answers

137 views

### Tetrahedra passing through a hole

Assume a plane $P\subset\mathbb R^3$ has a hole $H$, and that the hole is topologically a compact disc. Being so, $P\setminus H$ does not separate the space. A regular tetrahedron $\sigma^3$ (of ...

**3**

votes

**0**answers

198 views

### Finite subgroups of the unimodular group

This is related to this MO question (and others as well).
Hoping that this will not turn out to be too broad, I would like to know about the 'state of the art' of:
1) The problem of classifying ...

**3**

votes

**0**answers

312 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 ...

**2**

votes

**0**answers

105 views

### Examples of Geometric Constructions in Higher Dimensions

The classical problem of geometric construction seems to be restricted to planar Euclidean Geometry with straight edge and compass as the only admissible "construction-tools".
I would like to ...

**2**

votes

**0**answers

170 views

### Continuity of minimizers to distance function from point to convex set

Suppose I am minimizing the Euclidean distance in $\mathbb{R}^{n}$ between a point $y$ and compact convex set $U$ (where $y\notin U$):
$\min_{x\in U}\|x-y\|$.
I believe the minimizer $x_{U}^{*}$ is ...

**2**

votes

**0**answers

150 views

### Probability of 4 Points being in Convex Configuration

Background of my question is, that I would like to implement a parallel preprocessing for a constructing the convex hull of very huge number of points in the euclidean plane;
the idea is to process ...

**2**

votes

**0**answers

135 views

### Series for envelope of triangle area bisectors

The lines which bisect the area of a triangle form an envelope as shown in this picture
It is not difficult to show that the ratio of the area of the red deltoid to the area of the triangle is ...

**2**

votes

**0**answers

202 views

### Axiomatization of the incidence geometry of the Euclidean plane

There are several well-known axiomatizations of Euclidean plane geometry, the language of which is usually considered to include at least the relations of
incidence (point-line, point-segment, or ...

**2**

votes

**0**answers

250 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

**0**answers

43 views

### Components of Intersection of Ellipsoids

Let $\Sigma$ be an $n-1$ dimensional ellipsoid in $\textbf{R}^{n}$ and $S$ the unit sphere.
I would like to understand the connected components $C$ of the intersection of $\Sigma$ and $S$.
In my ...

**1**

vote

**0**answers

97 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 ...

**0**

votes

**0**answers

103 views

### How large can a set of nearly equidistant points be?

Suppose that $D$ is a set of points in $\mathbb{R}^{k}$ such that all pairwise distances between them belong to $[1,1+\epsilon]$.
It seems that such a set cannot be very large and that its ...

**0**

votes

**0**answers

27 views

### Is there a term for “ranked distance” matrices?

In a n by n "ranked distance matrix" each element has a rank $r_{ij}$ between 1 and n that indicates it is the $r_{ij}$th smallest element in column $i$ of a corresponding Euclidean distance matrix. ...

**0**

votes

**0**answers

96 views

### About the area of the region where the paper is twofold when you double a piece of paper in the shape of a triangle

Suppose that you have a piece of paper in the shape of a triangle $ABC$ whose area is $S_0$ and that the area of the region where the paper is twofold when you double the paper in two along a line is ...

**0**

votes

**0**answers

90 views

### Error Metric which incorporates both mean & standard deviation of data in euclidean space

For simplicities sake (the actually problem is more complex)...Let say I have a set of n 3d points, whose position move over time. For all pairs, I have calculated the mean and standard deviation of ...

**0**

votes

**0**answers

160 views

### Inertia/Gravity in Distance Geometry

The Cayley-Menger Determinant, D(N), slickly calculates the N-dimensional simplex
volume of any N+1 points. One constraint in our 3D world is that D(4)=0.
Give each point a mass (Mi) and dynamic ...