Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
2 answers
339 views

Angle subtended by the shortest segment that bisects the area of a convex polygon

Let $C$ be a convex polygon in the plane and let $s$ be the shortest line segment (I believe this is called a "chord") that divides the area of $C$ in half. What is the smallest angle that $s$ could ...
Tom Solberg's user avatar
8 votes
1 answer
1k views

Dubins car shortest paths: Decidable?

A Dubins car follows a Dubins path in $\mathbb{R}^2$, with constant wheel speed and limited turning radius. It is known that the shortest Dubins path in the absence of obstacles follows circular arcs ...
Joseph O'Rourke's user avatar
4 votes
2 answers
579 views

Largest inscribed rectangle inside a convex polygon

It has been proved by Radziszewski in this paper K. Radziszewski. Sur une probleme extremal relatif aux gures inscrites et circonscrites aux gures convexes. Ann. Univ. Mariae Curie-Sklodowska, Sect. ...
MB_MB's user avatar
  • 43
5 votes
1 answer
566 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 ...
geoalgo's user avatar
  • 153
1 vote
0 answers
179 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 ...
John Gunnar Carlsson's user avatar
2 votes
0 answers
697 views

Find minimum-area ellipse enclosing a set of ellipses, all centered at the origin

Given a set of N > 2 (two-dimensional and coplanar) ellipses, all centered at the origin, how do I find the ellipse with the minimum area which encloses all of them? Background: Thanks to Will Jagy ...
Dave's user avatar
  • 21
6 votes
2 answers
2k views

Find minimum-area ellipse which encloses two ellipses

I need an efficient algorithm to find the ellipse with the smallest possible area which encloses two given ellipses. The given ellipses are constrained to have coincident centers at the origin but can ...
Dave's user avatar
  • 61
5 votes
3 answers
4k views

Minimum distance between two arbitrary circles in space?

What is the minimum distance between two arbitrary circles in space? I am working out the problem with Maxima, but I am surprised by how complicated this rapidly turns out to unfold for such a "...
zazakely's user avatar
21 votes
8 answers
4k views

Determine if circle is covered by some set of other circles

Suppose you have a set of circles $\mathcal{C} = \{ C_1, \ldots, C_n \}$ each with a fixed radius $r$ but varying centre coordinates. Next, you are given a new circle $C_{n+1}$ with the same radius $r$...
Adrian Schönig's user avatar
7 votes
5 answers
1k views

How to compute the average distance till intersection within a triangle in $\mathbb{R}^2$?

You are given 3 points in $\mathbb{R}^2$; $A$, $B$, $C$ forming a triangle with area > 0. You pick an arbitrary point inside $ABC$ and an arbitrary direction. After some distance $d$, you will ...
user2814's user avatar
  • 171