Questions tagged [computational-geometry]
Using computers to solve geometric problems. Questions with this tag should typically have at least one other tag indicating what sort of geometry is involved, such as ag.algebraic-geometry or mg.metric-geometry.
503 questions
8
votes
2
answers
752
views
Are point sets of the same order type connected by continuous (order type)-preserving motion?
Given two general position point sets in $\mathbb{R}^2$ of the same size and order type, is it possible to continuously move the points of one set until they coincide with those of the other set in ...
- 83
8
votes
1
answer
10k
views
Subtract Rectangle from Polygon
I'm looking for an algorithm that will subtract a rectangle from a simple, concave polygon and return a remainder of polygons. If the rectangle encloses the polygon, the remainder is null. In most ...
- 325
8
votes
4
answers
1k
views
Shortest Path in Plane
I thought about the following problem:
Given a polygonal subdivision of the euclidian plane where each of the polygons has a speed associated with it, and given two points s,t, I'm interested in the ...
- 239
8
votes
2
answers
362
views
Computational methods for dealing with geometrically complicated solid boundaries in fluid-air interface problems
Hello,
I am a PhD student who does not have extensive computational experience seeking advice from those experienced with computational modelling as to which method would be most appropriate for ...
- 147
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 ...
- 113
8
votes
1
answer
935
views
Final project ideas - computational geometry
Next semester I am teaching (the programming part) of a course in Computational Geometry. There are 14 weeks of class, two "pure theory/blackboard" hours per week, one "theory/...
- 553
8
votes
1
answer
1k
views
How to generate Voronoi diagram with polygons of equal area?
I would like to generate some random set of points so that their Voronoi diagram consist of equal-area polygons. Is it possible to impose some constraints on the points in order to have the same areas ...
8
votes
3
answers
389
views
A simplified Art Gallery Problem in a matrix
Let's take a $m \times n$ matrix as an area with $m \times n$ blocks (likes a 2D-version of the world in Minecraft). We have to put some lamps in this matrix to illuminate the whole matrix. Here is ...
- 549
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 ...
- 151k
8
votes
1
answer
316
views
What is the form of the $(v_0,v_1)$-pizza curve?
Assume that there are two (competing) pizza houses situated at the points $0$ and $1$ on the complex plane. These pizza houses can deliver pizza to points of the plane with the largest velocities $v_0$...
- 41.9k
8
votes
1
answer
236
views
inferring the slope of a digitized line
Given real numbers $a$ and $b$, and an integer $n \geq 2$, let $f(n,a,b)$ be the minimum of $(nint(ja+b)-nint(ia+b)+1)/(j-i)$ (for $1 \leq i < j \leq n$) minus the maximum of $(nint(ja+b)-nint(ia+b)...
- 19.7k
8
votes
1
answer
231
views
Counting polygons in arrangements
For an arrangement of lines $\cal{A}$ in the plane, an
inducing polygon $P$ is a simple polygon satisfying:
(a) every edge $e$ of $P$ lies on some line $\ell$ of $\cal{A}$, and
(b) every line $\ell \...
- 151k
8
votes
0
answers
229
views
Nearest point to a real algebraic set
Suppose I have a compact bounded real algebraic (eventually: or analytic or semialgebraic or semianalytic set) $V \subset \mathbb R^3$ and a point $x\in\mathbb R^3 \setminus V$. How much do we know ...
- 2,275
7
votes
2
answers
379
views
Number of edges in linklessly embeddable graphs
What is the maximum number of edges of an $n$-vertex linklessly embeddable graph?
A more general question is the following. What is the maximum number of edges of an $n$-vertex graph with Colin de ...
- 93
7
votes
2
answers
1k
views
Is a given point in the interior of the convex hull of a given finite collection of points?
Suppose I have the convex hull $P$ of a finite collection of points in $\mathbb{R}^d,$ and I want to see whether a point $p$ is contained in $P.$ This is a standard (some would say the standard linear ...
- 96.4k
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 ...
- 171
7
votes
4
answers
706
views
A quick algorithm for calculating the $\ell_1$-distance between two finite sets on the real line?
For two non-empty finite sets $A,B$ in the real line define the $\ell_1$-distance $d_1(A,B)$ between $A$ and $B$ as the smallest Lebesgue measure of a closed subset $\Gamma\subset \mathbb R$ such that ...
- 41.9k
7
votes
2
answers
3k
views
Conic hulls and cones
Suppose I have a number of vectors in $\mathbb{R}^n.$ The first question is: what is the most efficient algorithm to compute their "conic hull" (the minimal convex cone which contains them)? The next ...
- 96.4k
7
votes
2
answers
1k
views
The (Sigma) Algebra of Convex Sets
This is a question-by-proxy for a colleague from computer science. I'm sure many people here are already aware that convex decomposition forms an important sub-field of both computational geometry and ...
- 15.5k
7
votes
3
answers
2k
views
Algorithm to compute the Voronoi diagram of points, line segments and triangles in $\mathbb{R}^3$
Is there a known algorithm to compute the (generalized) Voronoi diagram of a set of points, line segments and triangles in $\mathbb{R}^3$? If yes, are there any available implementations?
I know that ...
7
votes
1
answer
3k
views
Any reference to an algorithm for finding the largest empty circle on a sphere (with great-circle distance)?
Given a set $S$ of 2D points in the plane, there are known algorithms for finding the largest empty circle ($LEC$) of the set of points.
The $LEC$ problem is stated in this way: find a $LEC$ whose ...
7
votes
2
answers
527
views
Intersection of 2 visibility polygons
Let $P$ be a simple, closed and bounded polygon and $p_1,p_2 \in \mathrm{int}(P)$ be two points in its interior. Is it true that the intersection of the visibility polygons of $p_1$ and $p_2$ is ...
- 579
7
votes
1
answer
768
views
To minimize the Hausdorff distance between convex polygonal regions
Definition: The Hausdorff distance is the greatest of all the distances from a point in one set to the closest point in the other set.
Question: Given two convex polygonal regions P1 and P2 on the ...
- 5,979
7
votes
1
answer
362
views
Does generic projection into $\mathbb{R}^3$ preserve real-algebraic-curve-ness?
I'm interested in the topological properties of certain real algebraic curves in high-dimensional spaces. I want to visualize these curves (say, like this), and so I'm pursuing dimensionality ...
- 7,633
7
votes
1
answer
348
views
Finding maximal prefix of a simple curve
Let $S$ be a simple curve. I want to determine maximal prefix of $S$ contained in a unit circle. Is this possible, or has it perhaps already been solved in the past, and I am just unable to find an ...
- 71
7
votes
1
answer
224
views
Computing homology of subvarieties of Euclidean spaces by persistent homology
Let $M$ be a submanifold of the Euclidean space $\mathbb{R}^n$. Let $G$ be a finite group acting on $M$ freely. I want to compute the homology (or even the cohomology ring) of $M/G$.
Suppose the ...
- 543
7
votes
0
answers
122
views
Does the problem of recognizing 3DORG-graphs have polynomial complexity?
A 2DORG is the intersection graph of a finite family of rays directed $\to$ or $\uparrow$ in the plane. Such graphs can be recognized effectively (Felsner et al.). A 3DORG is the intersection graph of ...
- 4,535
6
votes
5
answers
4k
views
Formulas for equidistant curves
I'm trying to draw on the computer a curve that keeps always the same distance(given as parameter) from a given curve. I know the formula for the given curve. I tried moving perpendicular to the first ...
- 351
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 ...
- 61
6
votes
1
answer
508
views
How many triangulations of a regular octahedron are there, without introducing new vertices?
It is easy to find three triangulations, each consisting of four tetrahedra. Are there more?
- 61
6
votes
1
answer
2k
views
Given a set of 2D vertices, how to create a minimum-area polygon which contains all the given vertices?
Not sure whether this question belongs here or math.stackexchange.
You can assume that all the vertices are unique. The given vertices can be the vertices of the polygon, thus they do NOT have to be ...
- 163
6
votes
3
answers
289
views
Minimum separating subdivision in Plane
Hi
I was thinking about the following problem:
Given a planar Graph embedded in the plane and a set of points $P$ contained in the faces (no face contains more than one point) I want to determine ...
- 239
6
votes
1
answer
374
views
Desargues ten point configuration $D_{10}$ in LaTeX
I want to draw the Desargues configuration $10_3$ in LaTeX using the standard picture environment, which allows only lines with the slopes $n:m$ where $\max\{|n|,|m|\}\le 6$. Is it possible? If not, ...
- 41.9k
6
votes
1
answer
761
views
Checking if one polytope is contained in another
I have two sets of inequalities, say, $Ax \leq 0$ and $Bx \leq 0$. I would like to know if they both define the same polytope. Or, even, whether one is contained in the other.
At the moment I am ...
- 491
6
votes
4
answers
752
views
Algorithm for k-medians in a convex polygon
Are there any known approximation algorithms or exact solution schemes for the k-medians problem in a convex polygon? That is, placing a collection of points $p_1,\dots,p_k \subset \mathbb{R}^2$ in a ...
6
votes
1
answer
148
views
Does a minimum area disk that is bounded by a cycle $C$ continuously deform in $R^3$ as $C$ moves in $R^3$?
Let $C_1=(v_1,v_2,\ldots,v_{i-1},v_i)$ and $C_2=(v_1,v_2,\ldots,v_{i-1},v'_i)$ be two cycles that are drawn in $R^3$ in the shape of an unknot (not knotted) with straight line segments as their edges (...
- 415
6
votes
2
answers
999
views
The straightest possible path embeddable in a path of polygons
I'm studying a problem involving the sets of discrete curves that can be embedded in a non-trivial polygon, from a source to a target point, as shown below.
Initially my interest was limited to the ...
- 661
6
votes
2
answers
335
views
Do computational geometers use Lagrange multipliers?
Can anyone point me to an example of a problem that (more or less) originated in computational geometry whose solution requires the use of Lagrange multipliers (or Kuhn-Tucker conditions, or dual ...
- 4,049
6
votes
2
answers
215
views
Partition of polygons into 'strongly acute' and 'strongly obtuse' triangles
Definition: Let us refer to obtuse triangles with the largest angle strictly above a given cutoff value as 'strongly obtuse' - the definition is parametrized by the cutoff value. Likewise, strongly ...
- 5,979
6
votes
2
answers
1k
views
Light rays bouncing around inside a sphere in d-dimensions
Suppose $S=\mathbb{S}^d$ is a unit sphere in $(d-1)$ dimensional space, with $d=3$ of special interest.
The surface of $S$ is a perfect (internal) mirror.
You stand at point $x$ (not the sphere center ...
- 151k
6
votes
1
answer
2k
views
Approximation of convex hull in high dimension
What are efficient methods (polytime) to compute an approximation of the convex hull in high dimension (say, $30000$) for a given set of points?
Edit:
I am looking for an algorithm for getting the ...
- 61
6
votes
1
answer
239
views
Algorithm that generates a n-simplex that cover n-polytope?
Given an $n$-cube with unit volume, is there any algorithm that generates a $n$-simplex that covers the $n$-polytope?
- 161
6
votes
1
answer
5k
views
Finding the vertices of a convex polyhedron from a set of planes
I'm new to computational geometry and advanced mathematics in general here so bear with me. I've spent a decent amount of time attempting to figure out this problem and I just can't find a solution.
...
- 171
6
votes
1
answer
143
views
Minimizing the number of segments in drawings of planar graphs
Every planar graph has at most $3n-6$ edges, where $n$ is the number of vertices. Moreover, every planar graph can be drawn with straight-line edges in the plane, without crossings. For example, for ...
- 4,535
6
votes
2
answers
189
views
Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon
For any point P in the interior of a convex polygon, the sum of the angles subtended by the edges of the polygon is obviously 2π.
Given a convex polygon, how does one algorithmically find the point (...
- 5,979
6
votes
1
answer
301
views
Software computation with arithmetic schemes
For rings such as $\mathbb{Z}[x,y]$ is there software to compute any of:
1.) The integral closure of $\mathbb{Z}[x,y]/(f)$. de Jong has a very general algorithm that works in this context (http://...
- 3,555
6
votes
1
answer
424
views
Probability of intersecting a rectangle with random straight lines
We are given a rectangle $R$ with sides lengths $r_1$ and $r_2$, contained in a square $S$, with sides lengths $s_1=s_2\ge r_1$ and $s_2=s_1\ge r_2$. $R$ and $S$ are axis-aligned in a cartesian plane $...
- 1,677
6
votes
1
answer
631
views
On covering convex 2D regions with rectangles
Given a convex 2D region $C$ and a positive integer $N$. We need to cover $C$ with $N$ rectangles such that the sum of the areas of the $N$ rectangles is the least – no further constraints on the ...
- 5,979
6
votes
1
answer
239
views
Fractional Helly for more than one piercing
Fractional Helly Theorem says the following:
For every $0<\alpha\leq 1$ there exists $\beta = \beta(d, \alpha)$ with the following property. Let $C_1 , C_2 , ..., C_n$ be convex sets in $R^d$, $n \...
- 285
6
votes
0
answers
219
views
How big a box can you wrap with a given polygon?
Question: Given a convex polygonal region, how does one find the box (rectangular parallelopiped) of maximum volume that can be wrapped with this region? While wrapping, if needed, some portions of ...
- 5,979