Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Voronoi cells are not parallelograms. You are confused here by the image you posted. Voronoi cell borders are parts of the hyperplanes that are separating the individual means.</p> <p>Check out this website discussing and visualizing 3D voronoi diagrams:</p> <p><a href="http://www.wblut.com/2009/04/28/ooh-ooh-ooh-3d-voronoi/" rel="nofollow noreferrer">http://www.wblut.com/2009/04/28/ooh-ooh-ooh-3d-voronoi/</a></p> <p>In order to compute the voronoi cells, the common way is to first build the Delaunay Triangulation. There are a number of algorithms to do this in 2D, while in 3D it gets significantly more complex. But you should still be able to find something. <code>qhull</code> might be the proper way to go.</p> <p>When you have the Delaunay triangulation, compute the center of each tetraeder. These are the corners of the polygons that you need to draw. For any edge in the Delaunay triangulation, draw a polygon connecting the adjacent centers. This should be a hyperplane. Now all you need to do is also draw the Hyperplanes for edges that are part of the convex hull. For this you need to continue the hyperplanes that you should already have from the inside to the infinite outside.</p> <p>I <strong>strongly recommend</strong> to start with 2d first. Once you have a working code for 2D, see how to do the same in 3D. This is already pretty tricky in 2D if you want it to be fast.</p> <p>This is a graphic from Wikipedia visualizing both Delaunay and Voronoi diagrams: <img src="https://i.stack.imgur.com/ftZAW.png" alt="Delaunay and Voronoi in 2D"></p> <p>The black lines are the Delaunay Triangulation. The brown lines are orthogonal to this, and form the Voronoi diagram. Delaunay triangulation can be used for various cool visualization things: computing the convex hull, the voronoi diagrams and alpha shapes: <a href="http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Alpha_shapes_3/Chapter_main.html" rel="nofollow noreferrer">http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Alpha_shapes_3/Chapter_main.html</a></p>
    singulars
    1. This table or related slice is empty.
    1. POCalculating a Voronoi diagram for planes in 3D
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USAnony-Mousse
    1. USAnony-Mousse
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COI think my question wasn't clear enough. Let me try to clarify it. When you do a Voronoi diagram for points the cells that you get are the regions closest to a certain point. What I want to do is do the Voronoi for these parallelograms and so that each Voronoi cell defines the region closest its corresponding parallelogram. I can figure out how to do it in 2D (define points as vertices of the rectangles and then sum all the 4 up to get a total region and so on...) but 3D is really complex so I can't trust myself. That's why I am searching for a robust/tested code/paper/algorithm
      singulars
      1. PO
      1. USzamazalotta
    2. COEven in 2d, the corners will not work. I can easily draw a situation where you fail when you take just the corners. Say R1 is 0,0 0,1 1,1 1,0, and R2 is -50,50 50,-51 50,-52 -51,49. What you need is the closest set of points on the rim of each pair of objects. When a set of edges/planes is parallel, you need the minimum and maximum (in 3d, four pairs).
      singulars
      1. PO
      1. USAnony-Mousse
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload