The tag has no usage guidance.

learn more… | top users | synonyms

4
votes
0answers
93 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
47 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 ...
18
votes
2answers
851 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
291 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
55 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
116 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
224 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
40 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
242 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
210 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
306 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
86 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
623 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
112 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
276 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
171 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
658 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
170 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
95 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
212 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 ...
7
votes
3answers
208 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
433 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:       ...
1
vote
0answers
196 views

On matrix rank inequality

Let $A$ be a $\{0,1\}$ square matrix. Let $J$ be all $1$ matrix. Let $\bar{A}=J-A$. Is it possible for $rk_+(A)\geq c\cdot rk_+(\bar{A})^d-1$ and $rk_+(\bar{A})\geq c\cdot rk_+({A})^d-1$ for some ...
12
votes
1answer
553 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
82 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
93 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
810 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
684 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
207 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
219 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
403 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
122 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
338 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 ...
7
votes
0answers
140 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 ...
0
votes
0answers
78 views

Intersection points of closed curves inscribed in a convex polygon

Suppose that I have two distinct simple closed curves, $C_1$ & $C_2$, and each is inscribed in a convex polygon, D. By inscribed, I mean tangent to each side of D. In particular, I am most ...
10
votes
1answer
237 views

Schoenberg's Rational Polygon Problem

"A polygon is said to be rational if all its sides and diagonals are rational, and I. J. Schoenberg has posed the difficult question, ‘Can any given polygon be approximated as closely as we like by ...
1
vote
0answers
43 views

Non-Convex Polygons with “Antipodal Visibility”

by "antipodal visibility" of planar, simple polygons I mean the following property: if two points $p$ and $q$ on the polygon's boundary divide the polygon's boundary into two polylines of equal ...
2
votes
2answers
121 views

Maximum possible number of similar three-colored triangles

I want to maximize the number of similar triangles with vertices from three fixed sets, one vertex from each set. For example, if you fix two points $X$, $Y$ (i.e. two sets with only one member), then ...
-3
votes
2answers
158 views

Hexagon Formed by connecting Trisections of triangle sides [closed]

Is there a theorem for the area of the hexagon formed by connecting the points formed when the sides of a triangle are trisected? It appears that the ratio of the area of the triangle to the area of ...
1
vote
1answer
69 views

A quantity associated to a triangle

Let $\Delta ABC$ be a triangle in the plane. Let $P_{1}, P_{2}, P_{3}$ be the intersection points of bisectors, medians and altitudes, respectively. We define the quantity: \begin{equation} Q(\Delta ...
2
votes
1answer
207 views

The points of half area of a triangle

Let $S$ be a simply connected Riemannan surface . Suppose $\Delta ABC$ is a triangle on $S$. The Area of a triangle is denoted by $\mathcal{A}$. A point $P$ in the interior of $\Delta ABC$ is ...
2
votes
1answer
223 views

Distribution of area of randomly placed circles

I've searched the web now for ages to try and find a paper on the asymptotic distribution of the area of the union of randomly placed discs on the plane. Ideally, I would be looking for the discs to ...
6
votes
1answer
144 views

Hiding $k$ disks inside a larger disk

Suppose one has $k$ unit-radius disks, and the goal is to hide them inside a disk of radius $R \gg k$. The detection probes are rays along a line. (Think of the disks as tumor cells, and the rays as ...
4
votes
0answers
192 views

Boundary of an open, bounded and convex set in $\mathbb{R} ^n$

Let $U$ be an open, bounded and convex set in $\mathbb{R} ^n$. Since $\partial U$ is a rectifiable set it follows that up to a set of $H^{n-1}$-measure zero $\partial U$ is contained in a countable ...
1
vote
1answer
38 views

Maximum crossings of curvature-constrained curve

Let $C$ be a curve in the plane whose curvature is everywhere $\le 1$. If $C$ has length $L$, what is the largest number of proper self-crossings of $C$ as a function of $L$? For example, the curve ...
1
vote
1answer
141 views

Vertices of Curves and Eigenvectors of Hessian

This might be a trivial question, but I can't seem to figure it out. Suppose I have an implicitly defined curve in the plane given by $f(x,y) = t$. This curve is strictly convex, and feel free to ...
2
votes
0answers
95 views

What is the projective dual of a planar graph?

Everybody learns the usual definition of the dual of a planar graph when edges are preserved and faces are mapped to vertices. Everybody learns the projective duality. What if we apply it to a ...
6
votes
1answer
184 views

Integral straight-line embeddings of planar graphs

Wikipedia says (in the article on Fáry's theorem), "Heiko Harborth raised the question of whether every planar graph has a straight line representation in which all edge lengths are integers. The ...
3
votes
1answer
215 views

Generalization of notion of convexity

I am searching for the correct term for the following, if it exists. A set $X\subset \mathbb{R}^2$ is called $r$-convex if for any two points $x_1, x_2\in X$ such that there exists an arc of radius ...