Timeline for Algorithm to compute the Voronoi diagram of points, line segments and triangles in $\mathbb{R}^3$
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15, 2021 at 17:03 | answer | added | Robert Manschke | timeline score: 0 | |
| Feb 6, 2019 at 0:46 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Feb 5, 2019 at 16:32 | answer | added | Iddo Hanniel | timeline score: 6 | |
| Sep 28, 2018 at 2:45 | comment | added | David G. Stork | I defined a separating plane for each pair of point, then computed the intersection points, then formed the cells based on those points. | |
| Sep 28, 2018 at 1:15 | comment | added | Leonardo Sacht | Thanks for your answer, David. What algorithm did you use to generate the exact three-dimensional tesselation for your book? | |
| Sep 28, 2018 at 1:09 | history | edited | Leonardo Sacht | CC BY-SA 4.0 |
added 23 characters in body; edited title
|
| S Sep 28, 2018 at 1:02 | history | suggested | David G. Stork | CC BY-SA 4.0 |
eliminated irrelevant sections and included better MathJax
|
| Sep 27, 2018 at 23:55 | review | Close votes | |||
| Sep 30, 2018 at 22:59 | |||||
| Sep 27, 2018 at 23:32 | review | Suggested edits | |||
| S Sep 28, 2018 at 1:02 | |||||
| Sep 27, 2018 at 23:31 | comment | added | David G. Stork | As background personal history: I spent one week writing software for this in Mathematica in 1999 for a single figure in my book Pattern classification (2nd ed.), which, as far as I know, is the first book to contain such an exact three-dimensional Voronoi tessellation. (Alas, I cannot find that code right now.) | |
| Sep 27, 2018 at 23:20 | review | First posts | |||
| Sep 28, 2018 at 3:15 | |||||
| Sep 27, 2018 at 23:15 | history | asked | Leonardo Sacht | CC BY-SA 4.0 |