Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
2 answers
349 views

How many dihedral angles need to be specified to uniquely specify a triangulated polyhedron?

Suppose you are given a simplicial complex $K$ homeomorphic to the sphere and for each each edge of the complex a label specifying a length of that edge (this gives us a polyhedral metric on $K$). In ...
John's user avatar
  • 185
4 votes
2 answers
425 views

Algorithm for Reconstructing Point Sites from a Voronoi Diagram

how can one construct a finite set of points in the euclidean plane from its Voronoi Diagram and, what is the complexity of the problem?
Manfred Weis's user avatar
  • 13.2k
4 votes
1 answer
323 views

What properties does generalized Delaunay triangulation have?

Suppose that instead of the usual circle, we pick some other convex set D and make the Delaunay triangulation of a finite planar point set with respect to this set, i.e. connect two points if there is ...
domotorp's user avatar
  • 19k
3 votes
1 answer
1k views

Regularity of Delaunay triangulation of a hypercube

First using a three dimensional unit cube as an example for the term "regularity", we can have two possible triangulations: (A) (B) We say the lower triangulation is more "regular" than upper ...
Shuhao Cao's user avatar
3 votes
0 answers
169 views

Computing Voronoi poles in $\mathbb{R}^d$ (the farthest points within each cell)

Say I have a Voronoi diagram of some points $p_1,\dots,p_n\in\mathbb{R}^d$, which tesselates $\mathbb{R}^d$ into cells $V_1,\dots,V_n$. Within each cell $V_i$, the pole is defined as the vertex of $...
Victor Tu's user avatar
3 votes
0 answers
391 views

Dissection of a polygon into convex polygons

Problem: for a fixed integer $m\geqslant 3$ find all $n$ such that no $n$-gon can be dissected into convex $m$-gons. I would be very grateful for any information on this problem. Remark 1. There ...
Ivan Feshchenko's user avatar