Page MenuHomec4science
Files F93728083

cell_8cc_source.html
No OneTemporary
Actions

File Metadata

Created
Sun, Dec 1, 00:46

cell_8cc_source.html
View Options

This file is larger than 256 KB, so syntax highlighting was skipped.
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Voro++: cell.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Voro++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main&#160;Page</span></a></li>
<li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File&#160;List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">cell.cc</div> </div>
</div><!--header-->
<div class="contents">
<a href="cell_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Voro++, a 3D cell-based Voronoi library</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">// Author : Chris H. Rycroft (LBL / UC Berkeley)</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">// Email : chr@alum.mit.edu</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment">// Date : August 30th 2011</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment">/** \file cell.cc</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment"> * \brief Function implementations for the voronoicell and related classes. */</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;</div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="preprocessor">#include &lt;cstring&gt;</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;</div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="config_8hh.html" title="Master configuration file for setting various compile-time options.">config.hh</a>&quot;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="common_8hh.html" title="Header file for the small helper functions.">common.hh</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cell_8hh.html" title="Header file for the voronoicell and related classes.">cell.hh</a>&quot;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="keyword">namespace </span>voro {</div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">/** Constructs a Voronoi cell and sets up the initial memory. */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a83d13bf519c98bf0ea5804763ffc967d"> 20</a></span>&#160;<a class="code" href="classvoro_1_1voronoicell__base.html#a83d13bf519c98bf0ea5804763ffc967d">voronoicell_base::voronoicell_base</a>() :</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; current_vertices(init_vertices), current_vertex_order(init_vertex_order),</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; current_delete_size(init_delete_size), current_delete2_size(init_delete2_size),</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; ed(new int*[current_vertices]), nu(new int[current_vertices]),</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; pts(new double[3*current_vertices]), mem(new int[current_vertex_order]),</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; mec(new int[current_vertex_order]), mep(new int*[current_vertex_order]),</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; ds(new int[current_delete_size]), stacke(ds+current_delete_size),</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; ds2(new int[current_delete2_size]), stacke2(ds2+current_delete_size),</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; current_marginal(init_marginal), marg(new int[current_marginal]) {</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; <span class="keywordtype">int</span> i;</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;3;i++) {</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]=init_n_vertices;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=0;</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_n_vertices*((i&lt;&lt;1)+1)];</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; }</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[3]=init_3_vertices;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]=0;</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[3]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_3_vertices*7];</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordflow">for</span>(i=4;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) {</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]=init_n_vertices;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=0;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_n_vertices*((i&lt;&lt;1)+1)];</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; }</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;}</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;<span class="comment">/** The voronoicell destructor deallocates all the dynamic memory. */</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ac959634a1ae2e3201e96624f44e7e71e"> 43</a></span>&#160;<a class="code" href="classvoro_1_1voronoicell__base.html#ac959634a1ae2e3201e96624f44e7e71e">voronoicell_base::~voronoicell_base</a>() {</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>-1;i&gt;=0;i--) <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]&gt;0) <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i];</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keyword">delete</span> [] marg;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keyword">delete</span> [] ds2;<span class="keyword">delete</span> [] ds;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>;<span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>;<span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>;<span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;}</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160;<span class="comment">/** Ensures that enough memory is allocated prior to carrying out a copy.</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160;<span class="comment"> * \param[in] vc a reference to the specialized version of the calling class.</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160;<span class="comment"> * \param[in] vb a pointered to the class to be copied. */</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00056"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b"> 56</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b">voronoicell_base::check_memory_for_copy</a>(vc_class &amp;vc,<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>* vb) {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">while</span>(current_vertex_order&lt;vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>) add_memory_vorder(vc);</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) <span class="keywordflow">while</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]&lt;vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]) add_memory(vc,i,ds2);</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">while</span>(current_vertices&lt;vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) add_memory_vertices(vc);</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;}</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="comment">/** Copies the vertex and edge information from another class. The routine</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160;<span class="comment"> * assumes that enough memory is available for the copy.</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;<span class="comment"> * \param[in] vb a pointer to the class to copy. */</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a47d450e9b9be0fab103f401ddcaeefac"> 65</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a47d450e9b9be0fab103f401ddcaeefac">voronoicell_base::copy</a>(<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>* vb) {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordtype">int</span> i,j;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>=vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>=0;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) {</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i];</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]*(2*i+1);j++) <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][j]=vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][j];</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]*(2*i+1);j+=2*i+1) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][j+2*i]]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]+j;</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[i]=vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[i];</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;3*p;i++) <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[i]=vb-&gt;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[i];</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;}</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;<span class="comment">/** Copies the information from another voronoicell class into this</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;<span class="comment"> * class, extending memory allocation if necessary.</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"> * \param[in] c the class to copy. */</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#ac6036ae44845e301da1e3656e0e98403"> 80</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#ac6036ae44845e301da1e3656e0e98403">voronoicell_neighbor::operator=</a>(<a class="code" href="classvoro_1_1voronoicell.html" title="Extension of the voronoicell_base class to represent a Voronoi cell without neighbor information...">voronoicell</a> &amp;c) {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a> *vb=((<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>*) &amp;c);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b">check_memory_for_copy</a>(*<span class="keyword">this</span>,vb);<a class="code" href="classvoro_1_1voronoicell__base.html#a47d450e9b9be0fab103f401ddcaeefac">copy</a>(vb);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordtype">int</span> i,j;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) {</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]*i;j++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i][j]=0;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i];j++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[c.<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][(2*i+1)*j+2*i]]=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i]+(j*i);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;}</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160;<span class="comment">/** Copies the information from another voronoicell_neighbor class into this</span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;<span class="comment"> * class, extending memory allocation if necessary.</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160;<span class="comment"> * \param[in] c the class to copy. */</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a0754fe4a44916b68bf3cda3d129b3a69"> 93</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#ac6036ae44845e301da1e3656e0e98403">voronoicell_neighbor::operator=</a>(<a class="code" href="classvoro_1_1voronoicell__neighbor.html" title="Extension of the voronoicell_base class to represent a Voronoi cell with neighbor information...">voronoicell_neighbor</a> &amp;c) {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a> *vb=((<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>*) &amp;c);</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b">check_memory_for_copy</a>(*<span class="keyword">this</span>,vb);<a class="code" href="classvoro_1_1voronoicell__base.html#a47d450e9b9be0fab103f401ddcaeefac">copy</a>(vb);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="keywordtype">int</span> i,j;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) {</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]*i;j++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i][j]=c.<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i][j];</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;c.<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i];j++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[c.<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][(2*i+1)*j+2*i]]=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i]+(j*i);</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; }</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160;}</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160;<span class="comment">/** Translates the vertices of the Voronoi cell by a given vector.</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160;<span class="comment"> * \param[in] (x,y,z) the coordinates of the vector. */</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ab2c8534b380907975eb60f3441d50e1e"> 105</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#ab2c8534b380907975eb60f3441d50e1e">voronoicell_base::translate</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z) {</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; x*=2;y*=2;z*=2;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keywordflow">while</span>(ptsp&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>+3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) {</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; *(ptsp++)=x;*(ptsp++)=y;*(ptsp++)=z;</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; }</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160;}</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160;<span class="comment">/** Increases the memory storage for a particular vertex order, by increasing</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;<span class="comment"> * the size of the of the corresponding mep array. If the arrays already exist,</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160;<span class="comment"> * their size is doubled; if they don&#39;t exist, then new ones of size</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160;<span class="comment"> * init_n_vertices are allocated. The routine also ensures that the pointers in</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160;<span class="comment"> * the ed array are updated, by making use of the back pointers. For the cases</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160;<span class="comment"> * where the back pointer has been temporarily overwritten in the marginal</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160;<span class="comment"> * vertex code, the auxiliary delete stack is scanned to find out how to update</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160;<span class="comment"> * the ed value. If the template has been instantiated with the neighbor</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160;<span class="comment"> * tracking turned on, then the routine also reallocates the corresponding mne</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;<span class="comment"> * array.</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160;<span class="comment"> * \param[in] i the order of the vertex memory to be increased. */</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="keywordtype">void</span> voronoicell_base::add_memory(vc_class &amp;vc,<span class="keywordtype">int</span> i,<span class="keywordtype">int</span> *stackp2) {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="keywordtype">int</span> s=(i&lt;&lt;1)+1;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]==0) {</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; vc.n_allocate(i,init_n_vertices);</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_n_vertices*s];</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]=init_n_vertices;</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Order %d vertex memory created\n&quot;</span>,i);</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160;<span class="preprocessor"></span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordtype">int</span> j=0,k,*l;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]&lt;&lt;=1;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]&gt;max_n_vertices) voro_fatal_error(<span class="stringliteral">&quot;Point memory allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Order %d vertex memory scaled up to %d\n&quot;</span>,i,<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]);</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160;<span class="preprocessor"></span> l=<span class="keyword">new</span> <span class="keywordtype">int</span>[s*<a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>[i]];</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keywordtype">int</span> m=0;</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; vc.n_allocate_aux1(i);</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <span class="keywordflow">while</span>(j&lt;s*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]) {</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][j+(i&lt;&lt;1)];</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k]=l+j;</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; vc.n_set_to_aux1_offset(k,m);</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="keywordtype">int</span> *dsp;</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordflow">for</span>(dsp=ds2;dsp&lt;stackp2;dsp++) {</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[*dsp]==<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]+j) {</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[*dsp]=l+j;</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; vc.n_set_to_aux1_offset(*dsp,m);</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; }</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; }</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; <span class="keywordflow">if</span>(dsp==stackp2) voro_fatal_error(<span class="stringliteral">&quot;Couldn&#39;t relocate dangling pointer&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=3</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160;<span class="preprocessor"></span> fputs(<span class="stringliteral">&quot;Relocated dangling pointer&quot;</span>,stderr);</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160;<span class="preprocessor"></span> }</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="keywordflow">for</span>(k=0;k&lt;s;k++,j++) l[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i][j];</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keywordflow">for</span>(k=0;k&lt;i;k++,m++) vc.n_copy_to_aux1(i,m);</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; }</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i];</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]=l;</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; vc.n_switch_to_aux1(i);</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160;}</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160;<span class="comment">/** Doubles the maximum number of vertices allowed, by reallocating the ed, nu,</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160;<span class="comment"> * and pts arrays. If the allocation exceeds the absolute maximum set in</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160;<span class="comment"> * max_vertices, then the routine exits with a fatal error. If the template has</span></div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160;<span class="comment"> * been instantiated with the neighbor tracking turned on, then the routine</span></div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160;<span class="comment"> * also reallocates the ne array. */</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160;<span class="keywordtype">void</span> voronoicell_base::add_memory_vertices(vc_class &amp;vc) {</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <span class="keywordtype">int</span> i=(<a class="code" href="classvoro_1_1voronoicell__base.html#ab0b624e4e72fca14c99bf1c41c430614">current_vertices</a>&lt;&lt;1),j,**pp,*pnu;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="keywordflow">if</span>(i&gt;max_vertices) voro_fatal_error(<span class="stringliteral">&quot;Vertex memory allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Vertex memory scaled up to %d\n&quot;</span>,i);</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160;<span class="preprocessor"></span> <span class="keywordtype">double</span> *ppts;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; pp=<span class="keyword">new</span> <span class="keywordtype">int</span>*[i];</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#ab0b624e4e72fca14c99bf1c41c430614">current_vertices</a>;j++) pp[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j];</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>=pp;</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; vc.n_add_memory_vertices(i);</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; pnu=<span class="keyword">new</span> <span class="keywordtype">int</span>[i];</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#ab0b624e4e72fca14c99bf1c41c430614">current_vertices</a>;j++) pnu[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[j];</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>=pnu;</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; ppts=<span class="keyword">new</span> <span class="keywordtype">double</span>[3*i];</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;3*<a class="code" href="classvoro_1_1voronoicell__base.html#ab0b624e4e72fca14c99bf1c41c430614">current_vertices</a>;j++) ppts[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[j];</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>=ppts;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; current_vertices=i;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160;}</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160;<span class="comment">/** Doubles the maximum allowed vertex order, by reallocating mem, mep, and mec</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160;<span class="comment"> * arrays. If the allocation exceeds the absolute maximum set in</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160;<span class="comment"> * max_vertex_order, then the routine causes a fatal error. If the template has</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;<span class="comment"> * been instantiated with the neighbor tracking turned on, then the routine</span></div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160;<span class="comment"> * also reallocates the mne array. */</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160;<span class="keywordtype">void</span> voronoicell_base::add_memory_vorder(vc_class &amp;vc) {</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keywordtype">int</span> i=(<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>&lt;&lt;1),j,*p1,**p2;</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="keywordflow">if</span>(i&gt;max_vertex_order) voro_fatal_error(<span class="stringliteral">&quot;Vertex order memory allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Vertex order memory scaled up to %d\n&quot;</span>,i);</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160;<span class="preprocessor"></span> p1=<span class="keyword">new</span> <span class="keywordtype">int</span>[i];</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;j++) p1[j]=mem[j];<span class="keywordflow">while</span>(j&lt;i) p1[j++]=0;</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#aafad86ca11af64de2788637b466479f6">mem</a>;mem=p1;</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; p2=<span class="keyword">new</span> <span class="keywordtype">int</span>*[i];</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;j++) p2[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[j];</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>=p2;</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; p1=<span class="keyword">new</span> <span class="keywordtype">int</span>[i];</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;j++) p1[j]=<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[j];<span class="keywordflow">while</span>(j&lt;i) p1[j++]=0;</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>=p1;</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; vc.n_add_memory_vorder(i);</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; current_vertex_order=i;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160;}</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160;<span class="comment">/** Doubles the size allocation of the main delete stack. If the allocation</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160;<span class="comment"> * exceeds the absolute maximum set in max_delete_size, then routine causes a</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160;<span class="comment"> * fatal error. */</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160;<span class="keywordtype">void</span> voronoicell_base::add_memory_ds(<span class="keywordtype">int</span> *&amp;stackp) {</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a7dbec3b0b6ea24e22e651cf76f06dc04">current_delete_size</a>&lt;&lt;=1;</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7dbec3b0b6ea24e22e651cf76f06dc04">current_delete_size</a>&gt;max_delete_size) voro_fatal_error(<span class="stringliteral">&quot;Delete stack 1 memory allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Delete stack 1 memory scaled up to %d\n&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a7dbec3b0b6ea24e22e651cf76f06dc04">current_delete_size</a>);</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160;<span class="preprocessor"></span> <span class="keywordtype">int</span> *dsn=<span class="keyword">new</span> <span class="keywordtype">int</span>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7dbec3b0b6ea24e22e651cf76f06dc04">current_delete_size</a>],*dsnp=dsn,*dsp=ds;</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <span class="keywordflow">while</span>(dsp&lt;stackp) *(dsnp++)=*(dsp++);</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keyword">delete</span> [] ds;ds=dsn;stackp=dsnp;</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; stacke=ds+<a class="code" href="classvoro_1_1voronoicell__base.html#a7dbec3b0b6ea24e22e651cf76f06dc04">current_delete_size</a>;</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160;}</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160;<span class="comment">/** Doubles the size allocation of the auxiliary delete stack. If the</span></div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160;<span class="comment"> * allocation exceeds the absolute maximum set in max_delete2_size, then the</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160;<span class="comment"> * routine causes a fatal error. */</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160;<span class="keywordtype">void</span> voronoicell_base::add_memory_ds2(<span class="keywordtype">int</span> *&amp;stackp2) {</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a2a238c710c2e91045ef9deae0faf8dc9">current_delete2_size</a>&lt;&lt;=1;</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a2a238c710c2e91045ef9deae0faf8dc9">current_delete2_size</a>&gt;max_delete2_size) voro_fatal_error(<span class="stringliteral">&quot;Delete stack 2 memory allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Delete stack 2 memory scaled up to %d\n&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a2a238c710c2e91045ef9deae0faf8dc9">current_delete2_size</a>);</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;<span class="preprocessor"></span> <span class="keywordtype">int</span> *dsn=<span class="keyword">new</span> <span class="keywordtype">int</span>[<a class="code" href="classvoro_1_1voronoicell__base.html#a2a238c710c2e91045ef9deae0faf8dc9">current_delete2_size</a>],*dsnp=dsn,*dsp=ds2;</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <span class="keywordflow">while</span>(dsp&lt;stackp2) *(dsnp++)=*(dsp++);</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="keyword">delete</span> [] ds2;ds2=dsn;stackp2=dsnp;</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; stacke2=ds2+<a class="code" href="classvoro_1_1voronoicell__base.html#a2a238c710c2e91045ef9deae0faf8dc9">current_delete2_size</a>;</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;}</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160;<span class="comment">/** Initializes a Voronoi cell as a rectangular box with the given dimensions.</span></div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160;<span class="comment"> * \param[in] (xmin,xmax) the minimum and maximum x coordinates.</span></div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160;<span class="comment"> * \param[in] (ymin,ymax) the minimum and maximum y coordinates.</span></div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160;<span class="comment"> * \param[in] (zmin,zmax) the minimum and maximum z coordinates. */</span></div>
<div class="line"><a name="l00257"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a4c7f5406ba3beb1aa0d047592316c68d"> 257</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a4c7f5406ba3beb1aa0d047592316c68d">voronoicell_base::init_base</a>(<span class="keywordtype">double</span> xmin,<span class="keywordtype">double</span> xmax,<span class="keywordtype">double</span> ymin,<span class="keywordtype">double</span> ymax,<span class="keywordtype">double</span> zmin,<span class="keywordtype">double</span> zmax) {</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>=0;</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>=8;xmin*=2;xmax*=2;ymin*=2;ymax*=2;zmin*=2;zmax*=2;</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>=xmin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1]=ymin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2]=zmin;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3]=xmax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[4]=ymin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[5]=zmin;</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[6]=xmin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[7]=ymax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[8]=zmin;</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[9]=xmax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[10]=ymax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[11]=zmin;</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[12]=xmin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[13]=ymin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[14]=zmax;</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[15]=xmax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[16]=ymin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[17]=zmax;</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[18]=xmin;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[19]=ymax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[20]=zmax;</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[21]=xmax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[22]=ymax;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[23]=zmax;</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[3];</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; *q=1;q[1]=4;q[2]=2;q[3]=2;q[4]=1;q[5]=0;q[6]=0;</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; q[7]=3;q[8]=5;q[9]=0;q[10]=2;q[11]=1;q[12]=0;q[13]=1;</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; q[14]=0;q[15]=6;q[16]=3;q[17]=2;q[18]=1;q[19]=0;q[20]=2;</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; q[21]=2;q[22]=7;q[23]=1;q[24]=2;q[25]=1;q[26]=0;q[27]=3;</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; q[28]=6;q[29]=0;q[30]=5;q[31]=2;q[32]=1;q[33]=0;q[34]=4;</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; q[35]=4;q[36]=1;q[37]=7;q[38]=2;q[39]=1;q[40]=0;q[41]=5;</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; q[42]=7;q[43]=2;q[44]=4;q[45]=2;q[46]=1;q[47]=0;q[48]=6;</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; q[49]=5;q[50]=3;q[51]=6;q[52]=2;q[53]=1;q[54]=0;q[55]=7;</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>=q;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[1]=q+7;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[2]=q+14;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[3]=q+21;</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[4]=q+28;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[5]=q+35;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[6]=q+42;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[7]=q+49;</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[1]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[2]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[3]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[4]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[5]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[6]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[7]=3;</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160;}</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160;<span class="comment">/** Initializes a Voronoi cell as a regular octahedron.</span></div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160;<span class="comment"> * \param[in] l The distance from the octahedron center to a vertex. Six</span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160;<span class="comment"> * vertices are initialized at (-l,0,0), (l,0,0), (0,-l,0),</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160;<span class="comment"> * (0,l,0), (0,0,-l), and (0,0,l). */</span></div>
<div class="line"><a name="l00286"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#aab954caa57c67a26c03b0377f5778bb1"> 286</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#aab954caa57c67a26c03b0377f5778bb1">voronoicell_base::init_octahedron_base</a>(<span class="keywordtype">double</span> l) {</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>=0;</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[4]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>=6;l*=2;</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>=-l;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2]=0;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3]=l;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[4]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[5]=0;</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[6]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[7]=-l;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[8]=0;</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[9]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[10]=l;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[11]=0;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[12]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[13]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[14]=-l;</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[15]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[16]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[17]=l;</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[4];</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; *q=2;q[1]=5;q[2]=3;q[3]=4;q[4]=0;q[5]=0;q[6]=0;q[7]=0;q[8]=0;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; q[9]=2;q[10]=4;q[11]=3;q[12]=5;q[13]=2;q[14]=2;q[15]=2;q[16]=2;q[17]=1;</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; q[18]=0;q[19]=4;q[20]=1;q[21]=5;q[22]=0;q[23]=3;q[24]=0;q[25]=1;q[26]=2;</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; q[27]=0;q[28]=5;q[29]=1;q[30]=4;q[31]=2;q[32]=3;q[33]=2;q[34]=1;q[35]=3;</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; q[36]=0;q[37]=3;q[38]=1;q[39]=2;q[40]=3;q[41]=3;q[42]=1;q[43]=1;q[44]=4;</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160; q[45]=0;q[46]=2;q[47]=1;q[48]=3;q[49]=1;q[50]=3;q[51]=3;q[52]=1;q[53]=5;</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>=q;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[1]=q+9;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[2]=q+18;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[3]=q+27;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[4]=q+36;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[5]=q+45;</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[1]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[2]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[3]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[4]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[5]=4;</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160;}</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160;<span class="comment">/** Initializes a Voronoi cell as a tetrahedron. It assumes that the normal to</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160;<span class="comment"> * the face for the first three vertices points inside.</span></div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160;<span class="comment"> * \param (x0,y0,z0) a position vector for the first vertex.</span></div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160;<span class="comment"> * \param (x1,y1,z1) a position vector for the second vertex.</span></div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160;<span class="comment"> * \param (x2,y2,z2) a position vector for the third vertex.</span></div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160;<span class="comment"> * \param (x3,y3,z3) a position vector for the fourth vertex. */</span></div>
<div class="line"><a name="l00312"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ae71280e1c36c5f840f870d55e91c027b"> 312</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#ae71280e1c36c5f840f870d55e91c027b">voronoicell_base::init_tetrahedron_base</a>(<span class="keywordtype">double</span> x0,<span class="keywordtype">double</span> y0,<span class="keywordtype">double</span> z0,<span class="keywordtype">double</span> x1,<span class="keywordtype">double</span> y1,<span class="keywordtype">double</span> z1,<span class="keywordtype">double</span> x2,<span class="keywordtype">double</span> y2,<span class="keywordtype">double</span> z2,<span class="keywordtype">double</span> x3,<span class="keywordtype">double</span> y3,<span class="keywordtype">double</span> z3) {</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]=0;<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>=0;</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>=4;</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>=x0*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1]=y0*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2]=z0*2;</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3]=x1*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[4]=y1*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[5]=z1*2;</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[6]=x2*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[7]=y2*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[8]=z2*2;</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[9]=x3*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[10]=y3*2;<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[11]=z3*2;</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[3];</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; *q=1;q[1]=3;q[2]=2;q[3]=0;q[4]=0;q[5]=0;q[6]=0;</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; q[7]=0;q[8]=2;q[9]=3;q[10]=0;q[11]=2;q[12]=1;q[13]=1;</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; q[14]=0;q[15]=3;q[16]=1;q[17]=2;q[18]=2;q[19]=1;q[20]=2;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; q[21]=0;q[22]=1;q[23]=2;q[24]=1;q[25]=2;q[26]=1;q[27]=3;</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>=q;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[1]=q+7;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[2]=q+14;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[3]=q+21;</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[1]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[2]=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[3]=3;</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160;}</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160;<span class="comment">/** Checks that the relational table of the Voronoi cell is accurate, and</span></div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160;<span class="comment"> * prints out any errors. This algorithm is O(p), so running it every time the</span></div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160;<span class="comment"> * plane routine is called will result in a significant slowdown. */</span></div>
<div class="line"><a name="l00331"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ae7bb21f644a45946001beef598a1da1f"> 331</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#ae7bb21f644a45946001beef598a1da1f">voronoicell_base::check_relations</a>() {</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; <span class="keywordtype">int</span> i,j;</div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[i];j++) <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]][<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j]]!=i)</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160; printf(<span class="stringliteral">&quot;Relational error at point %d, edge %d.\n&quot;</span>,i,j);</div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160;}</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160;<span class="comment">/** This routine checks for any two vertices that are connected by more than</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160;<span class="comment"> * one edge. The plane algorithm is designed so that this should not happen, so</span></div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>&#160;<span class="comment"> * any occurrences are most likely errors. Note that the routine is O(p), so</span></div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>&#160;<span class="comment"> * running it every time the plane routine is called will result in a</span></div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>&#160;<span class="comment"> * significant slowdown. */</span></div>
<div class="line"><a name="l00342"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a3f6c0b98feb914c324248cd3d3baf43d"> 342</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a3f6c0b98feb914c324248cd3d3baf43d">voronoicell_base::check_duplicates</a>() {</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>&#160; <span class="keywordtype">int</span> i,j,k;</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=1;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[i];j++) <span class="keywordflow">for</span>(k=0;k&lt;j;k++) <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]==<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][k])</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; printf(<span class="stringliteral">&quot;Duplicate edges: (%d,%d) and (%d,%d) [%d]\n&quot;</span>,i,j,i,k,<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]);</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160;}</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160;<span class="comment">/** Constructs the relational table if the edges have been specified. */</span></div>
<div class="line"><a name="l00349"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af49d85cd2a3daf84d623ab09ab7037cf"> 349</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af49d85cd2a3daf84d623ab09ab7037cf">voronoicell_base::construct_relations</a>() {</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; <span class="keywordtype">int</span> i,j,k,l;</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[i];j++) {</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160; l=0;</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160; <span class="keywordflow">while</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]!=i) {</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; l++;</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; <span class="keywordflow">if</span>(l==nu[k]) voro_fatal_error(<span class="stringliteral">&quot;Relation table construction failed&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160; }</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j]=l;</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; }</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160;}</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160;<span class="comment">/** Starting from a point within the current cutting plane, this routine attempts</span></div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160;<span class="comment"> * to find an edge to a point outside the cutting plane. This prevents the plane</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160;<span class="comment"> * routine from .</span></div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160;<span class="comment"> * \param[in] vc a reference to the specialized version of the calling class.</span></div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160;<span class="comment"> * \param[in,out] up */</span></div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::search_for_outside_edge(vc_class &amp;vc,<span class="keywordtype">int</span> &amp;up) {</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; <span class="keywordtype">int</span> i,lp,lw,*j(ds2),*stackp2(ds2);</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; <span class="keywordtype">double</span> l;</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; *(stackp2++)=up;</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; <span class="keywordflow">while</span>(j&lt;stackp2) {</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; up=*(j++);</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];i++) {</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; <span class="keywordflow">if</span>(lw==-1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(lw==0) add_to_stack(vc,lp,stackp2);</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; }</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160; }</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160;}</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160;<span class="comment">/** Adds a point to the auxiliary delete stack if it is not already there.</span></div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>&#160;<span class="comment"> * \param[in] vc a reference to the specialized version of the calling class.</span></div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>&#160;<span class="comment"> * \param[in] lp the index of the point to add.</span></div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160;<span class="comment"> * \param[in,out] stackp2 a pointer to the end of the stack entries. */</span></div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> voronoicell_base::add_to_stack(vc_class &amp;vc,<span class="keywordtype">int</span> lp,<span class="keywordtype">int</span> *&amp;stackp2) {</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> *k(ds2);k&lt;stackp2;k++) <span class="keywordflow">if</span>(*k==lp) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>&#160; <span class="keywordflow">if</span>(stackp2==stacke2) add_memory_ds2(stackp2);</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160; *(stackp2++)=lp;</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160;}</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160;<span class="comment">/** Cuts the Voronoi cell by a particle whose center is at a separation of</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160;<span class="comment"> * (x,y,z) from the cell center. The value of rsq should be initially set to</span></div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160;<span class="comment"> * \f$x^2+y^2+z^2\f$.</span></div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160;<span class="comment"> * \param[in] vc a reference to the specialized version of the calling class.</span></div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160;<span class="comment"> * \param[in] (x,y,z) the normal vector to the plane.</span></div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160;<span class="comment"> * \param[in] rsq the distance along this vector of the plane.</span></div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160;<span class="comment"> * \param[in] p_id the plane ID (for neighbor tracking only).</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160;<span class="comment"> * \return False if the plane cut deleted the cell entirely, true otherwise. */</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00404"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a33184cd45a3090291a080c4aff08a2fd"> 404</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a33184cd45a3090291a080c4aff08a2fd">voronoicell_base::nplane</a>(vc_class &amp;vc,<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">double</span> rsq,<span class="keywordtype">int</span> p_id) {</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; <span class="keywordtype">int</span> count=0,i,j,k,lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>,cp,qp,rp,*stackp(ds),*stackp2(ds2),*dsp;</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; <span class="keywordtype">int</span> us=0,ls=0,qs,iqs,cs,uw,qw,lw;</div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; <span class="keywordtype">int</span> *edp,*edd;</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; <span class="keywordtype">double</span> u,l,r,q;<span class="keywordtype">bool</span> complicated_setup=<span class="keyword">false</span>,new_double_edge=<span class="keyword">false</span>,double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160;</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; <span class="comment">// Initialize the safe testing routine</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160; n_marg=0;px=x;py=y;pz=z;prsq=rsq;</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160;</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160; <span class="comment">// Test approximately sqrt(n)/4 points for their proximity to the plane</span></div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; <span class="comment">// and keep the one which is closest</span></div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; uw=m_test(up,u);</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160;</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; <span class="comment">// Starting from an initial guess, we now move from vertex to vertex,</span></div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; <span class="comment">// to try and find an edge which intersects the cutting plane,</span></div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; <span class="comment">// or a vertex which is on the plane</span></div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; <span class="keywordflow">try</span> {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; <span class="keywordflow">if</span>(uw==1) {</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160;</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; <span class="comment">// The test point is inside the cutting plane.</span></div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; us=0;</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; <span class="keywordflow">if</span>(l&lt;u) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160; us++;</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160; } <span class="keywordflow">while</span> (us&lt;nu[up]);</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160;</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160; <span class="keywordflow">if</span>(us==nu[up]) {</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160; }</div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160;</div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160; <span class="keywordflow">while</span>(lw==1) {</div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160; <span class="keywordflow">if</span>(++count&gt;=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) <span class="keywordflow">throw</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160; u=l;up=lp;</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160; <span class="keywordflow">for</span>(us=0;us&lt;ls;us++) {</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; <span class="keywordflow">if</span>(l&lt;u) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; }</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160; <span class="keywordflow">if</span>(us==ls) {</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; us++;</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; <span class="keywordflow">while</span>(us&lt;nu[up]) {</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160; <span class="keywordflow">if</span>(l&lt;u) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160; us++;</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; }</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160; <span class="keywordflow">if</span>(us==nu[up]) {</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160; }</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160; }</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160; }</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160;</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160; <span class="comment">// If the last point in the iteration is within the</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160; <span class="comment">// plane, we need to do the complicated setup</span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160; <span class="comment">// routine. Otherwise, we use the regular iteration.</span></div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160; <span class="keywordflow">if</span>(lw==0) {</div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>&#160; up=lp;</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160; } <span class="keywordflow">else</span> complicated_setup=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(uw==-1) {</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160; us=0;</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160; qw=m_test(qp,q);</div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160; <span class="keywordflow">if</span>(u&lt;q) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160; us++;</div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160; } <span class="keywordflow">while</span> (us&lt;nu[up]);</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160; <span class="keywordflow">if</span>(us==nu[up]) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>&#160;</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160; <span class="keywordflow">while</span>(qw==-1) {</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160; <span class="keywordflow">if</span>(++count&gt;=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) <span class="keywordflow">throw</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160; u=q;up=qp;</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160; <span class="keywordflow">for</span>(us=0;us&lt;qs;us++) {</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160; qw=m_test(qp,q);</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160; <span class="keywordflow">if</span>(u&lt;q) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160; }</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160; <span class="keywordflow">if</span>(us==qs) {</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160; us++;</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160; <span class="keywordflow">while</span>(us&lt;nu[up]) {</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160; qw=m_test(qp,q);</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160; <span class="keywordflow">if</span>(u&lt;q) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160; us++;</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160; }</div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160; <span class="keywordflow">if</span>(us==nu[up]) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160; }</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160; }</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160; <span class="keywordflow">if</span>(qw==1) {</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>;ls=us;l=u;</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; up=qp;us=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]+ls];u=q;</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; complicated_setup=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; up=qp;</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; }</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160;</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; <span class="comment">// Our original test point was on the plane, so we</span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; <span class="comment">// automatically head for the complicated setup</span></div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160; <span class="comment">// routine</span></div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; }</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; }</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; <span class="keywordflow">catch</span>(<span class="keywordtype">bool</span> except) {</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; <span class="comment">// This routine is a fall-back, in case floating point errors</span></div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160; <span class="comment">// cause the usual search routine to fail. In the fall-back</span></div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; <span class="comment">// routine, we just test every edge to find one straddling</span></div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160; <span class="comment">// the plane.</span></div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=1</span></div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>&#160;<span class="preprocessor"></span> fputs(<span class="stringliteral">&quot;Bailed out of convex calculation\n&quot;</span>,stderr);</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>&#160;<span class="preprocessor"></span> qw=1;lw=0;</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>&#160; <span class="keywordflow">for</span>(qp=0;qp&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;qp++) {</div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>&#160; qw=m_test(qp,q);</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>&#160; <span class="keywordflow">if</span>(qw==1) {</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>&#160;</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>&#160; <span class="comment">// The point is inside the cutting space. Now</span></div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>&#160; <span class="comment">// see if we can find a neighbor which isn&#39;t.</span></div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>&#160; <span class="keywordflow">for</span>(us=0;us&lt;nu[qp];us++) {</div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][us];</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>&#160; <span class="keywordflow">if</span>(lp&lt;qp) {</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>&#160; <span class="keywordflow">if</span>(lw!=1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>&#160; }</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>&#160; }</div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>&#160; <span class="keywordflow">if</span>(us&lt;nu[qp]) {</div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>&#160; up=qp;</div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>&#160; <span class="keywordflow">if</span>(lw==0) {</div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>&#160; complicated_setup=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>&#160; u=q;</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>&#160; }</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>&#160; }</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(qw==-1) {</div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>&#160;</div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>&#160; <span class="comment">// The point is outside the cutting space. See</span></div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>&#160; <span class="comment">// if we can find a neighbor which isn&#39;t.</span></div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>&#160; <span class="keywordflow">for</span>(ls=0;ls&lt;nu[qp];ls++) {</div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>&#160; up=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][ls];</div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>&#160; <span class="keywordflow">if</span>(up&lt;qp) {</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>&#160; uw=m_test(up,u);</div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>&#160; <span class="keywordflow">if</span>(uw!=-1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>&#160; }</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>&#160; }</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>&#160; <span class="keywordflow">if</span>(ls&lt;nu[qp]) {</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>&#160; <span class="keywordflow">if</span>(uw==0) {</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>&#160; up=qp;</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>&#160; complicated_setup=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>&#160; lp=qp;l=q;</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>&#160; us=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]+ls];</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>&#160; }</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>&#160; }</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>&#160;</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>&#160; <span class="comment">// The point is in the plane, so we just</span></div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>&#160; <span class="comment">// proceed with the complicated setup routine</span></div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>&#160; up=qp;</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>&#160; complicated_setup=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>&#160; }</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>&#160; }</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>&#160; <span class="keywordflow">if</span>(qp==p) <span class="keywordflow">return</span> qw==-1?<span class="keyword">true</span>:<span class="keyword">false</span>;</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>&#160; }</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>&#160;</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>&#160; <span class="comment">// We&#39;re about to add the first point of the new facet. In either</span></div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>&#160; <span class="comment">// routine, we have to add a point, so first check there&#39;s space for</span></div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>&#160; <span class="comment">// it.</span></div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>==current_vertices) add_memory_vertices(vc);</div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>&#160;</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>&#160; <span class="keywordflow">if</span>(complicated_setup) {</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>&#160;</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>&#160; <span class="comment">// We want to be strict about reaching the conclusion that the</span></div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>&#160; <span class="comment">// cell is entirely within the cutting plane. It&#39;s not enough</span></div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>&#160; <span class="comment">// to find a vertex that has edges which are all inside or on</span></div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>&#160; <span class="comment">// the plane. If the vertex has neighbors that are also on the</span></div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>&#160; <span class="comment">// plane, we should check those too.</span></div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>&#160; <span class="keywordflow">if</span>(!search_for_outside_edge(vc,up)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>&#160;</div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>&#160; <span class="comment">// The search algorithm found a point which is on the cutting</span></div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>&#160; <span class="comment">// plane. We leave that point in place, and create a new one at</span></div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>&#160; <span class="comment">// the same location.</span></div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+1];</div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+2];</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>&#160;</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>&#160; <span class="comment">// Search for a collection of edges of the test vertex which</span></div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>&#160; <span class="comment">// are outside of the cutting space. Begin by testing the</span></div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>&#160; <span class="comment">// zeroth edge.</span></div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>&#160; i=0;</div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>&#160; lp=*<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>&#160; <span class="keywordflow">if</span>(lw!=-1) {</div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>&#160;</div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>&#160; <span class="comment">// The first edge is either inside the cutting space,</span></div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>&#160; <span class="comment">// or lies within the cutting plane. Test the edges</span></div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>&#160; <span class="comment">// sequentially until we find one that is outside.</span></div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>&#160; rp=lw;</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>&#160; i++;</div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>&#160;</div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>&#160; <span class="comment">// If we reached the last edge with no luck</span></div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>&#160; <span class="comment">// then all of the vertices are inside</span></div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>&#160; <span class="comment">// or on the plane, so the cell is completely</span></div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>&#160; <span class="comment">// deleted</span></div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>&#160; <span class="keywordflow">if</span>(i==nu[up]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>&#160; } <span class="keywordflow">while</span> (lw!=-1);</div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>&#160; j=i+1;</div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>&#160;</div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>&#160; <span class="comment">// We found an edge outside the cutting space. Keep</span></div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>&#160; <span class="comment">// moving through these edges until we find one that&#39;s</span></div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>&#160; <span class="comment">// inside or on the plane.</span></div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>&#160; <span class="keywordflow">while</span>(j&lt;nu[up]) {</div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][j];</div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>&#160; <span class="keywordflow">if</span>(lw!=-1) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>&#160; j++;</div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>&#160; }</div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>&#160;</div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>&#160; <span class="comment">// Compute the number of edges for the new vertex. In</span></div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>&#160; <span class="comment">// general it will be the number of outside edges</span></div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>&#160; <span class="comment">// found, plus two. But we need to recognize the</span></div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>&#160; <span class="comment">// special case when all but one edge is outside, and</span></div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>&#160; <span class="comment">// the remaining one is on the plane. For that case we</span></div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>&#160; <span class="comment">// have to reduce the edge count by one to prevent</span></div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>&#160; <span class="comment">// doubling up.</span></div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>&#160; <span class="keywordflow">if</span>(j==nu[up]&amp;&amp;i==1&amp;&amp;rp==0) {</div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>&#160; double_edge=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>&#160; } <span class="keywordflow">else</span> nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=j-i+2;</div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>&#160; k=1;</div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>&#160;</div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>&#160; <span class="comment">// Add memory for the new vertex if needed, and</span></div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>&#160; <span class="comment">// initialize</span></div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>&#160; <span class="keywordflow">while</span> (nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&gt;=current_vertex_order) add_memory_vorder(vc);</div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]==mem[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]) add_memory(vc,nu[p],stackp2);</div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>&#160; vc.n_set_pointer(p,nu[p]);</div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]+((nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&lt;&lt;1)+1)*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]++;</div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&lt;&lt;1]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>&#160;</div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>&#160; <span class="comment">// Copy the edges of the original vertex into the new</span></div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>&#160; <span class="comment">// one. Delete the edges of the original vertex, and</span></div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>&#160; <span class="comment">// update the relational table.</span></div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>&#160; us=<a class="code" href="classvoro_1_1voronoicell__base.html#adfccfa7dce395277535f61f780d87c8b">cycle_down</a>(i,up);</div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>&#160; <span class="keywordflow">while</span>(i&lt;j) {</div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+i];</div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>&#160; vc.n_copy(p,k,up,i);</div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k]=qp;</div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+k]=qs;</div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs]=k;</div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i]=-1;</div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>&#160; i++;k++;</div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>&#160; }</div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>&#160; qs=i==nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]?0:i;</div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>&#160;</div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>&#160; <span class="comment">// In this case, the zeroth edge is outside the cutting</span></div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>&#160; <span class="comment">// plane. Begin by searching backwards from the last</span></div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>&#160; <span class="comment">// edge until we find an edge which isn&#39;t outside.</span></div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>&#160; i=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]-1;</div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>&#160; <span class="keywordflow">while</span>(lw==-1) {</div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>&#160; i--;</div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>&#160;</div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>&#160; <span class="comment">// If i reaches zero, then we have a point in</span></div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>&#160; <span class="comment">// the plane all of whose edges are outside</span></div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>&#160; <span class="comment">// the cutting space, so we just exit</span></div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>&#160; <span class="keywordflow">if</span>(i==0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>&#160; }</div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>&#160;</div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>&#160; <span class="comment">// Now search forwards from zero</span></div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>&#160; j=1;</div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][j];</div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>&#160; qw=m_test(qp,q);</div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>&#160; <span class="keywordflow">while</span>(qw==-1) {</div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>&#160; j++;</div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][j];</div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>&#160; qw=m_test(qp,l);</div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>&#160; }</div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>&#160;</div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>&#160; <span class="comment">// Compute the number of edges for the new vertex. In</span></div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>&#160; <span class="comment">// general it will be the number of outside edges</span></div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>&#160; <span class="comment">// found, plus two. But we need to recognize the</span></div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>&#160; <span class="comment">// special case when all but one edge is outside, and</span></div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>&#160; <span class="comment">// the remaining one is on the plane. For that case we</span></div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>&#160; <span class="comment">// have to reduce the edge count by one to prevent</span></div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>&#160; <span class="comment">// doubling up.</span></div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>&#160; <span class="keywordflow">if</span>(i==j&amp;&amp;qw==0) {</div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>&#160; double_edge=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]-i+j+1;</div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>&#160; }</div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>&#160;</div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>&#160; <span class="comment">// Add memory to store the vertex if it doesn&#39;t exist</span></div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>&#160; <span class="comment">// already</span></div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>&#160; k=1;</div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>&#160; <span class="keywordflow">while</span>(nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&gt;=current_vertex_order) add_memory_vorder(vc);</div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]==mem[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]) add_memory(vc,nu[p],stackp2);</div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>&#160;</div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>&#160; <span class="comment">// Copy the edges of the original vertex into the new</span></div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>&#160; <span class="comment">// one. Delete the edges of the original vertex, and</span></div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>&#160; <span class="comment">// update the relational table.</span></div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>&#160; vc.n_set_pointer(p,nu[p]);</div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]+((nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&lt;&lt;1)+1)*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]++;</div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]&lt;&lt;1]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>&#160; us=i++;</div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>&#160; <span class="keywordflow">while</span>(i&lt;nu[up]) {</div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+i];</div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>&#160; vc.n_copy(p,k,up,i);</div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k]=qp;</div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+k]=qs;</div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs]=k;</div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i]=-1;</div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>&#160; i++;k++;</div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>&#160; }</div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>&#160; i=0;</div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>&#160; <span class="keywordflow">while</span>(i&lt;j) {</div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i];</div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+i];</div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>&#160; vc.n_copy(p,k,up,i);</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k]=qp;</div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+k]=qs;</div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs]=k;</div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][i]=-1;</div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>&#160; i++;k++;</div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>&#160; }</div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>&#160; qs=j;</div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>&#160; }</div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>&#160; <span class="keywordflow">if</span>(!double_edge) {</div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>&#160; vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,k,up,qs);</div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>&#160; vc.n_set(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,0,p_id);</div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>&#160; } <span class="keywordflow">else</span> vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,0,up,qs);</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>&#160;</div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>&#160; <span class="comment">// Add this point to the auxiliary delete stack</span></div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>&#160; <span class="keywordflow">if</span>(stackp2==stacke2) add_memory_ds2(stackp2);</div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>&#160; *(stackp2++)=up;</div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>&#160;</div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>&#160; <span class="comment">// Look at the edges on either side of the group that was</span></div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>&#160; <span class="comment">// detected. We&#39;re going to commence facet computation by</span></div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>&#160; <span class="comment">// moving along one of them. We are going to end up coming back</span></div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>&#160; <span class="comment">// along the other one.</span></div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>&#160; cs=k;</div>
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>;q=u;</div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>&#160; i=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>&#160; us=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>&#160; up=i;</div>
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]&lt;&lt;1]=-<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>&#160;</div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>&#160;</div>
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>&#160; <span class="comment">// The search algorithm found an intersected edge between the</span></div>
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>&#160; <span class="comment">// points lp and up. Create a new vertex between them which</span></div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>&#160; <span class="comment">// lies on the cutting plane. Since u and l differ by at least</span></div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>&#160; <span class="comment">// the tolerance, this division should never screw up.</span></div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>&#160; <span class="keywordflow">if</span>(stackp==stacke) add_memory_ds(stackp);</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>&#160; *(stackp++)=up;</div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>&#160; r=u/(u-l);l=1-r;</div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]*l;</div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp+1]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+1]*l;</div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp+2]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+2]*l;</div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>&#160;</div>
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>&#160; <span class="comment">// This point will always have three edges. Connect one of them</span></div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>&#160; <span class="comment">// to lp.</span></div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=3;</div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]==mem[3]) add_memory(vc,3,stackp2);</div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>&#160; vc.n_set_pointer(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,3);</div>
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>&#160; vc.n_set(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,0,p_id);</div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>&#160; vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,1,up,us);</div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>&#160; vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,2,lp,ls);</div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[3]+7*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]++;</div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][6]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us]=-1;</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][ls]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]+ls]=1;</div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][1]=lp;</div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+1]=ls;</div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>&#160; cs=2;</div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>&#160;</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>&#160; <span class="comment">// Set the direction to move in</span></div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(us,up);</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>&#160; qp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>;q=u;</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>&#160; }</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>&#160;</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>&#160; <span class="comment">// When the code reaches here, we have initialized the first point, and</span></div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>&#160; <span class="comment">// we have a direction for moving it to construct the rest of the facet</span></div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>&#160; cp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;rp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>++;</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>&#160; <span class="keywordflow">while</span>(qp!=up||qs!=us) {</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>&#160;</div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>&#160; <span class="comment">// We&#39;re currently tracing round an intersected facet. Keep</span></div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>&#160; <span class="comment">// moving around it until we find a point or edge which</span></div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>&#160; <span class="comment">// intersects the plane.</span></div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs];</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>&#160;</div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>&#160; <span class="keywordflow">if</span>(lw==1) {</div>
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>&#160;</div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>&#160; <span class="comment">// The point is still in the cutting space. Just add it</span></div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>&#160; <span class="comment">// to the delete stack and keep moving.</span></div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs],lp);</div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>&#160; qp=lp;</div>
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>&#160; q=l;</div>
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>&#160; <span class="keywordflow">if</span>(stackp==stacke) add_memory_ds(stackp);</div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>&#160; *(stackp++)=qp;</div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>&#160;</div>
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(lw==-1) {</div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>&#160;</div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>&#160; <span class="comment">// The point is outside of the cutting space, so we&#39;ve</span></div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>&#160; <span class="comment">// found an intersected edge. Introduce a regular point</span></div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>&#160; <span class="comment">// at the point of intersection. Connect it to the</span></div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>&#160; <span class="comment">// point we just tested. Also connect it to the previous</span></div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>&#160; <span class="comment">// new point in the facet we&#39;re constructing.</span></div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>==current_vertices) add_memory_vertices(vc);</div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>&#160; r=q/(q-l);l=1-r;</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp]*l;</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp+1]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp+1]*l;</div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*lp+2]*r+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp+2]*l;</div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=3;</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]==mem[3]) add_memory(vc,3,stackp2);</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs+nu[qp]];</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>&#160; vc.n_set_pointer(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,3);</div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>&#160; vc.n_set(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,0,p_id);</div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>&#160; vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,1,qp,qs);</div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>&#160; vc.n_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,2,lp,ls);</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[3]+7*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[3]++;</div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=cp;</div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][1]=lp;</div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][3]=cs;</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][4]=ls;</div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][6]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][ls]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]+ls]=1;</div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][cs]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][nu[cp]+cs]=0;</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs]=-1;</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(qs,qp);</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>&#160; cp=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>++;</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>&#160; cs=2;</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>&#160;</div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>&#160; <span class="comment">// We&#39;ve found a point which is on the cutting plane.</span></div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>&#160; <span class="comment">// We&#39;re going to introduce a new point right here, but</span></div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>&#160; <span class="comment">// first we need to figure out the number of edges it</span></div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>&#160; <span class="comment">// has.</span></div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>==current_vertices) add_memory_vertices(vc);</div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>&#160;</div>
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>&#160; <span class="comment">// If the previous vertex detected a double edge, our</span></div>
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>&#160; <span class="comment">// new vertex will have one less edge.</span></div>
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>&#160; k=double_edge?0:1;</div>
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs];</div>
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>&#160; qp=lp;</div>
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>&#160; iqs=qs;</div>
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>&#160;</div>
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>&#160; <span class="comment">// Start testing the edges of the current point until</span></div>
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>&#160; <span class="comment">// we find one which isn&#39;t outside the cutting space</span></div>
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>&#160; k++;</div>
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(qs,qp);</div>
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs];</div>
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>&#160; lw=m_test(lp,l);</div>
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>&#160; } <span class="keywordflow">while</span> (lw==-1);</div>
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>&#160;</div>
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>&#160; <span class="comment">// Now we need to find out whether this marginal vertex</span></div>
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>&#160; <span class="comment">// we are on has been visited before, because if that&#39;s</span></div>
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>&#160; <span class="comment">// the case, we need to add vertices to the existing</span></div>
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>&#160; <span class="comment">// new vertex, rather than creating a fresh one. We also</span></div>
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>&#160; <span class="comment">// need to figure out whether we&#39;re in a case where we</span></div>
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>&#160; <span class="comment">// might be creating a duplicate edge.</span></div>
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>&#160; j=-<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]&lt;&lt;1];</div>
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>&#160; <span class="keywordflow">if</span>(qp==up&amp;&amp;qs==us) {</div>
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>&#160;</div>
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>&#160; <span class="comment">// If we&#39;re heading into the final part of the</span></div>
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>&#160; <span class="comment">// new facet, then we never worry about the</span></div>
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>&#160; <span class="comment">// duplicate edge calculation.</span></div>
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>&#160; new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>&#160; <span class="keywordflow">if</span>(j&gt;0) k+=nu[j];</div>
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>&#160; <span class="keywordflow">if</span>(j&gt;0) {</div>
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>&#160;</div>
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>&#160; <span class="comment">// This vertex was visited before, so</span></div>
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>&#160; <span class="comment">// count those vertices to the ones we</span></div>
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>&#160; <span class="comment">// already have.</span></div>
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>&#160; k+=nu[j];</div>
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>&#160;</div>
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>&#160; <span class="comment">// The only time when we might make a</span></div>
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>&#160; <span class="comment">// duplicate edge is if the point we&#39;re</span></div>
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>&#160; <span class="comment">// going to move to next is also a</span></div>
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>&#160; <span class="comment">// marginal point, so test for that</span></div>
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>&#160; <span class="comment">// first.</span></div>
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>&#160; <span class="keywordflow">if</span>(lw==0) {</div>
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>&#160;</div>
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>&#160; <span class="comment">// Now see whether this marginal point</span></div>
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>&#160; <span class="comment">// has been visited before.</span></div>
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>&#160; i=-<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]&lt;&lt;1];</div>
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>&#160; <span class="keywordflow">if</span>(i&gt;0) {</div>
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>&#160;</div>
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>&#160; <span class="comment">// Now see if the last edge of that other</span></div>
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>&#160; <span class="comment">// marginal point actually ends up here.</span></div>
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]-1]==j) {</div>
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>&#160; new_double_edge=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>&#160; k-=1;</div>
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>&#160; } <span class="keywordflow">else</span> new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>&#160;</div>
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>&#160; <span class="comment">// That marginal point hasn&#39;t been visited</span></div>
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>&#160; <span class="comment">// before, so we probably don&#39;t have to worry</span></div>
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>&#160; <span class="comment">// about duplicate edges, except in the</span></div>
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>&#160; <span class="comment">// case when that&#39;s the way into the end</span></div>
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>&#160; <span class="comment">// of the facet, because that way always creates</span></div>
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>&#160; <span class="comment">// an edge.</span></div>
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>&#160; <span class="keywordflow">if</span>(j==rp&amp;&amp;lp==up&amp;&amp;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs]==us) {</div>
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>&#160; new_double_edge=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>&#160; k-=1;</div>
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>&#160; } <span class="keywordflow">else</span> new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>&#160; }</div>
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>&#160; } <span class="keywordflow">else</span> new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>&#160;</div>
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>&#160; <span class="comment">// The vertex hasn&#39;t been visited</span></div>
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>&#160; <span class="comment">// before, but let&#39;s see if it&#39;s</span></div>
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>&#160; <span class="comment">// marginal</span></div>
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>&#160; <span class="keywordflow">if</span>(lw==0) {</div>
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>&#160;</div>
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>&#160; <span class="comment">// If it is, we need to check</span></div>
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>&#160; <span class="comment">// for the case that it&#39;s a</span></div>
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>&#160; <span class="comment">// small branch, and that we&#39;re</span></div>
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>&#160; <span class="comment">// heading right back to where</span></div>
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>&#160; <span class="comment">// we came from</span></div>
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>&#160; i=-<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]&lt;&lt;1];</div>
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>&#160; <span class="keywordflow">if</span>(i==cp) {</div>
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>&#160; new_double_edge=<span class="keyword">true</span>;</div>
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>&#160; k-=1;</div>
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>&#160; } <span class="keywordflow">else</span> new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>&#160; } <span class="keywordflow">else</span> new_double_edge=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>&#160; }</div>
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>&#160; }</div>
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>&#160;</div>
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>&#160; <span class="comment">// k now holds the number of edges of the new vertex</span></div>
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>&#160; <span class="comment">// we are forming. Add memory for it if it doesn&#39;t exist</span></div>
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>&#160; <span class="comment">// already.</span></div>
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>&#160; <span class="keywordflow">while</span>(k&gt;=current_vertex_order) add_memory_vorder(vc);</div>
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[k]==mem[k]) add_memory(vc,k,stackp2);</div>
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>&#160;</div>
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>&#160; <span class="comment">// Now create a new vertex with order k, or augment</span></div>
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>&#160; <span class="comment">// the existing one</span></div>
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>&#160; <span class="keywordflow">if</span>(j&gt;0) {</div>
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>&#160;</div>
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>&#160; <span class="comment">// If we&#39;re augmenting a vertex but we don&#39;t</span></div>
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>&#160; <span class="comment">// actually need any more edges, just skip this</span></div>
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>&#160; <span class="comment">// routine to avoid memory confusion</span></div>
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>&#160; <span class="keywordflow">if</span>(nu[j]!=k) {</div>
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>&#160; <span class="comment">// Allocate memory and copy the edges</span></div>
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>&#160; <span class="comment">// of the previous instance into it</span></div>
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>&#160; vc.n_set_aux1(k);</div>
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>&#160; edp=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[k]+((k&lt;&lt;1)+1)*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[k]++;</div>
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>&#160; i=0;</div>
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>&#160; <span class="keywordflow">while</span>(i&lt;nu[j]) {</div>
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>&#160; vc.n_copy_aux1(j,i);</div>
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>&#160; edp[i]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][i];</div>
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>&#160; edp[k+i]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]+i];</div>
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>&#160; i++;</div>
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>&#160; }</div>
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>&#160; edp[k&lt;&lt;1]=j;</div>
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>&#160;</div>
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>&#160; <span class="comment">// Remove the previous instance with</span></div>
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>&#160; <span class="comment">// fewer vertices from the memory</span></div>
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>&#160; <span class="comment">// structure</span></div>
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>&#160; edd=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[nu[j]]+((nu[j]&lt;&lt;1)+1)*--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[j]];</div>
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>&#160; <span class="keywordflow">if</span>(edd!=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j]) {</div>
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>&#160; <span class="keywordflow">for</span>(lw=0;lw&lt;=(nu[j]&lt;&lt;1);lw++) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][lw]=edd[lw];</div>
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>&#160; vc.n_set_aux2_copy(j,nu[j]);</div>
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>&#160; vc.n_copy_pointer(edd[nu[j]&lt;&lt;1],j);</div>
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[edd[nu[j]&lt;&lt;1]]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j];</div>
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>&#160; }</div>
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>&#160; vc.n_set_to_aux1(j);</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j]=edp;</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160; } <span class="keywordflow">else</span> i=nu[j];</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160; <span class="comment">// Allocate a new vertex of order k</span></div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160; vc.n_set_pointer(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,k);</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[k]+((k&lt;&lt;1)+1)*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[k]++;</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k&lt;&lt;1]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160; <span class="keywordflow">if</span>(stackp2==stacke2) add_memory_ds2(stackp2);</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160; *(stackp2++)=qp;</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp];</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp+1];</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*qp+2];</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]&lt;&lt;1]=-<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160; j=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>++;</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160; i=0;</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160; }</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160; nu[j]=k;</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160; <span class="comment">// Unless the previous case was a double edge, connect</span></div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160; <span class="comment">// the first available edge of the new vertex to the</span></div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160; <span class="comment">// last one in the facet</span></div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160; <span class="keywordflow">if</span>(!double_edge) {</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][i]=cp;</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]+i]=cs;</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160; vc.n_set(j,i,p_id);</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][cs]=j;</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][nu[cp]+cs]=i;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160; i++;</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160; }</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160; <span class="comment">// Copy in the edges of the underlying vertex,</span></div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160; <span class="comment">// and do one less if this was a double edge</span></div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160; qs=iqs;</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160; <span class="keywordflow">while</span>(i&lt;(new_double_edge?k:k-1)) {</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(qs,qp);</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160; lp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs];ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]+qs];</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160; vc.n_copy(j,i,qp,qs);</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][i]=lp;</div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]+i]=ls;</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][ls]=j;</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[lp][nu[lp]+ls]=i;</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][qs]=-1;</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160; i++;</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160; }</div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160; qs=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(qs,qp);</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160; cs=i;</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160; cp=j;</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160; vc.n_copy(j,new_double_edge?0:cs,qp,qs);</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160; <span class="comment">// Update the double_edge flag, to pass it</span></div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160; <span class="comment">// to the next instance of this routine</span></div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160; double_edge=new_double_edge;</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160; }</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160; }</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160; <span class="comment">// Connect the final created vertex to the initial one</span></div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][cs]=rp;</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[rp]=cp;</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp][nu[cp]+cs]=0;</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[rp][nu[rp]]=cs;</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160; <span class="comment">// Delete points: first, remove any duplicates</span></div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160; dsp=ds;</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160; <span class="keywordflow">while</span>(dsp&lt;stackp) {</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160; j=*dsp;</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]]!=-1) {</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]]=-1;</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160; dsp++;</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160; } <span class="keywordflow">else</span> *dsp=*(--stackp);</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160; }</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160; <span class="comment">// Add the points in the auxiliary delete stack,</span></div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160; <span class="comment">// and reset their back pointers</span></div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160; <span class="keywordflow">for</span>(dsp=ds2;dsp&lt;stackp2;dsp++) {</div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160; j=*dsp;</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]&lt;&lt;1]=j;</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]]!=-1) {</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]]=-1;</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160; <span class="keywordflow">if</span>(stackp==stacke) add_memory_ds(stackp);</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160; *(stackp++)=j;</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160; }</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160; }</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160; <span class="comment">// Scan connections and add in extras</span></div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160; <span class="keywordflow">for</span>(dsp=ds;dsp&lt;stackp;dsp++) {</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160; cp=*dsp;</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160; <span class="keywordflow">for</span>(edp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp];edp&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[cp]+nu[cp];edp++) {</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160; qp=*edp;</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160; <span class="keywordflow">if</span>(qp!=-1&amp;&amp;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]]!=-1) {</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160; <span class="keywordflow">if</span>(stackp==stacke) {</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160; <span class="keywordtype">int</span> dis=stackp-dsp;</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160; add_memory_ds(stackp);</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160; dsp=ds+dis;</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160; }</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160; *(stackp++)=qp;</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[qp][nu[qp]]=-1;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160; }</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160; }</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160; }</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160; up=0;</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160; <span class="comment">// Delete them from the array structure</span></div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160; <span class="keywordflow">while</span>(stackp&gt;ds) {</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160; --<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160; <span class="keywordflow">while</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]]==-1) {</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160; j=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160; edp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];edd=(<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[j]+((j&lt;&lt;1)+1)*--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[j]);</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160; <span class="keywordflow">while</span>(edp&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+(j&lt;&lt;1)+1) *(edp++)=*(edd++);</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160; vc.n_set_aux2_copy(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>,j);</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160; vc.n_copy_pointer(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][(j&lt;&lt;1)],<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][(j&lt;&lt;1)]]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160; --<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160; }</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160; up=*(--stackp);</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160; <span class="keywordflow">if</span>(up&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) {</div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160; <span class="comment">// Vertex management</span></div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1];</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*up+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2];</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160; <span class="comment">// Memory management</span></div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160; j=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160; edp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];edd=(<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[j]+((j&lt;&lt;1)+1)*--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[j]);</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160; <span class="keywordflow">while</span>(edp&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[up]+(j&lt;&lt;1)+1) *(edp++)=*(edd++);</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160; vc.n_set_aux2_copy(up,j);</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160; vc.n_copy_pointer(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[up][j&lt;&lt;1],up);</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160; vc.n_copy_pointer(up,<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][j&lt;&lt;1]]=ed[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160; <span class="comment">// Edge management</span></div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160; ed[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]=ed[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160; nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];i++) ed[ed[up][i]][ed[up][nu[up]+i]]=up;</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160; ed[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]&lt;&lt;1]=<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>;</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160; } <span class="keywordflow">else</span> up=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>++;</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160; }</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160; <span class="comment">// Check for any vertices of zero order</span></div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160; <span class="keywordflow">if</span>(*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>&gt;0) voro_fatal_error(<span class="stringliteral">&quot;Zero order vertex formed&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160; <span class="comment">// Collapse any order 2 vertices and exit</span></div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160; <span class="keywordflow">return</span> collapse_order2(vc);</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;}</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;<span class="comment">/** During the creation of a new facet in the plane routine, it is possible</span></div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;<span class="comment"> * that some order two vertices may arise. This routine removes them.</span></div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;<span class="comment"> * Suppose an order two vertex joins c and d. If there&#39;s a edge between</span></div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;<span class="comment"> * c and d already, then the order two vertex is just removed; otherwise,</span></div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;<span class="comment"> * the order two vertex is removed and c and d are joined together directly.</span></div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;<span class="comment"> * It is possible this process will create order two or order one vertices,</span></div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;<span class="comment"> * and the routine is continually run until all of them are removed.</span></div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;<span class="comment"> * \return False if the vertex removal was unsuccessful, indicative of the cell</span></div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>&#160;<span class="comment"> * reducing to zero volume and disappearing; true if the vertex removal</span></div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;<span class="comment"> * was successful. */</span></div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::collapse_order2(vc_class &amp;vc) {</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160; <span class="keywordflow">if</span>(!collapse_order1(vc)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160; <span class="keywordtype">int</span> a,b,i,j,k,l;</div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160; <span class="keywordflow">while</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[2]&gt;0) {</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160; <span class="comment">// Pick a order 2 vertex and read in its edges</span></div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160; i=--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[2];</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160; j=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[2][5*i];k=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[2][5*i+1];</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160; <span class="keywordflow">if</span>(j==k) {</div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=1</span></div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;<span class="preprocessor"></span> fputs(<span class="stringliteral">&quot;Order two vertex joins itself&quot;</span>,stderr);</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;<span class="preprocessor"></span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160; }</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160; <span class="comment">// Scan the edges of j to see if joins k</span></div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160; <span class="keywordflow">for</span>(l=0;l&lt;nu[j];l++) {</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l]==k) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160; }</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160; <span class="comment">// If j doesn&#39;t already join k, join them together.</span></div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160; <span class="comment">// Otherwise delete the connection to the current</span></div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160; <span class="comment">// vertex from j and k.</span></div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160; a=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[2][5*i+2];b=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[2][5*i+3];i=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[2][5*i+4];</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160; <span class="keywordflow">if</span>(l==nu[j]) {</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][a]=k;</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][b]=j;</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][nu[j]+a]=b;</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+b]=a;</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160; <span class="keywordflow">if</span>(!delete_connection(vc,j,a,<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160; <span class="keywordflow">if</span>(!delete_connection(vc,k,b,<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160; }</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160; <span class="comment">// Compact the memory</span></div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160; --<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160; <span class="keywordflow">if</span>(up==i) up=0;</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>!=i) {</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160; <span class="keywordflow">if</span>(up==<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) up=i;</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1];</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2];</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160; <span class="keywordflow">for</span>(k=0;k&lt;nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];k++) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k]][<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+k]]=i;</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160; vc.n_copy_pointer(i,<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160; nu[i]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]&lt;&lt;1]=i;</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160; }</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160; <span class="comment">// Collapse any order 1 vertices if they were created</span></div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160; <span class="keywordflow">if</span>(!collapse_order1(vc)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160; }</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;}</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;<span class="comment">/** Order one vertices can potentially be created during the order two collapse</span></div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;<span class="comment"> * routine. This routine keeps removing them until there are none left.</span></div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;<span class="comment"> * \return False if the vertex removal was unsuccessful, indicative of the cell</span></div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;<span class="comment"> * having zero volume and disappearing; true if the vertex removal was</span></div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;<span class="comment"> * successful. */</span></div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::collapse_order1(vc_class &amp;vc) {</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160; <span class="keywordtype">int</span> i,j,k;</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160; <span class="keywordflow">while</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[1]&gt;0) {</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160; up=0;</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=1</span></div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;<span class="preprocessor"></span> fputs(<span class="stringliteral">&quot;Order one collapse\n&quot;</span>,stderr);</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;<span class="preprocessor"></span> i=--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[1];</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160; j=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[1][3*i];k=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[1][3*i+1];</div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>&#160; i=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[1][3*i+2];</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160; <span class="keywordflow">if</span>(!delete_connection(vc,j,k,<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160; --<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160; <span class="keywordflow">if</span>(up==i) up=0;</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>!=i) {</div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160; <span class="keywordflow">if</span>(up==<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) up=i;</div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+1]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+1];</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+2]=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>+2];</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160; <span class="keywordflow">for</span>(k=0;k&lt;nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];k++) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][k]][<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>]+k]]=i;</div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160; vc.n_copy_pointer(i,<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160; nu[i]=nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>];</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]&lt;&lt;1]=i;</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160; }</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160; }</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;}</div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;<span class="comment">/** This routine deletes the kth edge of vertex j and reorganizes the memory.</span></div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;<span class="comment"> * If the neighbor computation is enabled, we also have to supply an handedness</span></div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;<span class="comment"> * flag to decide whether to preserve the plane on the left or right of the</span></div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;<span class="comment"> * connection.</span></div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;<span class="comment"> * \return False if a zero order vertex was formed, indicative of the cell</span></div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;<span class="comment"> * disappearing; true if the vertex removal was successful. */</span></div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> vc_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::delete_connection(vc_class &amp;vc,<span class="keywordtype">int</span> j,<span class="keywordtype">int</span> k,<span class="keywordtype">bool</span> hand) {</div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160; <span class="keywordtype">int</span> q=hand?k:<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(k,j);</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160; <span class="keywordtype">int</span> i=nu[j]-1,l,*edp,*edd,m;</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=1</span></div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;<span class="preprocessor"></span> <span class="keywordflow">if</span>(i&lt;1) {</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160; fputs(<span class="stringliteral">&quot;Zero order vertex formed\n&quot;</span>,stderr);</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160; }</div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;<span class="preprocessor"></span> <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]==mem[i]) add_memory(vc,i,ds2);</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160; vc.n_set_aux1(i);</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160; <span class="keywordflow">for</span>(l=0;l&lt;q;l++) vc.n_copy_aux1(j,l);</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160; <span class="keywordflow">while</span>(l&lt;i) {</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160; vc.n_copy_aux1_shift(j,l);</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160; l++;</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160; }</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160; edp=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[i]+((i&lt;&lt;1)+1)*<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[i]++;</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160; edp[i&lt;&lt;1]=j;</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160; <span class="keywordflow">for</span>(l=0;l&lt;k;l++) {</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160; edp[l]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l];</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160; edp[l+i]=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l+nu[j]];</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160; }</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160; <span class="keywordflow">while</span>(l&lt;i) {</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l+1];</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160; edp[l]=m;</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l+nu[j]+1];</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160; edp[l+i]=k;</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[m][nu[m]+k]--;</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160; l++;</div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160; }</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;</div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>&#160; edd=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[nu[j]]+((nu[j]&lt;&lt;1)+1)*--<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[j]];</div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160; <span class="keywordflow">for</span>(l=0;l&lt;=(nu[j]&lt;&lt;1);l++) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j][l]=edd[l];</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160; vc.n_set_aux2_copy(j,nu[j]);</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160; vc.n_set_to_aux2(edd[nu[j]&lt;&lt;1]);</div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160; vc.n_set_to_aux1(j);</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[edd[nu[j]&lt;&lt;1]]=edd;</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[j]=edp;</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160; nu[j]=i;</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>&#160;}</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>&#160;<span class="comment">/** Calculates the volume of the Voronoi cell, by decomposing the cell into</span></div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>&#160;<span class="comment"> * tetrahedra extending outward from the zeroth vertex, whose volumes are</span></div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>&#160;<span class="comment"> * evaluated using a scalar triple product.</span></div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>&#160;<span class="comment"> * \return A floating point number holding the calculated volume. */</span></div>
<div class="line"><a name="l01299"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a92f69986a6f78e7b8b6d9f5778ed99ba"> 1299</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a92f69986a6f78e7b8b6d9f5778ed99ba">voronoicell_base::volume</a>() {</div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>&#160; <span class="keyword">const</span> <span class="keywordtype">double</span> fe=1/48.0;</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>&#160; <span class="keywordtype">double</span> vol=0;</div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,n;</div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>&#160; <span class="keywordtype">double</span> ux,uy,uz,vx,vy,vz,wx,wy,wz;</div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) {</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160; ux=*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i];</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160; uy=pts[1]-pts[3*i+1];</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160; uz=pts[2]-pts[3*i+2];</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160; vx=pts[3*k]-*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160; vy=pts[3*k+1]-pts[1];</div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160; vz=pts[3*k+2]-pts[2];</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160; n=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160; wx=pts[3*m]-*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160; wy=pts[3*m+1]-pts[1];</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160; wz=pts[3*m+2]-pts[2];</div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>&#160; vol+=ux*vy*wz+uy*vz*wx+uz*vx*wy-uz*vy*wx-uy*vx*wz-ux*vz*wy;</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160; k=m;l=n;vx=wx;vy=wy;vz=wz;</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160; }</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160; }</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160; }</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>&#160; }</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>&#160; <span class="keywordflow">return</span> vol*fe;</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>&#160;}</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>&#160;<span class="comment">/** Calculates the areas of each face of the Voronoi cell and prints the</span></div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>&#160;<span class="comment"> * results to an output stream.</span></div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01336"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a4e6698c49580b3a64046230e02f0f8ea"> 1336</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a4e6698c49580b3a64046230e02f0f8ea">voronoicell_base::face_areas</a>(std::vector&lt;double&gt; &amp;v) {</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>&#160; <span class="keywordtype">double</span> area;</div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>&#160; v.clear();</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,n;</div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160; <span class="keywordtype">double</span> ux,uy,uz,vx,vy,vz,wx,wy,wz;</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160; area=0;</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160; n=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160; ux=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k]-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i];</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160; uy=pts[3*k+1]-pts[3*i+1];</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160; uz=pts[3*k+2]-pts[3*i+2];</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160; vx=pts[3*m]-pts[3*i];</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160; vy=pts[3*m+1]-pts[3*i+1];</div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160; vz=pts[3*m+2]-pts[3*i+2];</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160; wx=uy*vz-uz*vy;</div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160; wy=uz*vx-ux*vz;</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160; wz=ux*vy-uy*vx;</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160; area+=sqrt(wx*wx+wy*wy+wz*wz);</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160; k=m;l=n;</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>&#160; }</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160; v.push_back(0.125*area);</div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160; }</div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160; }</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;}</div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;<span class="comment">/** Calculates the total surface area of the Voronoi cell.</span></div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;<span class="comment"> * \return The computed area. */</span></div>
<div class="line"><a name="l01372"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af1a68eea414a0a52b072005af7bd710a"> 1372</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af1a68eea414a0a52b072005af7bd710a">voronoicell_base::surface_area</a>() {</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160; <span class="keywordtype">double</span> area=0;</div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,n;</div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>&#160; <span class="keywordtype">double</span> ux,uy,uz,vx,vy,vz,wx,wy,wz;</div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>&#160; n=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>&#160; ux=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k]-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i];</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>&#160; uy=pts[3*k+1]-pts[3*i+1];</div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>&#160; uz=pts[3*k+2]-pts[3*i+2];</div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>&#160; vx=pts[3*m]-pts[3*i];</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>&#160; vy=pts[3*m+1]-pts[3*i+1];</div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>&#160; vz=pts[3*m+2]-pts[3*i+2];</div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>&#160; wx=uy*vz-uz*vy;</div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>&#160; wy=uz*vx-ux*vz;</div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>&#160; wz=ux*vy-uy*vx;</div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>&#160; area+=sqrt(wx*wx+wy*wy+wz*wz);</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>&#160; k=m;l=n;</div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>&#160; }</div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>&#160; }</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>&#160; }</div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>&#160; <span class="keywordflow">return</span> 0.125*area;</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>&#160;}</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>&#160;</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>&#160;<span class="comment">/** Calculates the centroid of the Voronoi cell, by decomposing the cell into</span></div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;<span class="comment"> * tetrahedra extending outward from the zeroth vertex.</span></div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160;<span class="comment"> * \param[out] (cx,cy,cz) references to floating point numbers in which to</span></div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;<span class="comment"> * pass back the centroid vector. */</span></div>
<div class="line"><a name="l01408"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a7ea57c92bba3110da745381c5877cec3"> 1408</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a7ea57c92bba3110da745381c5877cec3">voronoicell_base::centroid</a>(<span class="keywordtype">double</span> &amp;cx,<span class="keywordtype">double</span> &amp;cy,<span class="keywordtype">double</span> &amp;cz) {</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160; <span class="keywordtype">double</span> tvol,vol=0;cx=cy=cz=0;</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,n;</div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160; <span class="keywordtype">double</span> ux,uy,uz,vx,vy,vz,wx,wy,wz;</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) {</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160; ux=*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i];</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160; uy=pts[1]-pts[3*i+1];</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160; uz=pts[2]-pts[3*i+2];</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160; vx=pts[3*k]-*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160; vy=pts[3*k+1]-pts[1];</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160; vz=pts[3*k+2]-pts[2];</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160; n=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160; wx=pts[3*m]-*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160; wy=pts[3*m+1]-pts[1];</div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160; wz=pts[3*m+2]-pts[2];</div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160; tvol=ux*vy*wz+uy*vz*wx+uz*vx*wy-uz*vy*wx-uy*vx*wz-ux*vz*wy;</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160; vol+=tvol;</div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160; cx+=(wx+vx-ux)*tvol;</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160; cy+=(wy+vy-uy)*tvol;</div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160; cz+=(wz+vz-uz)*tvol;</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160; k=m;l=n;vx=wx;vy=wy;vz=wz;</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160; }</div>
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160; }</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160; }</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160; }</div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160; <span class="keywordflow">if</span>(vol&gt;tolerance_sq) {</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160; vol=0.125/vol;</div>
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160; cx=cx*vol+0.5*(*pts);</div>
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160; cy=cy*vol+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1];</div>
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160; cz=cz*vol+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2];</div>
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160; } <span class="keywordflow">else</span> cx=cy=cz=0;</div>
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160;}</div>
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;<span class="comment">/** Computes the maximum radius squared of a vertex from the center of the</span></div>
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;<span class="comment"> * cell. It can be used to determine when enough particles have been testing an</span></div>
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;<span class="comment"> * all planes that could cut the cell have been considered.</span></div>
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160;<span class="comment"> * \return The maximum radius squared of a vertex.*/</span></div>
<div class="line"><a name="l01454"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a6a29a361a158db038a5c4c8e47322bd5"> 1454</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a6a29a361a158db038a5c4c8e47322bd5">voronoicell_base::max_radius_squared</a>() {</div>
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160; <span class="keywordtype">double</span> r,s,*ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>+3,*ptse=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>+3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;</div>
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160; r=*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>*(*pts)+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1]*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[1]+<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2]*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[2];</div>
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160; <span class="keywordflow">while</span>(ptsp&lt;ptse) {</div>
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>&#160; s=*ptsp*(*ptsp);ptsp++;</div>
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160; s+=*ptsp*(*ptsp);ptsp++;</div>
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160; s+=*ptsp*(*ptsp);ptsp++;</div>
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160; <span class="keywordflow">if</span>(s&gt;r) r=s;</div>
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160; }</div>
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>&#160; <span class="keywordflow">return</span> r;</div>
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>&#160;}</div>
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>&#160;<span class="comment">/** Calculates the total edge distance of the Voronoi cell.</span></div>
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>&#160;<span class="comment"> * \return A floating point number holding the calculated distance. */</span></div>
<div class="line"><a name="l01468"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a94fc0aba05c11fba465449bc1c4217e9"> 1468</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a94fc0aba05c11fba465449bc1c4217e9">voronoicell_base::total_edge_distance</a>() {</div>
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>&#160; <span class="keywordtype">int</span> i,j,k;</div>
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>&#160; <span class="keywordtype">double</span> dis=0,dx,dy,dz;</div>
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>-1;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>&#160; <span class="keywordflow">if</span>(k&gt;i) {</div>
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>&#160; dx=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k]-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i];</div>
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>&#160; dy=pts[3*k+1]-pts[3*i+1];</div>
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>&#160; dz=pts[3*k+2]-pts[3*i+2];</div>
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>&#160; dis+=sqrt(dx*dx+dy*dy+dz*dz);</div>
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>&#160; }</div>
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>&#160; }</div>
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>&#160; <span class="keywordflow">return</span> 0.5*dis;</div>
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>&#160;}</div>
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>&#160;<span class="comment">/** Outputs the edges of the Voronoi cell in POV-Ray format to an open file</span></div>
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>&#160;<span class="comment"> * stream, displacing the cell by given vector.</span></div>
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>&#160;<span class="comment"> * \param[in] (x,y,z) a displacement vector to be added to the cell&#39;s position.</span></div>
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>&#160;<span class="comment"> * \param[in] fp a file handle to write to. */</span></div>
<div class="line"><a name="l01487"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a923ffa62bd5d62070cd29e01f3a1327a"> 1487</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a923ffa62bd5d62070cd29e01f3a1327a">voronoicell_base::draw_pov</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,FILE* fp) {</div>
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>&#160; <span class="keywordtype">int</span> i,j,k;<span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>,*pt2;</div>
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>&#160; <span class="keywordtype">char</span> posbuf1[128],posbuf2[128];</div>
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++,ptsp+=3) {</div>
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>&#160; sprintf(posbuf1,<span class="stringliteral">&quot;%g,%g,%g&quot;</span>,x+*ptsp*0.5,y+ptsp[1]*0.5,z+ptsp[2]*0.5);</div>
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>&#160; fprintf(fp,<span class="stringliteral">&quot;sphere{&lt;%s&gt;,r}\n&quot;</span>,posbuf1);</div>
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>&#160; <span class="keywordflow">if</span>(k&lt;i) {</div>
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>&#160; pt2=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>+3*k;</div>
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>&#160; sprintf(posbuf2,<span class="stringliteral">&quot;%g,%g,%g&quot;</span>,x+*pt2*0.5,y+0.5*pt2[1],z+0.5*pt2[2]);</div>
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>&#160; <span class="keywordflow">if</span>(strcmp(posbuf1,posbuf2)!=0) fprintf(fp,<span class="stringliteral">&quot;cylinder{&lt;%s&gt;,&lt;%s&gt;,r}\n&quot;</span>,posbuf1,posbuf2);</div>
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>&#160; }</div>
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>&#160; }</div>
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>&#160; }</div>
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>&#160;}</div>
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>&#160;<span class="comment">/** Outputs the edges of the Voronoi cell in gnuplot format to an output stream.</span></div>
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>&#160;<span class="comment"> * \param[in] (x,y,z) a displacement vector to be added to the cell&#39;s position.</span></div>
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>&#160;<span class="comment"> * \param[in] fp a file handle to write to. */</span></div>
<div class="line"><a name="l01507"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a1c0657c1d89313089bbd437170c97d46"> 1507</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a1c0657c1d89313089bbd437170c97d46">voronoicell_base::draw_gnuplot</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,FILE *fp) {</div>
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m;</div>
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>&#160; fprintf(fp,<span class="stringliteral">&quot;%g %g %g\n&quot;</span>,x+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i],y+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+1],z+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*i+2]);</div>
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160; l=i;m=j;</div>
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[l][nu[l]+m]]=-1-l;</div>
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[l][m]=-1-k;</div>
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>&#160; l=k;</div>
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>&#160; fprintf(fp,<span class="stringliteral">&quot;%g %g %g\n&quot;</span>,x+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k],y+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k+1],z+0.5*<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k+2]);</div>
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>&#160; } <span class="keywordflow">while</span> (search_edge(l,m,k));</div>
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>&#160; fputs(<span class="stringliteral">&quot;\n\n&quot;</span>,fp);</div>
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>&#160; }</div>
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>&#160; }</div>
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;}</div>
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>&#160;</div>
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::search_edge(<span class="keywordtype">int</span> l,<span class="keywordtype">int</span> &amp;m,<span class="keywordtype">int</span> &amp;k) {</div>
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>&#160; <span class="keywordflow">for</span>(m=0;m&lt;nu[l];m++) {</div>
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[l][m];</div>
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>&#160; }</div>
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>&#160;}</div>
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>&#160;<span class="comment">/** Outputs the Voronoi cell in the POV mesh2 format, described in section</span></div>
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>&#160;<span class="comment"> * 1.3.2.2 of the POV-Ray documentation. The mesh2 output consists of a list of</span></div>
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>&#160;<span class="comment"> * vertex vectors, followed by a list of triangular faces. The routine also</span></div>
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>&#160;<span class="comment"> * makes use of the optional inside_vector specification, which makes the mesh</span></div>
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>&#160;<span class="comment"> * object solid, so the the POV-Ray Constructive Solid Geometry (CSG) can be</span></div>
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>&#160;<span class="comment"> * applied.</span></div>
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>&#160;<span class="comment"> * \param[in] (x,y,z) a displacement vector to be added to the cell&#39;s position.</span></div>
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>&#160;<span class="comment"> * \param[in] fp a file handle to write to. */</span></div>
<div class="line"><a name="l01542"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a1b52986eadcea3b6b230626a6dbddc40"> 1542</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a1b52986eadcea3b6b230626a6dbddc40">voronoicell_base::draw_pov_mesh</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,FILE *fp) {</div>
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,n;</div>
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>&#160; <span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>&#160; fprintf(fp,<span class="stringliteral">&quot;mesh2 {\nvertex_vectors {\n%d\n&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++,ptsp+=3) fprintf(fp,<span class="stringliteral">&quot;,&lt;%g,%g,%g&gt;\n&quot;</span>,x+*ptsp*0.5,y+ptsp[1]*0.5,z+ptsp[2]*0.5);</div>
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>&#160; fprintf(fp,<span class="stringliteral">&quot;}\nface_indices {\n%d\n&quot;</span>,(p-2)&lt;&lt;1);</div>
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>&#160; n=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>&#160; fprintf(fp,<span class="stringliteral">&quot;,&lt;%d,%d,%d&gt;\n&quot;</span>,i,k,m);</div>
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>&#160; k=m;l=n;</div>
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>&#160; }</div>
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>&#160; }</div>
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>&#160; }</div>
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>&#160; fputs(<span class="stringliteral">&quot;}\ninside_vector &lt;0,0,1&gt;\n}\n&quot;</span>,fp);</div>
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>&#160;}</div>
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>&#160;<span class="comment">/** Several routines in the class that gather cell-based statistics internally</span></div>
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>&#160;<span class="comment"> * track their progress by flipping edges to negative so that they know what</span></div>
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>&#160;<span class="comment"> * parts of the cell have already been tested. This function resets them back</span></div>
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>&#160;<span class="comment"> * to positive. When it is called, it assumes that every edge in the routine</span></div>
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>&#160;<span class="comment"> * should have already been flipped to negative, and it bails out with an</span></div>
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>&#160;<span class="comment"> * internal error if it encounters a positive edge. */</span></div>
<div class="line"><a name="l01572"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61"> 1572</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">voronoicell_base::reset_edges</a>() {</div>
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>&#160; <span class="keywordtype">int</span> i,j;</div>
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]&gt;=0) voro_fatal_error(<span class="stringliteral">&quot;Edge reset routine found a previously untested edge&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>&#160; }</div>
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>&#160;}</div>
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>&#160;<span class="comment">/** Checks to see if a given vertex is inside, outside or within the test</span></div>
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>&#160;<span class="comment"> * plane. If the point is far away from the test plane, the routine immediately</span></div>
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>&#160;<span class="comment"> * returns whether it is inside or outside. If the routine is close the the</span></div>
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>&#160;<span class="comment"> * plane and within the specified tolerance, then the special check_marginal()</span></div>
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>&#160;<span class="comment"> * routine is called.</span></div>
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>&#160;<span class="comment"> * \param[in] n the vertex to test.</span></div>
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>&#160;<span class="comment"> * \param[out] ans the result of the scalar product used in evaluating the</span></div>
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>&#160;<span class="comment"> * location of the point.</span></div>
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>&#160;<span class="comment"> * \return -1 if the point is inside the plane, 1 if the point is outside the</span></div>
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>&#160;<span class="comment"> * plane, or 0 if the point is within the plane. */</span></div>
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">int</span> voronoicell_base::m_test(<span class="keywordtype">int</span> n,<span class="keywordtype">double</span> &amp;ans) {</div>
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>&#160; <span class="keywordtype">double</span> *pp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>+n+(n&lt;&lt;1);</div>
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>&#160; ans=*(pp++)*px;</div>
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>&#160; ans+=*(pp++)*py;</div>
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>&#160; ans+=*pp*pz-prsq;</div>
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>&#160; <span class="keywordflow">if</span>(ans&lt;-tolerance2) {</div>
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ans&gt;tolerance2) {</div>
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>&#160; <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>&#160; }</div>
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>&#160; <span class="keywordflow">return</span> check_marginal(n,ans);</div>
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>&#160;}</div>
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>&#160;<span class="comment">/** Checks to see if a given vertex is inside, outside or within the test</span></div>
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>&#160;<span class="comment"> * plane, for the case when the point has been detected to be very close to the</span></div>
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>&#160;<span class="comment"> * plane. The routine ensures that the returned results are always consistent</span></div>
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>&#160;<span class="comment"> * with previous tests, by keeping a table of any marginal results. The routine</span></div>
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>&#160;<span class="comment"> * first sees if the vertex is in the table, and if it finds a previously</span></div>
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>&#160;<span class="comment"> * computed result it uses that. Otherwise, it computes a result for this</span></div>
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>&#160;<span class="comment"> * vertex and adds it the table.</span></div>
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>&#160;<span class="comment"> * \param[in] n the vertex to test.</span></div>
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>&#160;<span class="comment"> * \param[in] ans the result of the scalar product used in evaluating</span></div>
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>&#160;<span class="comment"> * the location of the point.</span></div>
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>&#160;<span class="comment"> * \return -1 if the point is inside the plane, 1 if the point is outside the</span></div>
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>&#160;<span class="comment"> * plane, or 0 if the point is within the plane. */</span></div>
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>&#160;<span class="keywordtype">int</span> voronoicell_base::check_marginal(<span class="keywordtype">int</span> n,<span class="keywordtype">double</span> &amp;ans) {</div>
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>&#160; <span class="keywordtype">int</span> i;</div>
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;n_marg;i+=2) <span class="keywordflow">if</span>(marg[i]==n) <span class="keywordflow">return</span> marg[i+1];</div>
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>&#160; <span class="keywordflow">if</span>(n_marg==current_marginal) {</div>
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>&#160; current_marginal&lt;&lt;=1;</div>
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>&#160; <span class="keywordflow">if</span>(current_marginal&gt;max_marginal)</div>
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>&#160; voro_fatal_error(<span class="stringliteral">&quot;Marginal case buffer allocation exceeded absolute maximum&quot;</span>,<a class="code" href="config_8hh.html#a5dc0616f8a67ae3d1c2ba8a3dcf5612b">VOROPP_MEMORY_ERROR</a>);</div>
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;Marginal cases buffer scaled up to %d\n&quot;</span>,i);</div>
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>&#160;<span class="preprocessor"></span> <span class="keywordtype">int</span> *pmarg=<span class="keyword">new</span> <span class="keywordtype">int</span>[current_marginal];</div>
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;n_marg;j++) pmarg[j]=marg[j];</div>
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>&#160; <span class="keyword">delete</span> [] marg;</div>
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>&#160; marg=pmarg;</div>
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>&#160; }</div>
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>&#160; marg[n_marg++]=n;</div>
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>&#160; marg[n_marg++]=ans&gt;tolerance?1:(ans&lt;-tolerance?-1:0);</div>
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>&#160; <span class="keywordflow">return</span> marg[n_marg-1];</div>
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>&#160;}</div>
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>&#160;<span class="comment">/** For each face of the Voronoi cell, this routine prints the out the normal</span></div>
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>&#160;<span class="comment"> * vector of the face, and scales it to the distance from the cell center to</span></div>
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>&#160;<span class="comment"> * that plane.</span></div>
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01639"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#aebbbd4815cfbbe5cb1c71a682872664d"> 1639</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#aebbbd4815cfbbe5cb1c71a682872664d">voronoicell_base::normals</a>(std::vector&lt;double&gt; &amp;v) {</div>
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>&#160; <span class="keywordtype">int</span> i,j,k;</div>
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>&#160; v.clear();</div>
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) normals_search(v,i,j,k);</div>
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>&#160; }</div>
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>&#160;}</div>
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>&#160;<span class="comment">/** This inline routine is called by normals(). It attempts to construct a</span></div>
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>&#160;<span class="comment"> * single normal vector that is associated with a particular face. It first</span></div>
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>&#160;<span class="comment"> * traces around the face, trying to find two vectors along the face edges</span></div>
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>&#160;<span class="comment"> * whose vector product is above the numerical tolerance. It then constructs</span></div>
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>&#160;<span class="comment"> * the normal vector using this product. If the face is too small, and none of</span></div>
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>&#160;<span class="comment"> * the vector products are large enough, the routine may return (0,0,0) as the</span></div>
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>&#160;<span class="comment"> * normal vector.</span></div>
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>&#160;<span class="comment"> * \param[in] v the vector to store the results in.</span></div>
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>&#160;<span class="comment"> * \param[in] i the initial vertex of the face to test.</span></div>
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>&#160;<span class="comment"> * \param[in] j the index of an edge of the vertex.</span></div>
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>&#160;<span class="comment"> * \param[in] k the neighboring vertex of i, set to ed[i][j]. */</span></div>
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> voronoicell_base::normals_search(std::vector&lt;double&gt; &amp;v,<span class="keywordtype">int</span> i,<span class="keywordtype">int</span> j,<span class="keywordtype">int</span> k) {</div>
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>&#160; <span class="keywordtype">int</span> l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k),m;</div>
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>&#160; <span class="keywordtype">double</span> ux,uy,uz,vx,vy,vz,wx,wy,wz,wmag;</div>
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>&#160; ux=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*m]-<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>[3*k];</div>
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>&#160; uy=pts[3*m+1]-pts[3*k+1];</div>
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>&#160; uz=pts[3*m+2]-pts[3*k+2];</div>
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>&#160;</div>
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>&#160; <span class="comment">// Test to see if the length of this edge is above the tolerance</span></div>
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>&#160; <span class="keywordflow">if</span>(ux*ux+uy*uy+uz*uz&gt;tolerance_sq) {</div>
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>&#160; k=m;m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>&#160; vx=pts[3*m]-pts[3*k];</div>
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>&#160; vy=pts[3*m+1]-pts[3*k+1];</div>
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>&#160; vz=pts[3*m+2]-pts[3*k+2];</div>
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>&#160;</div>
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>&#160; <span class="comment">// Construct the vector product of this edge with</span></div>
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>&#160; <span class="comment">// the previous one</span></div>
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>&#160; wx=uz*vy-uy*vz;</div>
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>&#160; wy=ux*vz-uz*vx;</div>
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>&#160; wz=uy*vx-ux*vy;</div>
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>&#160; wmag=wx*wx+wy*wy+wz*wz;</div>
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>&#160;</div>
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>&#160; <span class="comment">// Test to see if this vector product of the</span></div>
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>&#160; <span class="comment">// two edges is above the tolerance</span></div>
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>&#160; <span class="keywordflow">if</span>(wmag&gt;tolerance_sq) {</div>
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>&#160;</div>
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>&#160; <span class="comment">// Construct the normal vector and print it</span></div>
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>&#160; wmag=1/sqrt(wmag);</div>
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>&#160; v.push_back(wx*wmag);</div>
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>&#160; v.push_back(wy*wmag);</div>
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>&#160; v.push_back(wz*wmag);</div>
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>&#160;</div>
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>&#160; <span class="comment">// Mark all of the remaining edges of this</span></div>
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>&#160; <span class="comment">// face and exit</span></div>
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>&#160; <span class="keywordflow">while</span>(m!=i) {</div>
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>&#160; k=m;m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>&#160; }</div>
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>&#160; }</div>
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>&#160; }</div>
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>&#160; }</div>
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>&#160; k=m;</div>
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>&#160;}</div>
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>&#160;</div>
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>&#160;<span class="comment">/** Returns the number of faces of a computed Voronoi cell.</span></div>
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>&#160;<span class="comment"> * \return The number of faces. */</span></div>
<div class="line"><a name="l01721"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a56b835abe6d47cb67b206202125eb406"> 1721</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a56b835abe6d47cb67b206202125eb406">voronoicell_base::number_of_faces</a>() {</div>
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,s=0;</div>
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>&#160; s++;</div>
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>&#160; k=m;</div>
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>&#160;</div>
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>&#160; }</div>
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>&#160; }</div>
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>&#160; <span class="keywordflow">return</span> s;</div>
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>&#160;}</div>
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>&#160;<span class="comment">/** Returns a vector of the vertex orders.</span></div>
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01744"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#adfed605232f7e6d1b52276010facbf08"> 1744</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#adfed605232f7e6d1b52276010facbf08">voronoicell_base::vertex_orders</a>(std::vector&lt;int&gt; &amp;v) {</div>
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>&#160; v.resize(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) v[i]=nu[i];</div>
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>&#160;}</div>
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>&#160;<span class="comment">/** Outputs the vertex orders.</span></div>
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>&#160;<span class="comment"> * \param[out] fp the file handle to write to. */</span></div>
<div class="line"><a name="l01751"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af92d19d0e7fc07006bcd8ea30c9df447"> 1751</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af92d19d0e7fc07006bcd8ea30c9df447">voronoicell_base::output_vertex_orders</a>(FILE *fp) {</div>
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>&gt;0) {</div>
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>&#160; fprintf(fp,<span class="stringliteral">&quot;%d&quot;</span>,*nu);</div>
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> *nup=nu+1;nup&lt;nu+<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;nup++) fprintf(fp,<span class="stringliteral">&quot; %d&quot;</span>,*nup);</div>
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>&#160; }</div>
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>&#160;}</div>
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>&#160;<span class="comment">/** Returns a vector of the vertex vectors using the local coordinate system.</span></div>
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01760"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ab6b1755fb46b262df8f8bc2980c7470a"> 1760</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#ab6b1755fb46b262df8f8bc2980c7470a">voronoicell_base::vertices</a>(std::vector&lt;double&gt; &amp;v) {</div>
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>&#160; v.resize(3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>&#160; <span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i+=3) {</div>
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>&#160; v[i]=*(ptsp++)*0.5;</div>
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>&#160; v[i+1]=*(ptsp++)*0.5;</div>
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>&#160; v[i+2]=*(ptsp++)*0.5;</div>
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>&#160; }</div>
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>&#160;}</div>
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>&#160;<span class="comment">/** Outputs the vertex vectors using the local coordinate system.</span></div>
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>&#160;<span class="comment"> * \param[out] fp the file handle to write to. */</span></div>
<div class="line"><a name="l01772"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#aee879731b1f4feb9f630d9b7f9c0062f"> 1772</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#aee879731b1f4feb9f630d9b7f9c0062f">voronoicell_base::output_vertices</a>(FILE *fp) {</div>
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>&gt;0) {</div>
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>&#160; fprintf(fp,<span class="stringliteral">&quot;(%g,%g,%g)&quot;</span>,*pts*0.5,pts[1]*0.5,pts[2]*0.5);</div>
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">double</span> *ptsp=pts+3;ptsp&lt;pts+3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;ptsp+=3) fprintf(fp,<span class="stringliteral">&quot; (%g,%g,%g)&quot;</span>,*ptsp*0.5,ptsp[1]*0.5,ptsp[2]*0.5);</div>
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>&#160; }</div>
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>&#160;}</div>
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>&#160;</div>
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>&#160;<span class="comment">/** Returns a vector of the vertex vectors in the global coordinate system.</span></div>
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in.</span></div>
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>&#160;<span class="comment"> * \param[in] (x,y,z) the position vector of the particle in the global</span></div>
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>&#160;<span class="comment"> * coordinate system. */</span></div>
<div class="line"><a name="l01784"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a4345486c4a2039f523d42fc670943fab"> 1784</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#ab6b1755fb46b262df8f8bc2980c7470a">voronoicell_base::vertices</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,std::vector&lt;double&gt; &amp;v) {</div>
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>&#160; v.resize(3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);</div>
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>&#160; <span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i+=3) {</div>
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>&#160; v[i]=x+*(ptsp++)*0.5;</div>
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>&#160; v[i+1]=y+*(ptsp++)*0.5;</div>
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>&#160; v[i+2]=z+*(ptsp++)*0.5;</div>
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>&#160; }</div>
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>&#160;}</div>
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>&#160;<span class="comment">/** Outputs the vertex vectors using the global coordinate system.</span></div>
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>&#160;<span class="comment"> * \param[out] fp the file handle to write to.</span></div>
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>&#160;<span class="comment"> * \param[in] (x,y,z) the position vector of the particle in the global</span></div>
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>&#160;<span class="comment"> * coordinate system. */</span></div>
<div class="line"><a name="l01798"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#aec32739bb3f9393f4ddc33d90796d494"> 1798</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#aee879731b1f4feb9f630d9b7f9c0062f">voronoicell_base::output_vertices</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,FILE *fp) {</div>
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>&gt;0) {</div>
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>&#160; fprintf(fp,<span class="stringliteral">&quot;(%g,%g,%g)&quot;</span>,x+*pts*0.5,y+pts[1]*0.5,z+pts[2]*0.5);</div>
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">double</span> *ptsp=pts+3;ptsp&lt;pts+3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;ptsp+=3) fprintf(fp,<span class="stringliteral">&quot; (%g,%g,%g)&quot;</span>,x+*ptsp*0.5,y+ptsp[1]*0.5,z+ptsp[2]*0.5);</div>
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>&#160; }</div>
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>&#160;}</div>
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>&#160;<span class="comment">/** This routine returns the perimeters of each face.</span></div>
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01807"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a335daba5a84e43c278384cae6ecefff3"> 1807</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a335daba5a84e43c278384cae6ecefff3">voronoicell_base::face_perimeters</a>(std::vector&lt;double&gt; &amp;v) {</div>
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>&#160; v.clear();</div>
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m;</div>
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>&#160; <span class="keywordtype">double</span> dx,dy,dz,perim;</div>
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>&#160; dx=pts[3*k]-pts[3*i];</div>
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>&#160; dy=pts[3*k+1]-pts[3*i+1];</div>
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>&#160; dz=pts[3*k+2]-pts[3*i+2];</div>
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>&#160; perim=sqrt(dx*dx+dy*dy+dz*dz);</div>
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>&#160; dx=pts[3*m]-pts[3*k];</div>
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>&#160; dy=pts[3*m+1]-pts[3*k+1];</div>
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>&#160; dz=pts[3*m+2]-pts[3*k+2];</div>
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>&#160; perim+=sqrt(dx*dx+dy*dy+dz*dz);</div>
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>&#160; k=m;</div>
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>&#160; v.push_back(0.5*perim);</div>
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>&#160; }</div>
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>&#160; }</div>
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>&#160;}</div>
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>&#160;<span class="comment">/** For each face, this routine outputs a bracketed sequence of numbers</span></div>
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>&#160;<span class="comment"> * containing a list of all the vertices that make up that face.</span></div>
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01839"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a83e74ffece2b313f6691f467769a16f5"> 1839</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a83e74ffece2b313f6691f467769a16f5">voronoicell_base::face_vertices</a>(std::vector&lt;int&gt; &amp;v) {</div>
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,vp(0),vn;</div>
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>&#160; v.clear();</div>
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>&#160; v.push_back(0);</div>
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>&#160; v.push_back(i);</div>
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>&#160; v.push_back(k);</div>
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>&#160; k=m;</div>
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>&#160; vn=v.size();</div>
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>&#160; v[vp]=vn-vp-1;</div>
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>&#160; vp=vn;</div>
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>&#160; }</div>
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>&#160; }</div>
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>&#160;}</div>
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>&#160;<span class="comment">/** Outputs a list of the number of edges in each face.</span></div>
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01866"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af9bad3fddace8e63ac4c0a5874aee7c5"> 1866</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af9bad3fddace8e63ac4c0a5874aee7c5">voronoicell_base::face_orders</a>(std::vector&lt;int&gt; &amp;v) {</div>
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,q;</div>
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>&#160; v.clear();</div>
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>&#160; q=1;</div>
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>&#160; q++;</div>
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>&#160; k=m;</div>
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>&#160; v.push_back(q);;</div>
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>&#160; }</div>
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>&#160; }</div>
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>&#160;}</div>
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>&#160;<span class="comment">/** Computes the number of edges that each face has and outputs a frequency</span></div>
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>&#160;<span class="comment"> * table of the results.</span></div>
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>&#160;<span class="comment"> * \param[out] v the vector to store the results in. */</span></div>
<div class="line"><a name="l01891"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a9df53445116446fafea8ffc4ee1afa76"> 1891</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a9df53445116446fafea8ffc4ee1afa76">voronoicell_base::face_freq_table</a>(std::vector&lt;int&gt; &amp;v) {</div>
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,q;</div>
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>&#160; v.clear();</div>
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>&#160; q=1;</div>
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>&#160; q++;</div>
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>&#160; k=m;</div>
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>&#160; <span class="keywordflow">if</span>((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) q&gt;=v.size()) v.resize(q+1,0);</div>
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>&#160; v[q]++;</div>
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>&#160; }</div>
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>&#160; }</div>
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>&#160;}</div>
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>&#160;<span class="comment">/** This routine tests to see whether the cell intersects a plane by starting</span></div>
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>&#160;<span class="comment"> * from the guess point up. If up intersects, then it immediately returns true.</span></div>
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>&#160;<span class="comment"> * Otherwise, it calls the plane_intersects_track() routine.</span></div>
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>&#160;<span class="comment"> * \param[in] (x,y,z) the normal vector to the plane.</span></div>
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>&#160;<span class="comment"> * \param[in] rsq the distance along this vector of the plane.</span></div>
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>&#160;<span class="comment"> * \return False if the plane does not intersect the plane, true if it does. */</span></div>
<div class="line"><a name="l01920"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#af6fd00a511226fd8dc4f27e34f002fc1"> 1920</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af6fd00a511226fd8dc4f27e34f002fc1">voronoicell_base::plane_intersects</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">double</span> rsq) {</div>
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>&#160; <span class="keywordtype">double</span> g=x*pts[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+y*pts[3*up+1]+z*pts[3*up+2];</div>
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>&#160; <span class="keywordflow">if</span>(g&lt;rsq) <span class="keywordflow">return</span> plane_intersects_track(x,y,z,rsq,g);</div>
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>&#160;}</div>
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>&#160;<span class="comment">/** This routine tests to see if a cell intersects a plane. It first tests a</span></div>
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>&#160;<span class="comment"> * random sample of approximately sqrt(p)/4 points. If any of those are</span></div>
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>&#160;<span class="comment"> * intersect, then it immediately returns true. Otherwise, it takes the closest</span></div>
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>&#160;<span class="comment"> * point and passes that to plane_intersect_track() routine.</span></div>
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>&#160;<span class="comment"> * \param[in] (x,y,z) the normal vector to the plane.</span></div>
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>&#160;<span class="comment"> * \param[in] rsq the distance along this vector of the plane.</span></div>
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>&#160;<span class="comment"> * \return False if the plane does not intersect the plane, true if it does. */</span></div>
<div class="line"><a name="l01933"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#afe3d860ac52be1326e69ba8c0750530d"> 1933</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voronoicell__base.html#afe3d860ac52be1326e69ba8c0750530d">voronoicell_base::plane_intersects_guess</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">double</span> rsq) {</div>
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>&#160; up=0;</div>
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>&#160; <span class="keywordtype">double</span> g=x*pts[3*<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+y*pts[3*up+1]+z*pts[3*up+2];</div>
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>&#160; <span class="keywordflow">if</span>(g&lt;rsq) {</div>
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160; <span class="keywordtype">int</span> ca=1,cc=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>&gt;&gt;3,mp=1;</div>
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160; <span class="keywordtype">double</span> m;</div>
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160; <span class="keywordflow">while</span>(ca&lt;cc) {</div>
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160; m=x*pts[3*mp]+y*pts[3*mp+1]+z*pts[3*mp+2];</div>
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160; <span class="keywordflow">if</span>(m&gt;g) {</div>
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160; <span class="keywordflow">if</span>(m&gt;rsq) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160; g=m;up=mp;</div>
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>&#160; }</div>
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>&#160; ca+=mp++;</div>
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>&#160; }</div>
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>&#160; <span class="keywordflow">return</span> plane_intersects_track(x,y,z,rsq,g);</div>
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>&#160; }</div>
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>&#160;}</div>
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>&#160;</div>
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>&#160;<span class="comment">/* This routine tests to see if a cell intersects a plane, by tracing over the cell from</span></div>
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>&#160;<span class="comment"> * vertex to vertex, starting at up. It is meant to be called either by plane_intersects()</span></div>
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>&#160;<span class="comment"> * or plane_intersects_track(), when those routines cannot immediately resolve the case.</span></div>
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>&#160;<span class="comment"> * \param[in] (x,y,z) the normal vector to the plane.</span></div>
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>&#160;<span class="comment"> * \param[in] rsq the distance along this vector of the plane.</span></div>
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>&#160;<span class="comment"> * \param[in] g the distance of up from the plane.</span></div>
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>&#160;<span class="comment"> * \return False if the plane does not intersect the plane, true if it does. */</span></div>
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voronoicell_base::plane_intersects_track(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">double</span> rsq,<span class="keywordtype">double</span> g) {</div>
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>&#160; <span class="keywordtype">int</span> count=0,ls,us,tp;</div>
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>&#160; <span class="keywordtype">double</span> t;</div>
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>&#160;</div>
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>&#160; <span class="comment">// The test point is outside of the cutting space</span></div>
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>&#160; <span class="keywordflow">for</span>(us=0;us&lt;nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>];us++) {</div>
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>&#160; tp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>&#160; t=x*pts[3*tp]+y*pts[3*tp+1]+z*pts[3*tp+2];</div>
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>&#160; <span class="keywordflow">if</span>(t&gt;g) {</div>
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];</div>
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>&#160; up=tp;</div>
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>&#160; <span class="keywordflow">while</span> (t&lt;rsq) {</div>
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>&#160; <span class="keywordflow">if</span>(++count&gt;=<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) {</div>
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=1</span></div>
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>&#160;<span class="preprocessor"></span> fputs(<span class="stringliteral">&quot;Bailed out of convex calculation&quot;</span>,stderr);</div>
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>&#160;<span class="preprocessor"></span> <span class="keywordflow">for</span>(tp=0;tp&lt;p;tp++) if(x*pts[3*tp]+y*pts[3*tp+1]+z*pts[3*tp+2]&gt;rsq) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>&#160; }</div>
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>&#160;</div>
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>&#160; <span class="comment">// Test all the neighbors of the current point</span></div>
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>&#160; <span class="comment">// and find the one which is closest to the</span></div>
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>&#160; <span class="comment">// plane</span></div>
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>&#160; <span class="keywordflow">for</span>(us=0;us&lt;ls;us++) {</div>
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>&#160; tp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>&#160; g=x*pts[3*tp]+y*pts[3*tp+1]+z*pts[3*tp+2];</div>
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>&#160; <span class="keywordflow">if</span>(g&gt;t) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>&#160; }</div>
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>&#160; <span class="keywordflow">if</span>(us==ls) {</div>
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>&#160; us++;</div>
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>&#160; <span class="keywordflow">while</span>(us&lt;nu[up]) {</div>
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>&#160; tp=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][us];</div>
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>&#160; g=x*pts[3*tp]+y*pts[3*tp+1]+z*pts[3*tp+2];</div>
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>&#160; <span class="keywordflow">if</span>(g&gt;t) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>&#160; us++;</div>
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>&#160; }</div>
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>&#160; <span class="keywordflow">if</span>(us==nu[up]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>&#160; }</div>
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>&#160; ls=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>][nu[<a class="code" href="classvoro_1_1voronoicell__base.html#a7746d94ae036439d60c3e4a9e37f6d15">up</a>]+us];up=tp;t=g;</div>
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>&#160; }</div>
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>&#160; }</div>
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>&#160; }</div>
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>&#160;}</div>
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>&#160;<span class="comment">/** Counts the number of edges of the Voronoi cell.</span></div>
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>&#160;<span class="comment"> * \return the number of edges. */</span></div>
<div class="line"><a name="l02007"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a5dbd3cd4e9e9a41744e1a2a4c8f550c0"> 2007</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a5dbd3cd4e9e9a41744e1a2a4c8f550c0">voronoicell_base::number_of_edges</a>() {</div>
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160; <span class="keywordtype">int</span> edges=0,*nup=<a class="code" href="classvoro_1_1voronoicell__base.html#abc7ec6777725e0ddffbbe2ecbe81c6a1">nu</a>;</div>
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>&#160; <span class="keywordflow">while</span>(nup&lt;nu+<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>) edges+=*(nup++);</div>
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>&#160; <span class="keywordflow">return</span> edges&gt;&gt;1;</div>
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>&#160;}</div>
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>&#160;<span class="comment">/** Outputs a custom string of information about the Voronoi cell. The string</span></div>
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>&#160;<span class="comment"> * of information follows a similar style as the C printf command, and detailed</span></div>
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>&#160;<span class="comment"> * information about its format is available at</span></div>
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>&#160;<span class="comment"> * http://math.lbl.gov/voro++/doc/custom.html.</span></div>
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>&#160;<span class="comment"> * \param[in] format the custom string to print.</span></div>
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>&#160;<span class="comment"> * \param[in] i the ID of the particle associated with this Voronoi cell.</span></div>
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>&#160;<span class="comment"> * \param[in] (x,y,z) the position of the particle associated with this Voronoi</span></div>
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>&#160;<span class="comment"> * cell.</span></div>
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>&#160;<span class="comment"> * \param[in] r a radius associated with the particle.</span></div>
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>&#160;<span class="comment"> * \param[in] fp the file handle to write to. */</span></div>
<div class="line"><a name="l02023"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#ab6b8ff237f7b3e318c3756cd38586ec4"> 2023</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a095c6bfc1b9b7a087d0b35b443e5c023">voronoicell_base::output_custom</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *format,<span class="keywordtype">int</span> i,<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">double</span> r,FILE *fp) {</div>
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>&#160; <span class="keywordtype">char</span> *fmp=(<span class="keyword">const_cast&lt;</span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(format));</div>
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>&#160; std::vector&lt;int&gt; vi;</div>
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>&#160; std::vector&lt;double&gt; vd;</div>
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>&#160; <span class="keywordflow">while</span>(*fmp!=0) {</div>
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>&#160; <span class="keywordflow">if</span>(*fmp==<span class="charliteral">&#39;%&#39;</span>) {</div>
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>&#160; fmp++;</div>
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>&#160; <span class="keywordflow">switch</span>(*fmp) {</div>
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>&#160;</div>
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>&#160; <span class="comment">// Particle-related output</span></div>
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;i&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%d&quot;</span>,i);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;x&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,x);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;y&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,y);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;z&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,z);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;q&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g %g %g&quot;</span>,x,y,z);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;r&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,r);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>&#160;</div>
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>&#160; <span class="comment">// Vertex-related output</span></div>
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;w&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;p&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#aee879731b1f4feb9f630d9b7f9c0062f">output_vertices</a>(fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;P&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#aee879731b1f4feb9f630d9b7f9c0062f">output_vertices</a>(x,y,z,fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;o&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#af92d19d0e7fc07006bcd8ea30c9df447">output_vertex_orders</a>(fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;m&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,0.25*<a class="code" href="classvoro_1_1voronoicell__base.html#a6a29a361a158db038a5c4c8e47322bd5">max_radius_squared</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>&#160;</div>
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>&#160; <span class="comment">// Edge-related output</span></div>
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;g&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a5dbd3cd4e9e9a41744e1a2a4c8f550c0">number_of_edges</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;E&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a94fc0aba05c11fba465449bc1c4217e9">total_edge_distance</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;e&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#a335daba5a84e43c278384cae6ecefff3">face_perimeters</a>(vd);voro_print_vector(vd,fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>&#160;</div>
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>&#160; <span class="comment">// Face-related output</span></div>
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;s&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a56b835abe6d47cb67b206202125eb406">number_of_faces</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;F&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#af1a68eea414a0a52b072005af7bd710a">surface_area</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;A&#39;</span>: {</div>
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a9df53445116446fafea8ffc4ee1afa76">face_freq_table</a>(vi);</div>
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>&#160; voro_print_vector(vi,fp);</div>
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>&#160; } <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;a&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#af9bad3fddace8e63ac4c0a5874aee7c5">face_orders</a>(vi);voro_print_vector(vi,fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;f&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#a4e6698c49580b3a64046230e02f0f8ea">face_areas</a>(vd);voro_print_vector(vd,fp);<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;t&#39;</span>: {</div>
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a83e74ffece2b313f6691f467769a16f5">face_vertices</a>(vi);</div>
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>&#160; voro_print_face_vertices(vi,fp);</div>
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>&#160; } <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;l&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#aebbbd4815cfbbe5cb1c71a682872664d">normals</a>(vd);</div>
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>&#160; voro_print_positions(vd,fp);</div>
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;n&#39;</span>: <a class="code" href="classvoro_1_1voronoicell__base.html#a59dd181ccbcc66370ef8b5c4bf250843">neighbors</a>(vi);</div>
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>&#160; voro_print_vector(vi,fp);</div>
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>&#160;</div>
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>&#160; <span class="comment">// Volume-related output</span></div>
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;v&#39;</span>: fprintf(fp,<span class="stringliteral">&quot;%g&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a92f69986a6f78e7b8b6d9f5778ed99ba">volume</a>());<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;c&#39;</span>: {</div>
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>&#160; <span class="keywordtype">double</span> cx,cy,cz;</div>
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a7ea57c92bba3110da745381c5877cec3">centroid</a>(cx,cy,cz);</div>
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>&#160; fprintf(fp,<span class="stringliteral">&quot;%g %g %g&quot;</span>,cx,cy,cz);</div>
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>&#160; } <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>&#160; <span class="keywordflow">case</span> <span class="charliteral">&#39;C&#39;</span>: {</div>
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>&#160; <span class="keywordtype">double</span> cx,cy,cz;</div>
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a7ea57c92bba3110da745381c5877cec3">centroid</a>(cx,cy,cz);</div>
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>&#160; fprintf(fp,<span class="stringliteral">&quot;%g %g %g&quot;</span>,x+cx,y+cy,z+cz);</div>
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>&#160; } <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>&#160;</div>
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>&#160; <span class="comment">// End-of-string reached</span></div>
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>&#160; <span class="keywordflow">case</span> 0: fmp--;<span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>&#160;</div>
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>&#160; <span class="comment">// The percent sign is not part of a</span></div>
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>&#160; <span class="comment">// control sequence</span></div>
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>&#160; <span class="keywordflow">default</span>: putc(<span class="charliteral">&#39;%&#39;</span>,fp);putc(*fmp,fp);</div>
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>&#160; }</div>
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>&#160; } <span class="keywordflow">else</span> putc(*fmp,fp);</div>
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>&#160; fmp++;</div>
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>&#160; }</div>
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>&#160; fputs(<span class="stringliteral">&quot;\n&quot;</span>,fp);</div>
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>&#160;}</div>
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>&#160;<span class="comment">/** This initializes the class to be a rectangular box. It calls the base class</span></div>
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>&#160;<span class="comment"> * initialization routine to set up the edge and vertex information, and then</span></div>
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>&#160;<span class="comment"> * sets up the neighbor information, with initial faces being assigned ID</span></div>
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>&#160;<span class="comment"> * numbers from -1 to -6.</span></div>
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>&#160;<span class="comment"> * \param[in] (xmin,xmax) the minimum and maximum x coordinates.</span></div>
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>&#160;<span class="comment"> * \param[in] (ymin,ymax) the minimum and maximum y coordinates.</span></div>
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>&#160;<span class="comment"> * \param[in] (zmin,zmax) the minimum and maximum z coordinates. */</span></div>
<div class="line"><a name="l02105"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#ac20bf4f827fd1fc20c1596a8cec95fa3"> 2105</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#ac20bf4f827fd1fc20c1596a8cec95fa3">voronoicell_neighbor::init</a>(<span class="keywordtype">double</span> xmin,<span class="keywordtype">double</span> xmax,<span class="keywordtype">double</span> ymin,<span class="keywordtype">double</span> ymax,<span class="keywordtype">double</span> zmin,<span class="keywordtype">double</span> zmax) {</div>
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a4c7f5406ba3beb1aa0d047592316c68d">init_base</a>(xmin,xmax,ymin,ymax,zmin,zmax);</div>
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[3];</div>
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>&#160; *q=-5;q[1]=-3;q[2]=-1;</div>
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>&#160; q[3]=-5;q[4]=-2;q[5]=-3;</div>
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>&#160; q[6]=-5;q[7]=-1;q[8]=-4;</div>
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>&#160; q[9]=-5;q[10]=-4;q[11]=-2;</div>
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>&#160; q[12]=-6;q[13]=-1;q[14]=-3;</div>
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>&#160; q[15]=-6;q[16]=-3;q[17]=-2;</div>
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>&#160; q[18]=-6;q[19]=-4;q[20]=-1;</div>
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>&#160; q[21]=-6;q[22]=-2;q[23]=-4;</div>
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>=q;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[1]=q+3;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[2]=q+6;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[3]=q+9;</div>
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>&#160; <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[4]=q+12;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[5]=q+15;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[6]=q+18;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[7]=q+21;</div>
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>&#160;}</div>
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>&#160;<span class="comment">/** This initializes the class to be an octahedron. It calls the base class</span></div>
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>&#160;<span class="comment"> * initialization routine to set up the edge and vertex information, and then</span></div>
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>&#160;<span class="comment"> * sets up the neighbor information, with the initial faces being assigned ID</span></div>
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>&#160;<span class="comment"> * numbers from -1 to -8.</span></div>
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>&#160;<span class="comment"> * \param[in] l The distance from the octahedron center to a vertex. Six</span></div>
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>&#160;<span class="comment"> * vertices are initialized at (-l,0,0), (l,0,0), (0,-l,0),</span></div>
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>&#160;<span class="comment"> * (0,l,0), (0,0,-l), and (0,0,l). */</span></div>
<div class="line"><a name="l02127"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a3648ccb2b3bdf7832779ea7d311d129c"> 2127</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a3648ccb2b3bdf7832779ea7d311d129c">voronoicell_neighbor::init_octahedron</a>(<span class="keywordtype">double</span> l) {</div>
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#aab954caa57c67a26c03b0377f5778bb1">init_octahedron_base</a>(l);</div>
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[4];</div>
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>&#160; *q=-5;q[1]=-6;q[2]=-7;q[3]=-8;</div>
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>&#160; q[4]=-1;q[5]=-2;q[6]=-3;q[7]=-4;</div>
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>&#160; q[8]=-6;q[9]=-5;q[10]=-2;q[11]=-1;</div>
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>&#160; q[12]=-8;q[13]=-7;q[14]=-4;q[15]=-3;</div>
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>&#160; q[16]=-5;q[17]=-8;q[18]=-3;q[19]=-2;</div>
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>&#160; q[20]=-7;q[21]=-6;q[22]=-1;q[23]=-4;</div>
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>=q;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[1]=q+4;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[2]=q+8;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[3]=q+12;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[4]=q+16;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[5]=q+20;</div>
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>&#160;}</div>
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>&#160;<span class="comment">/** This initializes the class to be a tetrahedron. It calls the base class</span></div>
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>&#160;<span class="comment"> * initialization routine to set up the edge and vertex information, and then</span></div>
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>&#160;<span class="comment"> * sets up the neighbor information, with the initial faces being assigned ID</span></div>
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>&#160;<span class="comment"> * numbers from -1 to -4.</span></div>
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>&#160;<span class="comment"> * \param (x0,y0,z0) a position vector for the first vertex.</span></div>
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>&#160;<span class="comment"> * \param (x1,y1,z1) a position vector for the second vertex.</span></div>
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>&#160;<span class="comment"> * \param (x2,y2,z2) a position vector for the third vertex.</span></div>
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>&#160;<span class="comment"> * \param (x3,y3,z3) a position vector for the fourth vertex. */</span></div>
<div class="line"><a name="l02147"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a71f908538fa59e4a1ab1d44834f1f3f9"> 2147</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a71f908538fa59e4a1ab1d44834f1f3f9">voronoicell_neighbor::init_tetrahedron</a>(<span class="keywordtype">double</span> x0,<span class="keywordtype">double</span> y0,<span class="keywordtype">double</span> z0,<span class="keywordtype">double</span> x1,<span class="keywordtype">double</span> y1,<span class="keywordtype">double</span> z1,<span class="keywordtype">double</span> x2,<span class="keywordtype">double</span> y2,<span class="keywordtype">double</span> z2,<span class="keywordtype">double</span> x3,<span class="keywordtype">double</span> y3,<span class="keywordtype">double</span> z3) {</div>
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#ae71280e1c36c5f840f870d55e91c027b">init_tetrahedron_base</a>(x0,y0,z0,x1,y1,z1,x2,y2,z2,x3,y3,z3);</div>
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>&#160; <span class="keywordtype">int</span> *q=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[3];</div>
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>&#160; *q=-4;q[1]=-3;q[2]=-2;</div>
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>&#160; q[3]=-3;q[4]=-4;q[5]=-1;</div>
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>&#160; q[6]=-4;q[7]=-2;q[8]=-1;</div>
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>&#160; q[9]=-2;q[10]=-3;q[11]=-1;</div>
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>&#160; *<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>=q;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[1]=q+3;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[2]=q+6;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[3]=q+9;</div>
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>&#160;}</div>
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>&#160;<span class="comment">/** This routine checks to make sure the neighbor information of each face is</span></div>
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>&#160;<span class="comment"> * consistent. */</span></div>
<div class="line"><a name="l02159"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#aa3d80872ecb0dbccbc951082428c13c1"> 2159</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aa3d80872ecb0dbccbc951082428c13c1">voronoicell_neighbor::check_facets</a>() {</div>
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m,q;</div>
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>&#160; q=<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[i][j];</div>
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[k][l]!=q) fprintf(stderr,<span class="stringliteral">&quot;Facet error at (%d,%d)=%d, started from (%d,%d)=%d\n&quot;</span>,k,l,<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[k][l],i,j,q);</div>
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>&#160; k=m;</div>
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>&#160; }</div>
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>&#160; }</div>
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>&#160;}</div>
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>&#160;<span class="comment">/** The class constructor allocates memory for storing neighbor information. */</span></div>
<div class="line"><a name="l02180"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a4fdf7a7b46bb5b8e6c9613308ad399c0"> 2180</a></span>&#160;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a4fdf7a7b46bb5b8e6c9613308ad399c0">voronoicell_neighbor::voronoicell_neighbor</a>() {</div>
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>&#160; <span class="keywordtype">int</span> i;</div>
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>&#160; <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>=<span class="keyword">new</span> <span class="keywordtype">int</span>*[<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>];</div>
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>&#160; <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>=<span class="keyword">new</span> <span class="keywordtype">int</span>*[<a class="code" href="classvoro_1_1voronoicell__base.html#ab0b624e4e72fca14c99bf1c41c430614">current_vertices</a>];</div>
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>&#160; <span class="keywordflow">for</span>(i=0;i&lt;3;i++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_n_vertices*i];</div>
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>&#160; <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[3]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_3_vertices*3];</div>
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>&#160; <span class="keywordflow">for</span>(i=4;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a14c97918200da778388673728da29274">current_vertex_order</a>;i++) <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i]=<span class="keyword">new</span> <span class="keywordtype">int</span>[init_n_vertices*i];</div>
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>&#160;}</div>
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>&#160;<span class="comment">/** The class destructor frees the dynamically allocated memory for storing</span></div>
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>&#160;<span class="comment"> * neighbor information. */</span></div>
<div class="line"><a name="l02191"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a196e44ab9b3caf7d5862fa47ee3341fe"> 2191</a></span>&#160;<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a196e44ab9b3caf7d5862fa47ee3341fe">voronoicell_neighbor::~voronoicell_neighbor</a>() {</div>
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=current_vertex_order-1;i&gt;=0;i--) <span class="keywordflow">if</span>(mem[i]&gt;0) <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>[i];</div>
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__neighbor.html#aaa1c991b6f5af826bac0f4c7d5f6bf5c">mne</a>;</div>
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>&#160; <span class="keyword">delete</span> [] <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>;</div>
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>&#160;}</div>
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>&#160;<span class="comment">/** Computes a vector list of neighbors. */</span></div>
<div class="line"><a name="l02198"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a1b18405092d2229e1001933925f403ca"> 2198</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a1b18405092d2229e1001933925f403ca">voronoicell_neighbor::neighbors</a>(std::vector&lt;int&gt; &amp;v) {</div>
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>&#160; v.clear();</div>
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>&#160; <span class="keywordtype">int</span> i,j,k,l,m;</div>
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>&#160; <span class="keywordflow">for</span>(i=1;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++) <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) {</div>
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>&#160; k=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j];</div>
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>&#160; <span class="keywordflow">if</span>(k&gt;=0) {</div>
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>&#160; v.push_back(<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[i][j]);</div>
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]=-1-k;</div>
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][nu[i]+j],k);</div>
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>&#160; m=<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l];</div>
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][l]=-1-m;</div>
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>&#160; l=<a class="code" href="classvoro_1_1voronoicell__base.html#a1d86762311d8860960a45cc409b14f0f">cycle_up</a>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[k][nu[k]+l],m);</div>
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>&#160; k=m;</div>
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>&#160; } <span class="keywordflow">while</span> (k!=i);</div>
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>&#160; }</div>
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>&#160; }</div>
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#a5d09c9e36ad159fcd23cfef8855cae61">reset_edges</a>();</div>
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>&#160;}</div>
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>&#160;<span class="comment">/** Prints the vertices, their edges, the relation table, and also notifies if</span></div>
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>&#160;<span class="comment"> * any memory errors are visible. */</span></div>
<div class="line"><a name="l02220"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__base.html#a8a7e29d041abbd58406e2c05a9a6248a"> 2220</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a8a7e29d041abbd58406e2c05a9a6248a">voronoicell_base::print_edges</a>() {</div>
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>&#160; <span class="keywordtype">int</span> j;</div>
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>&#160; <span class="keywordtype">double</span> *ptsp=<a class="code" href="classvoro_1_1voronoicell__base.html#aa4e3f22d4ff450097571e95caeda1b3d">pts</a>;</div>
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="classvoro_1_1voronoicell__base.html#a7e69469f95464afbeb9feec927507243">p</a>;i++,ptsp+=3) {</div>
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>&#160; printf(<span class="stringliteral">&quot;%d %d &quot;</span>,i,nu[i]);</div>
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>&#160; <span class="keywordflow">for</span>(j=0;j&lt;nu[i];j++) printf(<span class="stringliteral">&quot; %d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]);</div>
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>&#160; printf(<span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>&#160; <span class="keywordflow">while</span>(j&lt;(nu[i]&lt;&lt;1)) printf(<span class="stringliteral">&quot; %d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]);</div>
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>&#160; printf(<span class="stringliteral">&quot; %d&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i][j]);</div>
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>&#160; <a class="code" href="classvoro_1_1voronoicell__base.html#ac164b3767ce186360fb3308e349e058c">print_edges_neighbors</a>(i);</div>
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>&#160; printf(<span class="stringliteral">&quot; %g %g %g %p&quot;</span>,*ptsp,ptsp[1],ptsp[2],(<span class="keywordtype">void</span>*) <a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i]);</div>
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>&#160; <span class="keywordflow">if</span>(<a class="code" href="classvoro_1_1voronoicell__base.html#a85fec05865342d7efca9d9fd11b60342">ed</a>[i]&gt;=<a class="code" href="classvoro_1_1voronoicell__base.html#a2b115cbde725e468000a1da234b2fc66">mep</a>[nu[i]]+<a class="code" href="classvoro_1_1voronoicell__base.html#accebb51f721d72fc6d460f1368180571">mec</a>[nu[i]]*((nu[i]&lt;&lt;1)+1)) puts(<span class="stringliteral">&quot; Memory error&quot;</span>);</div>
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>&#160; <span class="keywordflow">else</span> puts(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>&#160; }</div>
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>&#160;}</div>
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>&#160;<span class="comment">/** This prints out the neighbor information for vertex i. */</span></div>
<div class="line"><a name="l02237"></a><span class="lineno"><a class="code" href="classvoro_1_1voronoicell__neighbor.html#a868581daaec73455618629e668c92d38"> 2237</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__neighbor.html#a868581daaec73455618629e668c92d38">voronoicell_neighbor::print_edges_neighbors</a>(<span class="keywordtype">int</span> i) {</div>
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>&#160; <span class="keywordflow">if</span>(nu[i]&gt;0) {</div>
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>&#160; <span class="keywordtype">int</span> j=0;</div>
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>&#160; printf(<span class="stringliteral">&quot; (&quot;</span>);</div>
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>&#160; <span class="keywordflow">while</span>(j&lt;nu[i]-1) printf(<span class="stringliteral">&quot;%d,&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[i][j++]);</div>
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>&#160; printf(<span class="stringliteral">&quot;%d)&quot;</span>,<a class="code" href="classvoro_1_1voronoicell__neighbor.html#a7c061d08eac012b23588032779603a19">ne</a>[i][j]);</div>
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>&#160; } <span class="keywordflow">else</span> printf(<span class="stringliteral">&quot; ()&quot;</span>);</div>
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>&#160;}</div>
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>&#160;</div>
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>&#160;<span class="comment">// Explicit instantiation</span></div>
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a33184cd45a3090291a080c4aff08a2fd">voronoicell_base::nplane</a>(<a class="code" href="classvoro_1_1voronoicell.html" title="Extension of the voronoicell_base class to represent a Voronoi cell without neighbor information...">voronoicell</a>&amp;,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voronoicell__base.html#a33184cd45a3090291a080c4aff08a2fd">voronoicell_base::nplane</a>(<a class="code" href="classvoro_1_1voronoicell__neighbor.html" title="Extension of the voronoicell_base class to represent a Voronoi cell with neighbor information...">voronoicell_neighbor</a>&amp;,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b">voronoicell_base::check_memory_for_copy</a>(<a class="code" href="classvoro_1_1voronoicell.html" title="Extension of the voronoicell_base class to represent a Voronoi cell without neighbor information...">voronoicell</a>&amp;,<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>*);</div>
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voronoicell__base.html#af2c9d916f946ba8d9c7e4c0a7e65215b">voronoicell_base::check_memory_for_copy</a>(<a class="code" href="classvoro_1_1voronoicell__neighbor.html" title="Extension of the voronoicell_base class to represent a Voronoi cell with neighbor information...">voronoicell_neighbor</a>&amp;,<a class="code" href="classvoro_1_1voronoicell__base.html" title="A class representing a single Voronoi cell.">voronoicell_base</a>*);</div>
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>&#160;</div>
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>&#160;}</div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Jul 27 2012 21:53:30 for Voro++ by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>

Event Timeline

c4science · Help