The tag has no usage guidance.

learn more… | top users | synonyms

3
votes
2answers
117 views

Sub-sector covers for disks and balls

Define an open $k$-sector of a disk as the portion between two radii separated by an angle of $2\pi/k$, but open along the two radii (and closed along the circle boundary). Call a set a sub-$k$-sector ...
7
votes
1answer
117 views

Optimal stacking of split logs

Consider firewood logs as unit-radius cylinders of the same length. Each log is split into $k$ pieces by equiangular sectors meeting in the circle center: $k=2$ leads to semicircles, $180^\circ$; ...
2
votes
1answer
89 views

What is the maximal diameter of a cell in a particular partition of the simplex?

Consider a standard simplex with points $(p_1, \dots, p_n)$, $p_i \ge 0$, and $\sum_i p_i = 1$. Fix a set $\{q_k\}_{k=1}^K$ with $0\leq q_k \leq \infty$ and $i,j\in\{1, \dots, n\}$. Partition it via ...
1
vote
0answers
71 views

Irreducible real curves on ${\mathbb C}P^1$ invariant under the finite group action

Let $G$ be a finite subgroup of a Möbius group with a standart action on a real algebraic variety ${\mathbb C}{\mathbf P^1}.$ How one can describe $G$-invariant irreducible real algebraic curves? ...
4
votes
0answers
155 views

Plane real curves such that their intersections with lines are hyperbolic

Let $R$ be an (irreducible) plane real algebraic curve (without isolated points). Consider Zarissky closure of $R$ in ${\mathbb C}P^1$ (as real variety). Suppose that $\lambda\in R ...
2
votes
1answer
71 views

Could a real curve symmetric across the line be defined only by polynomial that is not reflection-invariant?

Let $R$ -- be an irreducible plane real algebraic curve (without isolated points). Suppose that $(x,y)\in R\Leftrightarrow (x,-y)\in R.$ Question: could one find a polynomial $f(x,y)$ with zero set ...
10
votes
1answer
215 views

Optimization of points on a plane

Suppose we have $n$ points on a plane. Let $D$ be the sum of the squares of all the pairwise distances between the points. Let $A$ be the area of the convex hull. What is the minimum possible value of ...
6
votes
0answers
207 views

Axiom of choice and a set in the plane that intersects every line in two points

In this question Subset of the plane that intersects every line exactly twice someone ask for a reference of a paper where they proof the result : ''There exist a subset of the plane that intersects ...
0
votes
0answers
55 views

What is the minimal number of lines needed to partition a simplex into cells of diameter at most $\epsilon$?

I am studying a problem that requires me to partition the simplex into cells using a particular family of hyperplanes. For concreteness, consider the 2-simplex. I would like to construct lines ...
8
votes
0answers
115 views

Boomerangs in Polya's orchard

Polya's orchard problem asks for what radius $r$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the exterior of the orchard. The answer is known; $r$ ...
29
votes
5answers
1k views

Tiling the plane with incongruent isosceles triangles

It is not difficult to tile the plane with incongruent triangles. One could tile with equilateral triangles, and then partition each equilateral into three triangles, displacing their common ...
7
votes
2answers
300 views

Closed curve whose neighborhood is as large as possible

Let $C$ be a closed curve in the plane and let $N_\epsilon(C)$ be an $\epsilon$-neighborhood of $C$, like this: (ignore the fact that the "curve" is polygonal in this picture, I drew it in MATLAB) ...
1
vote
1answer
74 views

Showing that a particular area is small

Note: I posted this on math.stackexchange.com earlier (original post here: http://math.stackexchange.com/questions/1471331/showing-that-a-particular-area-is-small), but it received no responses and ...
4
votes
1answer
60 views

Bounding the number of points at integral distance from vertices of a triangle

Can the number of points at integral distance to all three points of a non-degenerate triangle of area $A$ be bounded by $1+cA$ for some suitable constant $c$? Remark: Since it is easy to bound this ...
7
votes
0answers
114 views

Bang's open question strengthening Tarski's planks problem

Tarski's Planks problem, solved by Thøger Bang in 1951, says (in a simplified $\mathbb{R}^2$ version) that it requires "planks" (parallel strips) of total width $\ge d$ in order to completely cover a ...
4
votes
0answers
95 views

A question about complex plane algebraic curves

I would like to ask a question about plane projective curves. Let $C\subset{\mathbb P}_2={\mathbb P}(V)$ be a plane curve of degree $n\geq 3$. Then we have a non splitted exact sequence ...
7
votes
1answer
180 views

Set of balls which the number of the ball intersects lines on the plane is bounded

Does there exist the set of balls(may be not disjoint) $X=\{B_i\subset\mathbb{R^2};i\in I\}$, satisfing following properties?(Note that the ball has a positive real radius) Let the set of all lines ...
0
votes
0answers
133 views

Best measure for curve similarity

I would like to measure similarity between two curves represented by two arrays of points. The similarity measure should not depend on the size of these shapes. Two similar shapes but have different ...
20
votes
1answer
931 views

Why is it so hard to prove Toeplitz' conjecture?

I'm a layman in mathematics, so please excuse me in advance for anything in this question that may be inappropriate :D. Well: Four years ago, I was reading (and working to solve the puzzles on) ...
3
votes
4answers
321 views

Terminology for polygons

As you may know term "polygon" might mean few different things and its meaning has to guessed from context. By some reason I have to use few of these meaning in one place. So I converge to the ...
2
votes
1answer
59 views

Maximal opening angle of a polygon from a point [closed]

I'm looking for an algorithm that given a 2D convex polygon and point outside it, returns the two points of the polygon which are the two extremities of the polygon when viewed from that point. One ...
30
votes
3answers
1k views

Is there a subset of the plane that meets every line in two open intervals?

Using the Axiom of Choice, it is possible to construct a subset of the plane that meets every line in two points (these are called "$2$-point sets"). What if, instead of points, we ask for two open ...
4
votes
1answer
123 views

Best polygonal approximation to a polynomial $\pm$ c

Let a planar region $R$ be defined by the vertical range bounded by a polynomial $f(x) \pm c$ with $c>0$ a constant, and with $x$ varying between the smallest and largest roots of $f(x)$. For ...
6
votes
2answers
244 views

Existence of finite set of points in the revolving circles

Let $k$ and $n$ be two fixed integers. Let $C$ denotes the circle with radius $4n$ (in the plane $\mathbb{R}^2$). Suppose $\{C_1,C_2\}$ shows the set of two arbitrary tangent circles with radius $2n$ ...
1
vote
0answers
46 views

Projecting a convex partition onto a convex set

Say that $X$ and $Y$ are two convex regions in the plane, and suppose that $X \subset Y$. Further suppose that $Y$ is partitioned into disjoint convex subsets $Y_1 ,\dots, Y_n$. Is there a way of ...
6
votes
2answers
284 views

A (possibly boring) Voronoi Game

The board for this game is a compact convex region $\cal C$ of $\mathbb{R}^2$. Below I illustrate with $\cal C$ an equilateral triangle. Two players, $A$ and $B$, alternate turns. At each turn they ...
11
votes
1answer
217 views

Complexity of planar scissor congruence

Two (not necessarily convex) poygons of equal area are scissor-congruent, i.e. both can be cut along a finite number of straight lines or segments into isometric pieces. What can be said about the ...
6
votes
2answers
322 views

Will (general points + small number of arbitrary points) impose independent condtions on plane curves?

It is well known that imposing vanishing at general points of $\mathbb P^2$ gives independent conditions on curves of degree $d$. Also, it is known that a small number ($\le d+1$) points always impose ...
3
votes
1answer
93 views

Polygons with centroid at origin and vertices on compact codimension one submanifold of $\mathbb{R}^{n}-\{0\}$

Let $M$ be a compact codimension one submanifold of $\mathbb{R}^{n}$ which does not contaion $0$ and the origin lies in the bounded component of$\mathbb{R}^{n}-\{0\}$. Is it true to say that: ...
3
votes
2answers
705 views

What's the name of this geometric mathematical modeling problem?

There is a right angle corner with width 1 in both directions. One wants to find the largest area shape which can pass through this corner. I know that this is a famous problem, but what is it called? ...
2
votes
0answers
114 views

Intersecting balls with convex regions and a bisector thereof

This question is related to my previous posting Angle subtended by the shortest segment that bisects the area of a convex polygon Let $C$ be a convex region in the plane and let $s$ be the shortest ...
2
votes
1answer
282 views

Perimeter of ellipse: Combination of two geometries

Is there a Riemannian metric $g$ on $\mathbb{R}^{2}$ such that for every ellipse $\gamma$ in the plane we have:$$\text{The Euclidien perimeter of}\; \gamma=\lambda (g\text{-diameter ...
1
vote
2answers
216 views

Curves similarity metric [closed]

I am working on an optical character recognition algorithm that takes vector data (i.e. polylines) as input rather than raster picture. E.g., we have N polyline samples, and when certain polyline is ...
6
votes
0answers
687 views

$ n $-Cats-in-a-Bed Problem: Picking $ n $ points in a given planar domain to maximize the sum of their pairwise distances

Let $ C $ be a connected and simply connected compact subset of the plane $ \mathbb{R}^{2} $. How can we pick $ n $ points, denoted $ x_{1},\ldots,x_{n} $, lying in $ C $ such that the total sum $ ...
8
votes
0answers
173 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 ...
4
votes
1answer
107 views

Geometric realization of an abstract triangulation of the plane

Can every abstract simplicial complex whose geometric realization is homeomorphic to $\mathbb{R}^2$ be realized by a rectilinear triangulation of the Euclidean plane? Alternatively put, can a curvy ...
6
votes
2answers
231 views

Geometric dominating set: NP-complete?

Let $G=(V,E)$ be a geometric graph, a graph embedded in the plane whose edge lengths are the Euclidean distance between its endpoint vertices. Say that a set of vertices $D \subseteq V$ is a geometric ...
8
votes
3answers
225 views

Set with small internal radius, small perimeter and prescribed area

Given a regular set $E\subset \mathbb R^2$ define $$ R(E) = \sup\{r\colon \exists x,\ B(x,r)\subseteq E\} $$ to be the radius of the largest circle contained in $E$ and let $|\partial E|$ be the ...
6
votes
3answers
436 views

Polynomial threading through a monotone corridor

I have a need to find a polynomial of minimal degree that connects two points and stays within a given "corridor," by which I mean an $x$-monotone polygon. Here is an example:       ...
13
votes
1answer
598 views

Connected components $0-1$ matrices

Let $M$ be a $0-1$ matrix. Here a matrix has one component means we can traverse from a matrix entry $(i,j)$ which is $1$ to any other one by moving step of $(i\pm1,j),(i,j\pm1),(i\pm1,j\pm1)$ where ...
6
votes
0answers
84 views

Unbalanced equipartitions

Let $K$ be a compact convex set in the plane. Say that a perimeter-halving partition of $K$ is a partition of $K$ into two pieces by a chord (a segment with endpoints on the boundary $\partial K$) ...
0
votes
2answers
97 views

Planar curves identical to their inverses

Is the right strophoid the only planar curve $C$ whose inverse curve w.r.t. some circle (in this case: centered on the origin) is identical to $C$?               ...
4
votes
3answers
919 views

Koebe–Andreev–Thurston theorem - where can I find a proof?

Koebe–Andreev–Thurston theorem (known also as the circle packing theorem) says that any planar graph can be realized by a set of (interior-) disjoint disks corresponding to vertices, such that two ...
28
votes
2answers
699 views

Term for “uncheckable constructions”

Is there a term for "uncheckable geometric constructions"? Say, Angle Trisection and Doubling the Cube are checkable; i.e., if the answer is given one can do finite Compass-and-straightedge ...
4
votes
1answer
217 views

Panning for gold nuggets: a type of isoperimetric problem

Let $C$ be a unit-radius circle in the plane. Suppose you have a total length $L$ of string available, and your task is to connect chords of $C$ using no more than $L$ of string to minimize the ...
6
votes
4answers
240 views

Inside-out polygonal dissections

A dissection of a polygon $P$ is a partition of $P$ into a finite number of pieces, which can then be rearranged (via planar translations and rotations) and joined (without overlap) to form a new ...
0
votes
2answers
516 views

Determine the boundary points of a set of points [closed]

I have a set of points $S=\{(x_1,y_1),(x_2,y_2),\ldots,(x_n,y_n)\}$. Then how to find the boundary points (which is a subset of $S$) of $S$? There are methods like convex hull, concave hull and ...
4
votes
0answers
124 views

Optimal planar net for catching convex shapes

Imagine you want to make a net out of string to filter and catch objects of a certain size, minimizing the length of string employed. (This actually arises in filtering biological impurities from ...
6
votes
2answers
342 views

Are angles between points enough to decide the realizability?

Let n points in the plane be given whose coordinates we don't know. Assume, however, that for any triple of the points we know the angle. Question: Can we decide whether the n points are realizable ...
8
votes
1answer
223 views

A forked plane continuum

I came up with this question while trying to solve the following MO one: Does every connected set that is not a line segment cross some dyadic square? Suppose $C$ is a plane continuum (i.e. a ...