Skip to main content

All Questions

2 votes
0 answers
127 views

Graph Laplacians, Riemannian manifolds, and object collisions

To preface this question, I am a part-time game developer and full-time optimization fiend. I am working on object collisions at the moment and many resources I have found online are more-or-less just ...
HeyoItsMateo's user avatar
1 vote
0 answers
48 views

Deployment and dispersion in triangular regions

Definitions (from C. Stanley Ogilvy's 'Tomorrow's Math'): Deployment: To place a specified number $n$ of points (stations) in a region such that the maximum distance of any point in the region from ...
Nandakumar R's user avatar
  • 5,827
16 votes
2 answers
276 views

Finding a plane numerically

Suppose I have three large finite sets $\{x_i\}$, $\{y_i\}$ and $\{z_i\}$; they are obtained by measuring coordinates of a collection of vectors in $\mathbb{R}^3$, but I do not know which triples ...
Anton Petrunin's user avatar
3 votes
1 answer
119 views

Shortest Manhattan-norm paths among disjoint rectangles

I am looking for the fastest possible algorithm for solving the following problem: I am given a collection of disjoint axis-aligned rectangles in the plane, and I need to pre-process these rectangles ...
Chuck Newton's user avatar
3 votes
0 answers
99 views

Optimally placing rectangles with obstacles

I am struggling with a fairly simple and natural geometric optimization problem, but I have not been able to find an obvious canonical method for solving it: I am given a collection of $m$ axis-...
Tom Solberg's user avatar
  • 3,959
5 votes
0 answers
2k views

Find the axis of symmetry in a point cloud

I have some dataset which describes a spherical cloud of points in 4D space. Actually, the coordinates of the points are the coefficients of unit quaternions, so you get the idea on what the data is ...
noncom's user avatar
  • 151
6 votes
2 answers
334 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 ...
Tom Solberg's user avatar
  • 3,959
14 votes
0 answers
258 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 ...
Tom Solberg's user avatar
  • 3,959
12 votes
3 answers
796 views

finding the most-isolated point in a high-dimensional cube

I have a set of points {$x_1,\ldots,x_n$} located in the d-dimensional unit cube $[0,1]^d$. $n$ is about 1000 and $d$ is about 25. I'd like to find $\max_{\omega\in [0,1]^d}\min_{i=1,\ldots,n} \|\...
Jeff's user avatar
  • 500
13 votes
2 answers
662 views

Complexity of a weirdo two-dimensional sorting problem

Please forgive me if this is easy for some reason. Suppose given $S$, a set of $n^2$ points in $\mathbb{R}^2$. I want to choose a bijective map $f$ from $S$ to the set of lattice points in $\lbrace ...
JSE's user avatar
  • 19.1k
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 ...
Igor Rivin's user avatar
  • 95.9k
4 votes
1 answer
2k views

Homogeneous system of polynomial equations

Hi all, Previously I asked a question that currently has no satisfactory answer Least sum squares given constraints on subcomponents It comes from an engineering problem. I was thinking to formulate ...
Tony's user avatar
  • 101
2 votes
2 answers
354 views

formulate edge length problem as convex optimization problem

I want to us convex optimization to describe a problem in computational geometry. Let $E = (E_1, E_2,\ldots , E_m) $ be a sequence of line segments in the plane, where $E_1$ and $E_m$ may be points ...
Alejandro Erickson's user avatar
5 votes
1 answer
787 views

Minimizing variance of distances between points when mean distance is fixed

In Rd, I have n > d+1 points. The mean distance between pairs of points is 1. How can I minimize the variance of the distances (equivalently, the mean squared distance)? I'm mainly interested in d &...
Robin Saunders's user avatar