commons-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r959801 [5/10] - in /websites/production/commons/content/proper/commons-math/apidocs: ./ org/apache/commons/math3/exception/class-use/ org/apache/commons/math3/fraction/ org/apache/commons/math3/geometry/euclidean/oned/class-use/ org/apache...
Date Mon, 27 Jul 2015 19:40:06 GMT
Modified: websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/geometry/euclidean/threed/PolyhedronsSet.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/geometry/euclidean/threed/PolyhedronsSet.html (original)
+++ websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/geometry/euclidean/threed/PolyhedronsSet.html Mon Jul 27 19:40:06 2015
@@ -24,726 +24,727 @@
 <span class="sourceLineNo">016</span> */<a name="line.16"></a>
 <span class="sourceLineNo">017</span>package org.apache.commons.math3.geometry.euclidean.threed;<a name="line.17"></a>
 <span class="sourceLineNo">018</span><a name="line.18"></a>
-<span class="sourceLineNo">019</span>import java.awt.geom.AffineTransform;<a name="line.19"></a>
-<span class="sourceLineNo">020</span>import java.util.ArrayList;<a name="line.20"></a>
-<span class="sourceLineNo">021</span>import java.util.Arrays;<a name="line.21"></a>
-<span class="sourceLineNo">022</span>import java.util.Collection;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import java.util.List;<a name="line.23"></a>
-<span class="sourceLineNo">024</span><a name="line.24"></a>
-<span class="sourceLineNo">025</span>import org.apache.commons.math3.exception.MathIllegalArgumentException;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import org.apache.commons.math3.exception.NumberIsTooSmallException;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import org.apache.commons.math3.exception.util.LocalizedFormats;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.apache.commons.math3.geometry.Point;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.commons.math3.geometry.euclidean.oned.Euclidean1D;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.commons.math3.geometry.euclidean.twod.Euclidean2D;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.commons.math3.geometry.euclidean.twod.PolygonsSet;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import org.apache.commons.math3.geometry.euclidean.twod.SubLine;<a name="line.32"></a>
-<span class="sourceLineNo">033</span>import org.apache.commons.math3.geometry.euclidean.twod.Vector2D;<a name="line.33"></a>
-<span class="sourceLineNo">034</span>import org.apache.commons.math3.geometry.partitioning.AbstractRegion;<a name="line.34"></a>
-<span class="sourceLineNo">035</span>import org.apache.commons.math3.geometry.partitioning.BSPTree;<a name="line.35"></a>
-<span class="sourceLineNo">036</span>import org.apache.commons.math3.geometry.partitioning.BSPTreeVisitor;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>import org.apache.commons.math3.geometry.partitioning.BoundaryAttribute;<a name="line.37"></a>
-<span class="sourceLineNo">038</span>import org.apache.commons.math3.geometry.partitioning.Hyperplane;<a name="line.38"></a>
-<span class="sourceLineNo">039</span>import org.apache.commons.math3.geometry.partitioning.Region;<a name="line.39"></a>
-<span class="sourceLineNo">040</span>import org.apache.commons.math3.geometry.partitioning.RegionFactory;<a name="line.40"></a>
-<span class="sourceLineNo">041</span>import org.apache.commons.math3.geometry.partitioning.SubHyperplane;<a name="line.41"></a>
-<span class="sourceLineNo">042</span>import org.apache.commons.math3.geometry.partitioning.Transform;<a name="line.42"></a>
-<span class="sourceLineNo">043</span>import org.apache.commons.math3.util.FastMath;<a name="line.43"></a>
-<span class="sourceLineNo">044</span><a name="line.44"></a>
-<span class="sourceLineNo">045</span>/** This class represents a 3D region: a set of polyhedrons.<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * @since 3.0<a name="line.46"></a>
-<span class="sourceLineNo">047</span> */<a name="line.47"></a>
-<span class="sourceLineNo">048</span>public class PolyhedronsSet extends AbstractRegion&lt;Euclidean3D, Euclidean2D&gt; {<a name="line.48"></a>
-<span class="sourceLineNo">049</span><a name="line.49"></a>
-<span class="sourceLineNo">050</span>    /** Default value for tolerance. */<a name="line.50"></a>
-<span class="sourceLineNo">051</span>    private static final double DEFAULT_TOLERANCE = 1.0e-10;<a name="line.51"></a>
-<span class="sourceLineNo">052</span><a name="line.52"></a>
-<span class="sourceLineNo">053</span>    /** Build a polyhedrons set representing the whole real line.<a name="line.53"></a>
-<span class="sourceLineNo">054</span>     * @param tolerance tolerance below which points are considered identical<a name="line.54"></a>
-<span class="sourceLineNo">055</span>     * @since 3.3<a name="line.55"></a>
-<span class="sourceLineNo">056</span>     */<a name="line.56"></a>
-<span class="sourceLineNo">057</span>    public PolyhedronsSet(final double tolerance) {<a name="line.57"></a>
-<span class="sourceLineNo">058</span>        super(tolerance);<a name="line.58"></a>
-<span class="sourceLineNo">059</span>    }<a name="line.59"></a>
-<span class="sourceLineNo">060</span><a name="line.60"></a>
-<span class="sourceLineNo">061</span>    /** Build a polyhedrons set from a BSP tree.<a name="line.61"></a>
-<span class="sourceLineNo">062</span>     * &lt;p&gt;The leaf nodes of the BSP tree &lt;em&gt;must&lt;/em&gt; have a<a name="line.62"></a>
-<span class="sourceLineNo">063</span>     * {@code Boolean} attribute representing the inside status of<a name="line.63"></a>
-<span class="sourceLineNo">064</span>     * the corresponding cell (true for inside cells, false for outside<a name="line.64"></a>
-<span class="sourceLineNo">065</span>     * cells). In order to avoid building too many small objects, it is<a name="line.65"></a>
-<span class="sourceLineNo">066</span>     * recommended to use the predefined constants<a name="line.66"></a>
-<span class="sourceLineNo">067</span>     * {@code Boolean.TRUE} and {@code Boolean.FALSE}&lt;/p&gt;<a name="line.67"></a>
-<span class="sourceLineNo">068</span>     * &lt;p&gt;<a name="line.68"></a>
-<span class="sourceLineNo">069</span>     * This constructor is aimed at expert use, as building the tree may<a name="line.69"></a>
-<span class="sourceLineNo">070</span>     * be a difficult task. It is not intended for general use and for<a name="line.70"></a>
-<span class="sourceLineNo">071</span>     * performances reasons does not check thoroughly its input, as this would<a name="line.71"></a>
-<span class="sourceLineNo">072</span>     * require walking the full tree each time. Failing to provide a tree with<a name="line.72"></a>
-<span class="sourceLineNo">073</span>     * the proper attributes, &lt;em&gt;will&lt;/em&gt; therefore generate problems like<a name="line.73"></a>
-<span class="sourceLineNo">074</span>     * {@link NullPointerException} or {@link ClassCastException} only later on.<a name="line.74"></a>
-<span class="sourceLineNo">075</span>     * This limitation is known and explains why this constructor is for expert<a name="line.75"></a>
-<span class="sourceLineNo">076</span>     * use only. The caller does have the responsibility to provided correct arguments.<a name="line.76"></a>
-<span class="sourceLineNo">077</span>     * &lt;/p&gt;<a name="line.77"></a>
-<span class="sourceLineNo">078</span>     * @param tree inside/outside BSP tree representing the region<a name="line.78"></a>
-<span class="sourceLineNo">079</span>     * @param tolerance tolerance below which points are considered identical<a name="line.79"></a>
-<span class="sourceLineNo">080</span>     * @since 3.3<a name="line.80"></a>
-<span class="sourceLineNo">081</span>     */<a name="line.81"></a>
-<span class="sourceLineNo">082</span>    public PolyhedronsSet(final BSPTree&lt;Euclidean3D&gt; tree, final double tolerance) {<a name="line.82"></a>
-<span class="sourceLineNo">083</span>        super(tree, tolerance);<a name="line.83"></a>
-<span class="sourceLineNo">084</span>    }<a name="line.84"></a>
-<span class="sourceLineNo">085</span><a name="line.85"></a>
-<span class="sourceLineNo">086</span>    /** Build a polyhedrons set from a Boundary REPresentation (B-rep) specified by sub-hyperplanes.<a name="line.86"></a>
-<span class="sourceLineNo">087</span>     * &lt;p&gt;The boundary is provided as a collection of {@link<a name="line.87"></a>
-<span class="sourceLineNo">088</span>     * SubHyperplane sub-hyperplanes}. Each sub-hyperplane has the<a name="line.88"></a>
-<span class="sourceLineNo">089</span>     * interior part of the region on its minus side and the exterior on<a name="line.89"></a>
-<span class="sourceLineNo">090</span>     * its plus side.&lt;/p&gt;<a name="line.90"></a>
-<span class="sourceLineNo">091</span>     * &lt;p&gt;The boundary elements can be in any order, and can form<a name="line.91"></a>
-<span class="sourceLineNo">092</span>     * several non-connected sets (like for example polyhedrons with holes<a name="line.92"></a>
-<span class="sourceLineNo">093</span>     * or a set of disjoint polyhedrons considered as a whole). In<a name="line.93"></a>
-<span class="sourceLineNo">094</span>     * fact, the elements do not even need to be connected together<a name="line.94"></a>
-<span class="sourceLineNo">095</span>     * (their topological connections are not used here). However, if the<a name="line.95"></a>
-<span class="sourceLineNo">096</span>     * boundary does not really separate an inside open from an outside<a name="line.96"></a>
-<span class="sourceLineNo">097</span>     * open (open having here its topological meaning), then subsequent<a name="line.97"></a>
-<span class="sourceLineNo">098</span>     * calls to the {@link Region#checkPoint(Point) checkPoint} method will<a name="line.98"></a>
-<span class="sourceLineNo">099</span>     * not be meaningful anymore.&lt;/p&gt;<a name="line.99"></a>
-<span class="sourceLineNo">100</span>     * &lt;p&gt;If the boundary is empty, the region will represent the whole<a name="line.100"></a>
-<span class="sourceLineNo">101</span>     * space.&lt;/p&gt;<a name="line.101"></a>
-<span class="sourceLineNo">102</span>     * @param boundary collection of boundary elements, as a<a name="line.102"></a>
-<span class="sourceLineNo">103</span>     * collection of {@link SubHyperplane SubHyperplane} objects<a name="line.103"></a>
-<span class="sourceLineNo">104</span>     * @param tolerance tolerance below which points are considered identical<a name="line.104"></a>
-<span class="sourceLineNo">105</span>     * @since 3.3<a name="line.105"></a>
-<span class="sourceLineNo">106</span>     */<a name="line.106"></a>
-<span class="sourceLineNo">107</span>    public PolyhedronsSet(final Collection&lt;SubHyperplane&lt;Euclidean3D&gt;&gt; boundary,<a name="line.107"></a>
-<span class="sourceLineNo">108</span>                          final double tolerance) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span>        super(boundary, tolerance);<a name="line.109"></a>
-<span class="sourceLineNo">110</span>    }<a name="line.110"></a>
-<span class="sourceLineNo">111</span><a name="line.111"></a>
-<span class="sourceLineNo">112</span>    /** Build a polyhedrons set from a Boundary REPresentation (B-rep) specified by connected vertices.<a name="line.112"></a>
-<span class="sourceLineNo">113</span>     * &lt;p&gt;<a name="line.113"></a>
-<span class="sourceLineNo">114</span>     * The boundary is provided as a list of vertices and a list of facets.<a name="line.114"></a>
-<span class="sourceLineNo">115</span>     * Each facet is specified as an integer array containing the arrays vertices<a name="line.115"></a>
-<span class="sourceLineNo">116</span>     * indices in the vertices list. Each facet normal is oriented by right hand<a name="line.116"></a>
-<span class="sourceLineNo">117</span>     * rule to the facet vertices list.<a name="line.117"></a>
-<span class="sourceLineNo">118</span>     * &lt;/p&gt;<a name="line.118"></a>
-<span class="sourceLineNo">119</span>     * &lt;p&gt;<a name="line.119"></a>
-<span class="sourceLineNo">120</span>     * Some basic sanity checks are performed but not everything is thoroughly<a name="line.120"></a>
-<span class="sourceLineNo">121</span>     * assessed, so it remains under caller responsibility to ensure the vertices<a name="line.121"></a>
-<span class="sourceLineNo">122</span>     * and facets are consistent and properly define a polyhedrons set.<a name="line.122"></a>
-<span class="sourceLineNo">123</span>     * &lt;/p&gt;<a name="line.123"></a>
-<span class="sourceLineNo">124</span>     * @param vertices list of polyhedrons set vertices<a name="line.124"></a>
-<span class="sourceLineNo">125</span>     * @param facets list of facets, as vertices indices in the vertices list<a name="line.125"></a>
-<span class="sourceLineNo">126</span>     * @param tolerance tolerance below which points are considered identical<a name="line.126"></a>
-<span class="sourceLineNo">127</span>     * @exception MathIllegalArgumentException if some basic sanity checks fail<a name="line.127"></a>
-<span class="sourceLineNo">128</span>     * @since 3.5<a name="line.128"></a>
-<span class="sourceLineNo">129</span>     */<a name="line.129"></a>
-<span class="sourceLineNo">130</span>    public PolyhedronsSet(final List&lt;Vector3D&gt; vertices, final List&lt;int[]&gt; facets,<a name="line.130"></a>
-<span class="sourceLineNo">131</span>                          final double tolerance) {<a name="line.131"></a>
-<span class="sourceLineNo">132</span>        super(buildBoundary(vertices, facets, tolerance), tolerance);<a name="line.132"></a>
-<span class="sourceLineNo">133</span>    }<a name="line.133"></a>
-<span class="sourceLineNo">134</span><a name="line.134"></a>
-<span class="sourceLineNo">135</span>    /** Build a parallellepipedic box.<a name="line.135"></a>
-<span class="sourceLineNo">136</span>     * @param xMin low bound along the x direction<a name="line.136"></a>
-<span class="sourceLineNo">137</span>     * @param xMax high bound along the x direction<a name="line.137"></a>
-<span class="sourceLineNo">138</span>     * @param yMin low bound along the y direction<a name="line.138"></a>
-<span class="sourceLineNo">139</span>     * @param yMax high bound along the y direction<a name="line.139"></a>
-<span class="sourceLineNo">140</span>     * @param zMin low bound along the z direction<a name="line.140"></a>
-<span class="sourceLineNo">141</span>     * @param zMax high bound along the z direction<a name="line.141"></a>
-<span class="sourceLineNo">142</span>     * @param tolerance tolerance below which points are considered identical<a name="line.142"></a>
-<span class="sourceLineNo">143</span>     * @since 3.3<a name="line.143"></a>
-<span class="sourceLineNo">144</span>     */<a name="line.144"></a>
-<span class="sourceLineNo">145</span>    public PolyhedronsSet(final double xMin, final double xMax,<a name="line.145"></a>
-<span class="sourceLineNo">146</span>                          final double yMin, final double yMax,<a name="line.146"></a>
-<span class="sourceLineNo">147</span>                          final double zMin, final double zMax,<a name="line.147"></a>
-<span class="sourceLineNo">148</span>                          final double tolerance) {<a name="line.148"></a>
-<span class="sourceLineNo">149</span>        super(buildBoundary(xMin, xMax, yMin, yMax, zMin, zMax, tolerance), tolerance);<a name="line.149"></a>
-<span class="sourceLineNo">150</span>    }<a name="line.150"></a>
-<span class="sourceLineNo">151</span><a name="line.151"></a>
-<span class="sourceLineNo">152</span>    /** Build a polyhedrons set representing the whole real line.<a name="line.152"></a>
-<span class="sourceLineNo">153</span>     * @deprecated as of 3.3, replaced with {@link #PolyhedronsSet(double)}<a name="line.153"></a>
-<span class="sourceLineNo">154</span>     */<a name="line.154"></a>
-<span class="sourceLineNo">155</span>    @Deprecated<a name="line.155"></a>
-<span class="sourceLineNo">156</span>    public PolyhedronsSet() {<a name="line.156"></a>
-<span class="sourceLineNo">157</span>        this(DEFAULT_TOLERANCE);<a name="line.157"></a>
-<span class="sourceLineNo">158</span>    }<a name="line.158"></a>
-<span class="sourceLineNo">159</span><a name="line.159"></a>
-<span class="sourceLineNo">160</span>    /** Build a polyhedrons set from a BSP tree.<a name="line.160"></a>
-<span class="sourceLineNo">161</span>     * &lt;p&gt;The leaf nodes of the BSP tree &lt;em&gt;must&lt;/em&gt; have a<a name="line.161"></a>
-<span class="sourceLineNo">162</span>     * {@code Boolean} attribute representing the inside status of<a name="line.162"></a>
-<span class="sourceLineNo">163</span>     * the corresponding cell (true for inside cells, false for outside<a name="line.163"></a>
-<span class="sourceLineNo">164</span>     * cells). In order to avoid building too many small objects, it is<a name="line.164"></a>
-<span class="sourceLineNo">165</span>     * recommended to use the predefined constants<a name="line.165"></a>
-<span class="sourceLineNo">166</span>     * {@code Boolean.TRUE} and {@code Boolean.FALSE}&lt;/p&gt;<a name="line.166"></a>
-<span class="sourceLineNo">167</span>     * @param tree inside/outside BSP tree representing the region<a name="line.167"></a>
-<span class="sourceLineNo">168</span>     * @deprecated as of 3.3, replaced with {@link #PolyhedronsSet(BSPTree, double)}<a name="line.168"></a>
-<span class="sourceLineNo">169</span>     */<a name="line.169"></a>
-<span class="sourceLineNo">170</span>    @Deprecated<a name="line.170"></a>
-<span class="sourceLineNo">171</span>    public PolyhedronsSet(final BSPTree&lt;Euclidean3D&gt; tree) {<a name="line.171"></a>
-<span class="sourceLineNo">172</span>        this(tree, DEFAULT_TOLERANCE);<a name="line.172"></a>
-<span class="sourceLineNo">173</span>    }<a name="line.173"></a>
-<span class="sourceLineNo">174</span><a name="line.174"></a>
-<span class="sourceLineNo">175</span>    /** Build a polyhedrons set from a Boundary REPresentation (B-rep).<a name="line.175"></a>
-<span class="sourceLineNo">176</span>     * &lt;p&gt;The boundary is provided as a collection of {@link<a name="line.176"></a>
-<span class="sourceLineNo">177</span>     * SubHyperplane sub-hyperplanes}. Each sub-hyperplane has the<a name="line.177"></a>
-<span class="sourceLineNo">178</span>     * interior part of the region on its minus side and the exterior on<a name="line.178"></a>
-<span class="sourceLineNo">179</span>     * its plus side.&lt;/p&gt;<a name="line.179"></a>
-<span class="sourceLineNo">180</span>     * &lt;p&gt;The boundary elements can be in any order, and can form<a name="line.180"></a>
-<span class="sourceLineNo">181</span>     * several non-connected sets (like for example polyhedrons with holes<a name="line.181"></a>
-<span class="sourceLineNo">182</span>     * or a set of disjoint polyhedrons considered as a whole). In<a name="line.182"></a>
-<span class="sourceLineNo">183</span>     * fact, the elements do not even need to be connected together<a name="line.183"></a>
-<span class="sourceLineNo">184</span>     * (their topological connections are not used here). However, if the<a name="line.184"></a>
-<span class="sourceLineNo">185</span>     * boundary does not really separate an inside open from an outside<a name="line.185"></a>
-<span class="sourceLineNo">186</span>     * open (open having here its topological meaning), then subsequent<a name="line.186"></a>
-<span class="sourceLineNo">187</span>     * calls to the {@link Region#checkPoint(Point) checkPoint} method will<a name="line.187"></a>
-<span class="sourceLineNo">188</span>     * not be meaningful anymore.&lt;/p&gt;<a name="line.188"></a>
-<span class="sourceLineNo">189</span>     * &lt;p&gt;If the boundary is empty, the region will represent the whole<a name="line.189"></a>
-<span class="sourceLineNo">190</span>     * space.&lt;/p&gt;<a name="line.190"></a>
-<span class="sourceLineNo">191</span>     * @param boundary collection of boundary elements, as a<a name="line.191"></a>
-<span class="sourceLineNo">192</span>     * collection of {@link SubHyperplane SubHyperplane} objects<a name="line.192"></a>
-<span class="sourceLineNo">193</span>     * @deprecated as of 3.3, replaced with {@link #PolyhedronsSet(Collection, double)}<a name="line.193"></a>
-<span class="sourceLineNo">194</span>     */<a name="line.194"></a>
-<span class="sourceLineNo">195</span>    @Deprecated<a name="line.195"></a>
-<span class="sourceLineNo">196</span>    public PolyhedronsSet(final Collection&lt;SubHyperplane&lt;Euclidean3D&gt;&gt; boundary) {<a name="line.196"></a>
-<span class="sourceLineNo">197</span>        this(boundary, DEFAULT_TOLERANCE);<a name="line.197"></a>
-<span class="sourceLineNo">198</span>    }<a name="line.198"></a>
-<span class="sourceLineNo">199</span><a name="line.199"></a>
-<span class="sourceLineNo">200</span>    /** Build a parallellepipedic box.<a name="line.200"></a>
-<span class="sourceLineNo">201</span>     * @param xMin low bound along the x direction<a name="line.201"></a>
-<span class="sourceLineNo">202</span>     * @param xMax high bound along the x direction<a name="line.202"></a>
-<span class="sourceLineNo">203</span>     * @param yMin low bound along the y direction<a name="line.203"></a>
-<span class="sourceLineNo">204</span>     * @param yMax high bound along the y direction<a name="line.204"></a>
-<span class="sourceLineNo">205</span>     * @param zMin low bound along the z direction<a name="line.205"></a>
-<span class="sourceLineNo">206</span>     * @param zMax high bound along the z direction<a name="line.206"></a>
-<span class="sourceLineNo">207</span>     * @deprecated as of 3.3, replaced with {@link #PolyhedronsSet(double, double,<a name="line.207"></a>
-<span class="sourceLineNo">208</span>     * double, double, double, double, double)}<a name="line.208"></a>
-<span class="sourceLineNo">209</span>     */<a name="line.209"></a>
-<span class="sourceLineNo">210</span>    @Deprecated<a name="line.210"></a>
-<span class="sourceLineNo">211</span>    public PolyhedronsSet(final double xMin, final double xMax,<a name="line.211"></a>
-<span class="sourceLineNo">212</span>                          final double yMin, final double yMax,<a name="line.212"></a>
-<span class="sourceLineNo">213</span>                          final double zMin, final double zMax) {<a name="line.213"></a>
-<span class="sourceLineNo">214</span>        this(xMin, xMax, yMin, yMax, zMin, zMax, DEFAULT_TOLERANCE);<a name="line.214"></a>
-<span class="sourceLineNo">215</span>    }<a name="line.215"></a>
-<span class="sourceLineNo">216</span><a name="line.216"></a>
-<span class="sourceLineNo">217</span>    /** Build a parallellepipedic box boundary.<a name="line.217"></a>
-<span class="sourceLineNo">218</span>     * @param xMin low bound along the x direction<a name="line.218"></a>
-<span class="sourceLineNo">219</span>     * @param xMax high bound along the x direction<a name="line.219"></a>
-<span class="sourceLineNo">220</span>     * @param yMin low bound along the y direction<a name="line.220"></a>
-<span class="sourceLineNo">221</span>     * @param yMax high bound along the y direction<a name="line.221"></a>
-<span class="sourceLineNo">222</span>     * @param zMin low bound along the z direction<a name="line.222"></a>
-<span class="sourceLineNo">223</span>     * @param zMax high bound along the z direction<a name="line.223"></a>
-<span class="sourceLineNo">224</span>     * @param tolerance tolerance below which points are considered identical<a name="line.224"></a>
-<span class="sourceLineNo">225</span>     * @return boundary tree<a name="line.225"></a>
-<span class="sourceLineNo">226</span>     * @since 3.3<a name="line.226"></a>
-<span class="sourceLineNo">227</span>     */<a name="line.227"></a>
-<span class="sourceLineNo">228</span>    private static BSPTree&lt;Euclidean3D&gt; buildBoundary(final double xMin, final double xMax,<a name="line.228"></a>
-<span class="sourceLineNo">229</span>                                                      final double yMin, final double yMax,<a name="line.229"></a>
-<span class="sourceLineNo">230</span>                                                      final double zMin, final double zMax,<a name="line.230"></a>
-<span class="sourceLineNo">231</span>                                                      final double tolerance) {<a name="line.231"></a>
-<span class="sourceLineNo">232</span>        if ((xMin &gt;= xMax - tolerance) || (yMin &gt;= yMax - tolerance) || (zMin &gt;= zMax - tolerance)) {<a name="line.232"></a>
-<span class="sourceLineNo">233</span>            // too thin box, build an empty polygons set<a name="line.233"></a>
-<span class="sourceLineNo">234</span>            return new BSPTree&lt;Euclidean3D&gt;(Boolean.FALSE);<a name="line.234"></a>
-<span class="sourceLineNo">235</span>        }<a name="line.235"></a>
-<span class="sourceLineNo">236</span>        final Plane pxMin = new Plane(new Vector3D(xMin, 0,    0),   Vector3D.MINUS_I, tolerance);<a name="line.236"></a>
-<span class="sourceLineNo">237</span>        final Plane pxMax = new Plane(new Vector3D(xMax, 0,    0),   Vector3D.PLUS_I,  tolerance);<a name="line.237"></a>
-<span class="sourceLineNo">238</span>        final Plane pyMin = new Plane(new Vector3D(0,    yMin, 0),   Vector3D.MINUS_J, tolerance);<a name="line.238"></a>
-<span class="sourceLineNo">239</span>        final Plane pyMax = new Plane(new Vector3D(0,    yMax, 0),   Vector3D.PLUS_J,  tolerance);<a name="line.239"></a>
-<span class="sourceLineNo">240</span>        final Plane pzMin = new Plane(new Vector3D(0,    0,   zMin), Vector3D.MINUS_K, tolerance);<a name="line.240"></a>
-<span class="sourceLineNo">241</span>        final Plane pzMax = new Plane(new Vector3D(0,    0,   zMax), Vector3D.PLUS_K,  tolerance);<a name="line.241"></a>
-<span class="sourceLineNo">242</span>        @SuppressWarnings("unchecked")<a name="line.242"></a>
-<span class="sourceLineNo">243</span>        final Region&lt;Euclidean3D&gt; boundary =<a name="line.243"></a>
-<span class="sourceLineNo">244</span>        new RegionFactory&lt;Euclidean3D&gt;().buildConvex(pxMin, pxMax, pyMin, pyMax, pzMin, pzMax);<a name="line.244"></a>
-<span class="sourceLineNo">245</span>        return boundary.getTree(false);<a name="line.245"></a>
-<span class="sourceLineNo">246</span>    }<a name="line.246"></a>
-<span class="sourceLineNo">247</span><a name="line.247"></a>
-<span class="sourceLineNo">248</span>    /** Build boundary from vertices and facets.<a name="line.248"></a>
-<span class="sourceLineNo">249</span>     * @param vertices list of polyhedrons set vertices<a name="line.249"></a>
-<span class="sourceLineNo">250</span>     * @param facets list of facets, as vertices indices in the vertices list<a name="line.250"></a>
-<span class="sourceLineNo">251</span>     * @param tolerance tolerance below which points are considered identical<a name="line.251"></a>
-<span class="sourceLineNo">252</span>     * @return boundary as a list of sub-hyperplanes<a name="line.252"></a>
-<span class="sourceLineNo">253</span>     * @exception MathIllegalArgumentException if some basic sanity checks fail<a name="line.253"></a>
-<span class="sourceLineNo">254</span>     * @since 3.5<a name="line.254"></a>
-<span class="sourceLineNo">255</span>     */<a name="line.255"></a>
-<span class="sourceLineNo">256</span>    private static List&lt;SubHyperplane&lt;Euclidean3D&gt;&gt; buildBoundary(final List&lt;Vector3D&gt; vertices,<a name="line.256"></a>
-<span class="sourceLineNo">257</span>                                                                  final List&lt;int[]&gt; facets,<a name="line.257"></a>
-<span class="sourceLineNo">258</span>                                                                  final double tolerance) {<a name="line.258"></a>
-<span class="sourceLineNo">259</span><a name="line.259"></a>
-<span class="sourceLineNo">260</span>        // check vertices distances<a name="line.260"></a>
-<span class="sourceLineNo">261</span>        for (int i = 0; i &lt; vertices.size() - 1; ++i) {<a name="line.261"></a>
-<span class="sourceLineNo">262</span>            final Vector3D vi = vertices.get(i);<a name="line.262"></a>
-<span class="sourceLineNo">263</span>            for (int j = i + 1; j &lt; vertices.size(); ++j) {<a name="line.263"></a>
-<span class="sourceLineNo">264</span>                if (Vector3D.distance(vi, vertices.get(j)) &lt;= tolerance) {<a name="line.264"></a>
-<span class="sourceLineNo">265</span>                    throw new MathIllegalArgumentException(LocalizedFormats.CLOSE_VERTICES,<a name="line.265"></a>
-<span class="sourceLineNo">266</span>                                                           vi.getX(), vi.getY(), vi.getZ());<a name="line.266"></a>
-<span class="sourceLineNo">267</span>                }<a name="line.267"></a>
-<span class="sourceLineNo">268</span>            }<a name="line.268"></a>
-<span class="sourceLineNo">269</span>        }<a name="line.269"></a>
-<span class="sourceLineNo">270</span><a name="line.270"></a>
-<span class="sourceLineNo">271</span>        // find how vertices are referenced by facets<a name="line.271"></a>
-<span class="sourceLineNo">272</span>        final int[][] references = findReferences(vertices, facets);<a name="line.272"></a>
-<span class="sourceLineNo">273</span><a name="line.273"></a>
-<span class="sourceLineNo">274</span>        // find how vertices are linked together by edges along the facets they belong to<a name="line.274"></a>
-<span class="sourceLineNo">275</span>        final int[][] successors = successors(vertices, facets, references);<a name="line.275"></a>
-<span class="sourceLineNo">276</span><a name="line.276"></a>
-<span class="sourceLineNo">277</span>        // check edges orientations<a name="line.277"></a>
-<span class="sourceLineNo">278</span>        for (int vA = 0; vA &lt; vertices.size(); ++vA) {<a name="line.278"></a>
-<span class="sourceLineNo">279</span>            for (final int vB : successors[vA]) {<a name="line.279"></a>
-<span class="sourceLineNo">280</span><a name="line.280"></a>
-<span class="sourceLineNo">281</span>                if (vB &gt;= 0) {<a name="line.281"></a>
-<span class="sourceLineNo">282</span>                    // when facets are properly oriented, if vB is the successor of vA on facet f1,<a name="line.282"></a>
-<span class="sourceLineNo">283</span>                    // then there must be an adjacent facet f2 where vA is the successor of vB<a name="line.283"></a>
-<span class="sourceLineNo">284</span>                    boolean found = false;<a name="line.284"></a>
-<span class="sourceLineNo">285</span>                    for (final int v : successors[vB]) {<a name="line.285"></a>
-<span class="sourceLineNo">286</span>                        found = found || (v == vA);<a name="line.286"></a>
-<span class="sourceLineNo">287</span>                    }<a name="line.287"></a>
-<span class="sourceLineNo">288</span>                    if (!found) {<a name="line.288"></a>
-<span class="sourceLineNo">289</span>                        final Vector3D start = vertices.get(vA);<a name="line.289"></a>
-<span class="sourceLineNo">290</span>                        final Vector3D end   = vertices.get(vB);<a name="line.290"></a>
-<span class="sourceLineNo">291</span>                        throw new MathIllegalArgumentException(LocalizedFormats.EDGE_CONNECTED_TO_ONE_FACET,<a name="line.291"></a>
-<span class="sourceLineNo">292</span>                                                               start.getX(), start.getY(), start.getZ(),<a name="line.292"></a>
-<span class="sourceLineNo">293</span>                                                               end.getX(),   end.getY(),   end.getZ());<a name="line.293"></a>
-<span class="sourceLineNo">294</span>                    }<a name="line.294"></a>
-<span class="sourceLineNo">295</span>                }<a name="line.295"></a>
-<span class="sourceLineNo">296</span>            }<a name="line.296"></a>
-<span class="sourceLineNo">297</span>        }<a name="line.297"></a>
-<span class="sourceLineNo">298</span><a name="line.298"></a>
-<span class="sourceLineNo">299</span>        final List&lt;SubHyperplane&lt;Euclidean3D&gt;&gt; boundary = new ArrayList&lt;SubHyperplane&lt;Euclidean3D&gt;&gt;();<a name="line.299"></a>
-<span class="sourceLineNo">300</span><a name="line.300"></a>
-<span class="sourceLineNo">301</span>        for (final int[] facet : facets) {<a name="line.301"></a>
-<span class="sourceLineNo">302</span><a name="line.302"></a>
-<span class="sourceLineNo">303</span>            // define facet plane from the first 3 points<a name="line.303"></a>
-<span class="sourceLineNo">304</span>            Plane plane = new Plane(vertices.get(facet[0]), vertices.get(facet[1]), vertices.get(facet[2]),<a name="line.304"></a>
-<span class="sourceLineNo">305</span>                                    tolerance);<a name="line.305"></a>
-<span class="sourceLineNo">306</span><a name="line.306"></a>
-<span class="sourceLineNo">307</span>            // check all points are in the plane<a name="line.307"></a>
-<span class="sourceLineNo">308</span>            final Vector2D[] two2Points = new Vector2D[facet.length];<a name="line.308"></a>
-<span class="sourceLineNo">309</span>            for (int i = 0 ; i &lt; facet.length; ++i) {<a name="line.309"></a>
-<span class="sourceLineNo">310</span>                final Vector3D v = vertices.get(facet[i]);<a name="line.310"></a>
-<span class="sourceLineNo">311</span>                if (!plane.contains(v)) {<a name="line.311"></a>
-<span class="sourceLineNo">312</span>                    throw new MathIllegalArgumentException(LocalizedFormats.OUT_OF_PLANE,<a name="line.312"></a>
-<span class="sourceLineNo">313</span>                                                           v.getX(), v.getY(), v.getZ());<a name="line.313"></a>
-<span class="sourceLineNo">314</span>                }<a name="line.314"></a>
-<span class="sourceLineNo">315</span>                two2Points[i] = plane.toSubSpace(v);<a name="line.315"></a>
-<span class="sourceLineNo">316</span>            }<a name="line.316"></a>
-<span class="sourceLineNo">317</span><a name="line.317"></a>
-<span class="sourceLineNo">318</span>            // create the polygonal facet<a name="line.318"></a>
-<span class="sourceLineNo">319</span>            boundary.add(new SubPlane(plane, new PolygonsSet(tolerance, two2Points)));<a name="line.319"></a>
-<span class="sourceLineNo">320</span><a name="line.320"></a>
-<span class="sourceLineNo">321</span>        }<a name="line.321"></a>
-<span class="sourceLineNo">322</span><a name="line.322"></a>
-<span class="sourceLineNo">323</span>        return boundary;<a name="line.323"></a>
-<span class="sourceLineNo">324</span><a name="line.324"></a>
-<span class="sourceLineNo">325</span>    }<a name="line.325"></a>
-<span class="sourceLineNo">326</span><a name="line.326"></a>
-<span class="sourceLineNo">327</span>    /** Find the facets that reference each edges.<a name="line.327"></a>
-<span class="sourceLineNo">328</span>     * @param vertices list of polyhedrons set vertices<a name="line.328"></a>
-<span class="sourceLineNo">329</span>     * @param facets list of facets, as vertices indices in the vertices list<a name="line.329"></a>
-<span class="sourceLineNo">330</span>     * @return references array such that r[v][k] = f for some k if facet f contains vertex v<a name="line.330"></a>
-<span class="sourceLineNo">331</span>     * @exception MathIllegalArgumentException if some facets have fewer than 3 vertices<a name="line.331"></a>
-<span class="sourceLineNo">332</span>     * @since 3.5<a name="line.332"></a>
-<span class="sourceLineNo">333</span>     */<a name="line.333"></a>
-<span class="sourceLineNo">334</span>    private static int[][] findReferences(final List&lt;Vector3D&gt; vertices, final List&lt;int[]&gt; facets) {<a name="line.334"></a>
-<span class="sourceLineNo">335</span><a name="line.335"></a>
-<span class="sourceLineNo">336</span>        // find the maximum number of facets a vertex belongs to<a name="line.336"></a>
-<span class="sourceLineNo">337</span>        final int[] nbFacets = new int[vertices.size()];<a name="line.337"></a>
-<span class="sourceLineNo">338</span>        int maxFacets  = 0;<a name="line.338"></a>
-<span class="sourceLineNo">339</span>        for (final int[] facet : facets) {<a name="line.339"></a>
-<span class="sourceLineNo">340</span>            if (facet.length &lt; 3) {<a name="line.340"></a>
-<span class="sourceLineNo">341</span>                throw new NumberIsTooSmallException(LocalizedFormats.WRONG_NUMBER_OF_POINTS,<a name="line.341"></a>
-<span class="sourceLineNo">342</span>                                                    3, facet.length, true);<a name="line.342"></a>
-<span class="sourceLineNo">343</span>            }<a name="line.343"></a>
-<span class="sourceLineNo">344</span>            for (final int index : facet) {<a name="line.344"></a>
-<span class="sourceLineNo">345</span>                maxFacets = FastMath.max(maxFacets, ++nbFacets[index]);<a name="line.345"></a>
-<span class="sourceLineNo">346</span>            }<a name="line.346"></a>
-<span class="sourceLineNo">347</span>        }<a name="line.347"></a>
-<span class="sourceLineNo">348</span><a name="line.348"></a>
-<span class="sourceLineNo">349</span>        // set up the references array<a name="line.349"></a>
-<span class="sourceLineNo">350</span>        final int[][] references = new int[vertices.size()][maxFacets];<a name="line.350"></a>
-<span class="sourceLineNo">351</span>        for (int[] r : references) {<a name="line.351"></a>
-<span class="sourceLineNo">352</span>            Arrays.fill(r, -1);<a name="line.352"></a>
-<span class="sourceLineNo">353</span>        }<a name="line.353"></a>
-<span class="sourceLineNo">354</span>        for (int f = 0; f &lt; facets.size(); ++f) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span>            for (final int v : facets.get(f)) {<a name="line.355"></a>
-<span class="sourceLineNo">356</span>                // vertex v is referenced by facet f<a name="line.356"></a>
-<span class="sourceLineNo">357</span>                int k = 0;<a name="line.357"></a>
-<span class="sourceLineNo">358</span>                while (k &lt; maxFacets &amp;&amp; references[v][k] &gt;= 0) {<a name="line.358"></a>
-<span class="sourceLineNo">359</span>                    ++k;<a name="line.359"></a>
-<span class="sourceLineNo">360</span>                }<a name="line.360"></a>
-<span class="sourceLineNo">361</span>                references[v][k] = f;<a name="line.361"></a>
-<span class="sourceLineNo">362</span>            }<a name="line.362"></a>
-<span class="sourceLineNo">363</span>        }<a name="line.363"></a>
-<span class="sourceLineNo">364</span><a name="line.364"></a>
-<span class="sourceLineNo">365</span>        return references;<a name="line.365"></a>
-<span class="sourceLineNo">366</span><a name="line.366"></a>
-<span class="sourceLineNo">367</span>    }<a name="line.367"></a>
-<span class="sourceLineNo">368</span><a name="line.368"></a>
-<span class="sourceLineNo">369</span>    /** Find the successors of all vertices among all facets they belong to.<a name="line.369"></a>
-<span class="sourceLineNo">370</span>     * @param vertices list of polyhedrons set vertices<a name="line.370"></a>
-<span class="sourceLineNo">371</span>     * @param facets list of facets, as vertices indices in the vertices list<a name="line.371"></a>
-<span class="sourceLineNo">372</span>     * @param references facets references array<a name="line.372"></a>
-<span class="sourceLineNo">373</span>     * @return indices of vertices that follow vertex v in some facet (the array<a name="line.373"></a>
-<span class="sourceLineNo">374</span>     * may contain extra entries at the end, set to negative indices)<a name="line.374"></a>
-<span class="sourceLineNo">375</span>     * @exception MathIllegalArgumentException if the same vertex appears more than<a name="line.375"></a>
-<span class="sourceLineNo">376</span>     * once in the successors list (which means one facet orientation is wrong)<a name="line.376"></a>
-<span class="sourceLineNo">377</span>     * @since 3.5<a name="line.377"></a>
-<span class="sourceLineNo">378</span>     */<a name="line.378"></a>
-<span class="sourceLineNo">379</span>    private static int[][] successors(final List&lt;Vector3D&gt; vertices, final List&lt;int[]&gt; facets,<a name="line.379"></a>
-<span class="sourceLineNo">380</span>                                      final int[][] references) {<a name="line.380"></a>
-<span class="sourceLineNo">381</span><a name="line.381"></a>
-<span class="sourceLineNo">382</span>        // create an array large enough<a name="line.382"></a>
-<span class="sourceLineNo">383</span>        final int[][] successors = new int[vertices.size()][references[0].length];<a name="line.383"></a>
-<span class="sourceLineNo">384</span>        for (final int[] s : successors) {<a name="line.384"></a>
-<span class="sourceLineNo">385</span>            Arrays.fill(s, -1);<a name="line.385"></a>
-<span class="sourceLineNo">386</span>        }<a name="line.386"></a>
-<span class="sourceLineNo">387</span><a name="line.387"></a>
-<span class="sourceLineNo">388</span>        for (int v = 0; v &lt; vertices.size(); ++v) {<a name="line.388"></a>
-<span class="sourceLineNo">389</span>            for (int k = 0; k &lt; successors[v].length &amp;&amp; references[v][k] &gt;= 0; ++k) {<a name="line.389"></a>
-<span class="sourceLineNo">390</span><a name="line.390"></a>
-<span class="sourceLineNo">391</span>                // look for vertex v<a name="line.391"></a>
-<span class="sourceLineNo">392</span>                final int[] facet = facets.get(references[v][k]);<a name="line.392"></a>
-<span class="sourceLineNo">393</span>                int i = 0;<a name="line.393"></a>
-<span class="sourceLineNo">394</span>                while (i &lt; facet.length &amp;&amp; facet[i] != v) {<a name="line.394"></a>
-<span class="sourceLineNo">395</span>                    ++i;<a name="line.395"></a>
-<span class="sourceLineNo">396</span>                }<a name="line.396"></a>
-<span class="sourceLineNo">397</span><a name="line.397"></a>
-<span class="sourceLineNo">398</span>                // we have found vertex v, we deduce its successor on current facet<a name="line.398"></a>
-<span class="sourceLineNo">399</span>                successors[v][k] = facet[(i + 1) % facet.length];<a name="line.399"></a>
-<span class="sourceLineNo">400</span>                for (int l = 0; l &lt; k; ++l) {<a name="line.400"></a>
-<span class="sourceLineNo">401</span>                    if (successors[v][l] == successors[v][k]) {<a name="line.401"></a>
-<span class="sourceLineNo">402</span>                        final Vector3D start = vertices.get(v);<a name="line.402"></a>
-<span class="sourceLineNo">403</span>                        final Vector3D end   = vertices.get(successors[v][k]);<a name="line.403"></a>
-<span class="sourceLineNo">404</span>                        throw new MathIllegalArgumentException(LocalizedFormats.FACET_ORIENTATION_MISMATCH,<a name="line.404"></a>
-<span class="sourceLineNo">405</span>                                                               start.getX(), start.getY(), start.getZ(),<a name="line.405"></a>
-<span class="sourceLineNo">406</span>                                                               end.getX(),   end.getY(),   end.getZ());<a name="line.406"></a>
-<span class="sourceLineNo">407</span>                    }<a name="line.407"></a>
-<span class="sourceLineNo">408</span>                }<a name="line.408"></a>
-<span class="sourceLineNo">409</span><a name="line.409"></a>
-<span class="sourceLineNo">410</span>            }<a name="line.410"></a>
-<span class="sourceLineNo">411</span>        }<a name="line.411"></a>
-<span class="sourceLineNo">412</span><a name="line.412"></a>
-<span class="sourceLineNo">413</span>        return successors;<a name="line.413"></a>
-<span class="sourceLineNo">414</span><a name="line.414"></a>
-<span class="sourceLineNo">415</span>    }<a name="line.415"></a>
-<span class="sourceLineNo">416</span><a name="line.416"></a>
-<span class="sourceLineNo">417</span>    /** {@inheritDoc} */<a name="line.417"></a>
-<span class="sourceLineNo">418</span>    @Override<a name="line.418"></a>
-<span class="sourceLineNo">419</span>    public PolyhedronsSet buildNew(final BSPTree&lt;Euclidean3D&gt; tree) {<a name="line.419"></a>
-<span class="sourceLineNo">420</span>        return new PolyhedronsSet(tree, getTolerance());<a name="line.420"></a>
-<span class="sourceLineNo">421</span>    }<a name="line.421"></a>
-<span class="sourceLineNo">422</span><a name="line.422"></a>
-<span class="sourceLineNo">423</span>    /** {@inheritDoc} */<a name="line.423"></a>
-<span class="sourceLineNo">424</span>    @Override<a name="line.424"></a>
-<span class="sourceLineNo">425</span>    protected void computeGeometricalProperties() {<a name="line.425"></a>
-<span class="sourceLineNo">426</span><a name="line.426"></a>
-<span class="sourceLineNo">427</span>        // compute the contribution of all boundary facets<a name="line.427"></a>
-<span class="sourceLineNo">428</span>        getTree(true).visit(new FacetsContributionVisitor());<a name="line.428"></a>
-<span class="sourceLineNo">429</span><a name="line.429"></a>
-<span class="sourceLineNo">430</span>        if (getSize() &lt; 0) {<a name="line.430"></a>
-<span class="sourceLineNo">431</span>            // the polyhedrons set as a finite outside<a name="line.431"></a>
-<span class="sourceLineNo">432</span>            // surrounded by an infinite inside<a name="line.432"></a>
-<span class="sourceLineNo">433</span>            setSize(Double.POSITIVE_INFINITY);<a name="line.433"></a>
-<span class="sourceLineNo">434</span>            setBarycenter((Point&lt;Euclidean3D&gt;) Vector3D.NaN);<a name="line.434"></a>
-<span class="sourceLineNo">435</span>        } else {<a name="line.435"></a>
-<span class="sourceLineNo">436</span>            // the polyhedrons set is finite, apply the remaining scaling factors<a name="line.436"></a>
-<span class="sourceLineNo">437</span>            setSize(getSize() / 3.0);<a name="line.437"></a>
-<span class="sourceLineNo">438</span>            setBarycenter((Point&lt;Euclidean3D&gt;) new Vector3D(1.0 / (4 * getSize()), (Vector3D) getBarycenter()));<a name="line.438"></a>
-<span class="sourceLineNo">439</span>        }<a name="line.439"></a>
-<span class="sourceLineNo">440</span><a name="line.440"></a>
-<span class="sourceLineNo">441</span>    }<a name="line.441"></a>
-<span class="sourceLineNo">442</span><a name="line.442"></a>
-<span class="sourceLineNo">443</span>    /** Visitor computing geometrical properties. */<a name="line.443"></a>
-<span class="sourceLineNo">444</span>    private class FacetsContributionVisitor implements BSPTreeVisitor&lt;Euclidean3D&gt; {<a name="line.444"></a>
-<span class="sourceLineNo">445</span><a name="line.445"></a>
-<span class="sourceLineNo">446</span>        /** Simple constructor. */<a name="line.446"></a>
-<span class="sourceLineNo">447</span>        public FacetsContributionVisitor() {<a name="line.447"></a>
-<span class="sourceLineNo">448</span>            setSize(0);<a name="line.448"></a>
-<span class="sourceLineNo">449</span>            setBarycenter((Point&lt;Euclidean3D&gt;) new Vector3D(0, 0, 0));<a name="line.449"></a>
-<span class="sourceLineNo">450</span>        }<a name="line.450"></a>
-<span class="sourceLineNo">451</span><a name="line.451"></a>
-<span class="sourceLineNo">452</span>        /** {@inheritDoc} */<a name="line.452"></a>
-<span class="sourceLineNo">453</span>        public Order visitOrder(final BSPTree&lt;Euclidean3D&gt; node) {<a name="line.453"></a>
-<span class="sourceLineNo">454</span>            return Order.MINUS_SUB_PLUS;<a name="line.454"></a>
-<span class="sourceLineNo">455</span>        }<a name="line.455"></a>
-<span class="sourceLineNo">456</span><a name="line.456"></a>
-<span class="sourceLineNo">457</span>        /** {@inheritDoc} */<a name="line.457"></a>
-<span class="sourceLineNo">458</span>        public void visitInternalNode(final BSPTree&lt;Euclidean3D&gt; node) {<a name="line.458"></a>
-<span class="sourceLineNo">459</span>            @SuppressWarnings("unchecked")<a name="line.459"></a>
-<span class="sourceLineNo">460</span>            final BoundaryAttribute&lt;Euclidean3D&gt; attribute =<a name="line.460"></a>
-<span class="sourceLineNo">461</span>                (BoundaryAttribute&lt;Euclidean3D&gt;) node.getAttribute();<a name="line.461"></a>
-<span class="sourceLineNo">462</span>            if (attribute.getPlusOutside() != null) {<a name="line.462"></a>
-<span class="sourceLineNo">463</span>                addContribution(attribute.getPlusOutside(), false);<a name="line.463"></a>
-<span class="sourceLineNo">464</span>            }<a name="line.464"></a>
-<span class="sourceLineNo">465</span>            if (attribute.getPlusInside() != null) {<a name="line.465"></a>
-<span class="sourceLineNo">466</span>                addContribution(attribute.getPlusInside(), true);<a name="line.466"></a>
-<span class="sourceLineNo">467</span>            }<a name="line.467"></a>
-<span class="sourceLineNo">468</span>        }<a name="line.468"></a>
-<span class="sourceLineNo">469</span><a name="line.469"></a>
-<span class="sourceLineNo">470</span>        /** {@inheritDoc} */<a name="line.470"></a>
-<span class="sourceLineNo">471</span>        public void visitLeafNode(final BSPTree&lt;Euclidean3D&gt; node) {<a name="line.471"></a>
-<span class="sourceLineNo">472</span>        }<a name="line.472"></a>
-<span class="sourceLineNo">473</span><a name="line.473"></a>
-<span class="sourceLineNo">474</span>        /** Add he contribution of a boundary facet.<a name="line.474"></a>
-<span class="sourceLineNo">475</span>         * @param facet boundary facet<a name="line.475"></a>
-<span class="sourceLineNo">476</span>         * @param reversed if true, the facet has the inside on its plus side<a name="line.476"></a>
-<span class="sourceLineNo">477</span>         */<a name="line.477"></a>
-<span class="sourceLineNo">478</span>        private void addContribution(final SubHyperplane&lt;Euclidean3D&gt; facet, final boolean reversed) {<a name="line.478"></a>
-<span class="sourceLineNo">479</span><a name="line.479"></a>
-<span class="sourceLineNo">480</span>            final Region&lt;Euclidean2D&gt; polygon = ((SubPlane) facet).getRemainingRegion();<a name="line.480"></a>
-<span class="sourceLineNo">481</span>            final double area    = polygon.getSize();<a name="line.481"></a>
-<span class="sourceLineNo">482</span><a name="line.482"></a>
-<span class="sourceLineNo">483</span>            if (Double.isInfinite(area)) {<a name="line.483"></a>
-<span class="sourceLineNo">484</span>                setSize(Double.POSITIVE_INFINITY);<a name="line.484"></a>
-<span class="sourceLineNo">485</span>                setBarycenter((Point&lt;Euclidean3D&gt;) Vector3D.NaN);<a name="line.485"></a>
-<span class="sourceLineNo">486</span>            } else {<a name="line.486"></a>
-<span class="sourceLineNo">487</span><a name="line.487"></a>
-<span class="sourceLineNo">488</span>                final Plane    plane  = (Plane) facet.getHyperplane();<a name="line.488"></a>
-<span class="sourceLineNo">489</span>                final Vector3D facetB = plane.toSpace(polygon.getBarycenter());<a name="line.489"></a>
-<span class="sourceLineNo">490</span>                double   scaled = area * facetB.dotProduct(plane.getNormal());<a name="line.490"></a>
-<span class="sourceLineNo">491</span>                if (reversed) {<a name="line.491"></a>
-<span class="sourceLineNo">492</span>                    scaled = -scaled;<a name="line.492"></a>
-<span class="sourceLineNo">493</span>                }<a name="line.493"></a>
-<span class="sourceLineNo">494</span><a name="line.494"></a>
-<span class="sourceLineNo">495</span>                setSize(getSize() + scaled);<a name="line.495"></a>
-<span class="sourceLineNo">496</span>                setBarycenter((Point&lt;Euclidean3D&gt;) new Vector3D(1.0, (Vector3D) getBarycenter(), scaled, facetB));<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span>            }<a name="line.498"></a>
-<span class="sourceLineNo">499</span><a name="line.499"></a>
-<span class="sourceLineNo">500</span>        }<a name="line.500"></a>
-<span class="sourceLineNo">501</span><a name="line.501"></a>
-<span class="sourceLineNo">502</span>    }<a name="line.502"></a>
-<span class="sourceLineNo">503</span><a name="line.503"></a>
-<span class="sourceLineNo">504</span>    /** Get the first sub-hyperplane crossed by a semi-infinite line.<a name="line.504"></a>
-<span class="sourceLineNo">505</span>     * @param point start point of the part of the line considered<a name="line.505"></a>
-<span class="sourceLineNo">506</span>     * @param line line to consider (contains point)<a name="line.506"></a>
-<span class="sourceLineNo">507</span>     * @return the first sub-hyperplane crossed by the line after the<a name="line.507"></a>
-<span class="sourceLineNo">508</span>     * given point, or null if the line does not intersect any<a name="line.508"></a>
-<span class="sourceLineNo">509</span>     * sub-hyperplane<a name="line.509"></a>
-<span class="sourceLineNo">510</span>     */<a name="line.510"></a>
-<span class="sourceLineNo">511</span>    public SubHyperplane&lt;Euclidean3D&gt; firstIntersection(final Vector3D point, final Line line) {<a name="line.511"></a>
-<span class="sourceLineNo">512</span>        return recurseFirstIntersection(getTree(true), point, line);<a name="line.512"></a>
-<span class="sourceLineNo">513</span>    }<a name="line.513"></a>
-<span class="sourceLineNo">514</span><a name="line.514"></a>
-<span class="sourceLineNo">515</span>    /** Get the first sub-hyperplane crossed by a semi-infinite line.<a name="line.515"></a>
-<span class="sourceLineNo">516</span>     * @param node current node<a name="line.516"></a>
-<span class="sourceLineNo">517</span>     * @param point start point of the part of the line considered<a name="line.517"></a>
-<span class="sourceLineNo">518</span>     * @param line line to consider (contains point)<a name="line.518"></a>
-<span class="sourceLineNo">519</span>     * @return the first sub-hyperplane crossed by the line after the<a name="line.519"></a>
-<span class="sourceLineNo">520</span>     * given point, or null if the line does not intersect any<a name="line.520"></a>
-<span class="sourceLineNo">521</span>     * sub-hyperplane<a name="line.521"></a>
-<span class="sourceLineNo">522</span>     */<a name="line.522"></a>
-<span class="sourceLineNo">523</span>    private SubHyperplane&lt;Euclidean3D&gt; recurseFirstIntersection(final BSPTree&lt;Euclidean3D&gt; node,<a name="line.523"></a>
-<span class="sourceLineNo">524</span>                                                                final Vector3D point,<a name="line.524"></a>
-<span class="sourceLineNo">525</span>                                                                final Line line) {<a name="line.525"></a>
-<span class="sourceLineNo">526</span><a name="line.526"></a>
-<span class="sourceLineNo">527</span>        final SubHyperplane&lt;Euclidean3D&gt; cut = node.getCut();<a name="line.527"></a>
-<span class="sourceLineNo">528</span>        if (cut == null) {<a name="line.528"></a>
-<span class="sourceLineNo">529</span>            return null;<a name="line.529"></a>
-<span class="sourceLineNo">530</span>        }<a name="line.530"></a>
-<span class="sourceLineNo">531</span>        final BSPTree&lt;Euclidean3D&gt; minus = node.getMinus();<a name="line.531"></a>
-<span class="sourceLineNo">532</span>        final BSPTree&lt;Euclidean3D&gt; plus  = node.getPlus();<a name="line.532"></a>
-<span class="sourceLineNo">533</span>        final Plane                plane = (Plane) cut.getHyperplane();<a name="line.533"></a>
-<span class="sourceLineNo">534</span><a name="line.534"></a>
-<span class="sourceLineNo">535</span>        // establish search order<a name="line.535"></a>
-<span class="sourceLineNo">536</span>        final double offset = plane.getOffset((Point&lt;Euclidean3D&gt;) point);<a name="line.536"></a>
-<span class="sourceLineNo">537</span>        final boolean in    = FastMath.abs(offset) &lt; getTolerance();<a name="line.537"></a>
-<span class="sourceLineNo">538</span>        final BSPTree&lt;Euclidean3D&gt; near;<a name="line.538"></a>
-<span class="sourceLineNo">539</span>        final BSPTree&lt;Euclidean3D&gt; far;<a name="line.539"></a>
-<span class="sourceLineNo">540</span>        if (offset &lt; 0) {<a name="line.540"></a>
-<span class="sourceLineNo">541</span>            near = minus;<a name="line.541"></a>
-<span class="sourceLineNo">542</span>            far  = plus;<a name="line.542"></a>
-<span class="sourceLineNo">543</span>        } else {<a name="line.543"></a>
-<span class="sourceLineNo">544</span>            near = plus;<a name="line.544"></a>
-<span class="sourceLineNo">545</span>            far  = minus;<a name="line.545"></a>
-<span class="sourceLineNo">546</span>        }<a name="line.546"></a>
-<span class="sourceLineNo">547</span><a name="line.547"></a>
-<span class="sourceLineNo">548</span>        if (in) {<a name="line.548"></a>
-<span class="sourceLineNo">549</span>            // search in the cut hyperplane<a name="line.549"></a>
-<span class="sourceLineNo">550</span>            final SubHyperplane&lt;Euclidean3D&gt; facet = boundaryFacet(point, node);<a name="line.550"></a>
-<span class="sourceLineNo">551</span>            if (facet != null) {<a name="line.551"></a>
-<span class="sourceLineNo">552</span>                return facet;<a name="line.552"></a>
-<span class="sourceLineNo">553</span>            }<a name="line.553"></a>
-<span class="sourceLineNo">554</span>        }<a name="line.554"></a>
-<span class="sourceLineNo">555</span><a name="line.555"></a>
-<span class="sourceLineNo">556</span>        // search in the near branch<a name="line.556"></a>
-<span class="sourceLineNo">557</span>        final SubHyperplane&lt;Euclidean3D&gt; crossed = recurseFirstIntersection(near, point, line);<a name="line.557"></a>
-<span class="sourceLineNo">558</span>        if (crossed != null) {<a name="line.558"></a>
-<span class="sourceLineNo">559</span>            return crossed;<a name="line.559"></a>
-<span class="sourceLineNo">560</span>        }<a name="line.560"></a>
-<span class="sourceLineNo">561</span><a name="line.561"></a>
-<span class="sourceLineNo">562</span>        if (!in) {<a name="line.562"></a>
-<span class="sourceLineNo">563</span>            // search in the cut hyperplane<a name="line.563"></a>
-<span class="sourceLineNo">564</span>            final Vector3D hit3D = plane.intersection(line);<a name="line.564"></a>
-<span class="sourceLineNo">565</span>            if (hit3D != null &amp;&amp; line.getAbscissa(hit3D) &gt; line.getAbscissa(point)) {<a name="line.565"></a>
-<span class="sourceLineNo">566</span>                final SubHyperplane&lt;Euclidean3D&gt; facet = boundaryFacet(hit3D, node);<a name="line.566"></a>
-<span class="sourceLineNo">567</span>                if (facet != null) {<a name="line.567"></a>
-<span class="sourceLineNo">568</span>                    return facet;<a name="line.568"></a>
-<span class="sourceLineNo">569</span>                }<a name="line.569"></a>
-<span class="sourceLineNo">570</span>            }<a name="line.570"></a>
-<span class="sourceLineNo">571</span>        }<a name="line.571"></a>
-<span class="sourceLineNo">572</span><a name="line.572"></a>
-<span class="sourceLineNo">573</span>        // search in the far branch<a name="line.573"></a>
-<span class="sourceLineNo">574</span>        return recurseFirstIntersection(far, point, line);<a name="line.574"></a>
-<span class="sourceLineNo">575</span><a name="line.575"></a>
-<span class="sourceLineNo">576</span>    }<a name="line.576"></a>
-<span class="sourceLineNo">577</span><a name="line.577"></a>
-<span class="sourceLineNo">578</span>    /** Check if a point belongs to the boundary part of a node.<a name="line.578"></a>
-<span class="sourceLineNo">579</span>     * @param point point to check<a name="line.579"></a>
-<span class="sourceLineNo">580</span>     * @param node node containing the boundary facet to check<a name="line.580"></a>
-<span class="sourceLineNo">581</span>     * @return the boundary facet this points belongs to (or null if it<a name="line.581"></a>
-<span class="sourceLineNo">582</span>     * does not belong to any boundary facet)<a name="line.582"></a>
-<span class="sourceLineNo">583</span>     */<a name="line.583"></a>
-<span class="sourceLineNo">584</span>    private SubHyperplane&lt;Euclidean3D&gt; boundaryFacet(final Vector3D point,<a name="line.584"></a>
-<span class="sourceLineNo">585</span>                                                     final BSPTree&lt;Euclidean3D&gt; node) {<a name="line.585"></a>
-<span class="sourceLineNo">586</span>        final Vector2D point2D = ((Plane) node.getCut().getHyperplane()).toSubSpace((Point&lt;Euclidean3D&gt;) point);<a name="line.586"></a>
-<span class="sourceLineNo">587</span>        @SuppressWarnings("unchecked")<a name="line.587"></a>
-<span class="sourceLineNo">588</span>        final BoundaryAttribute&lt;Euclidean3D&gt; attribute =<a name="line.588"></a>
-<span class="sourceLineNo">589</span>            (BoundaryAttribute&lt;Euclidean3D&gt;) node.getAttribute();<a name="line.589"></a>
-<span class="sourceLineNo">590</span>        if ((attribute.getPlusOutside() != null) &amp;&amp;<a name="line.590"></a>
-<span class="sourceLineNo">591</span>            (((SubPlane) attribute.getPlusOutside()).getRemainingRegion().checkPoint(point2D) == Location.INSIDE)) {<a name="line.591"></a>
-<span class="sourceLineNo">592</span>            return attribute.getPlusOutside();<a name="line.592"></a>
-<span class="sourceLineNo">593</span>        }<a name="line.593"></a>
-<span class="sourceLineNo">594</span>        if ((attribute.getPlusInside() != null) &amp;&amp;<a name="line.594"></a>
-<span class="sourceLineNo">595</span>            (((SubPlane) attribute.getPlusInside()).getRemainingRegion().checkPoint(point2D) == Location.INSIDE)) {<a name="line.595"></a>
-<span class="sourceLineNo">596</span>            return attribute.getPlusInside();<a name="line.596"></a>
-<span class="sourceLineNo">597</span>        }<a name="line.597"></a>
-<span class="sourceLineNo">598</span>        return null;<a name="line.598"></a>
-<span class="sourceLineNo">599</span>    }<a name="line.599"></a>
-<span class="sourceLineNo">600</span><a name="line.600"></a>
-<span class="sourceLineNo">601</span>    /** Rotate the region around the specified point.<a name="line.601"></a>
-<span class="sourceLineNo">602</span>     * &lt;p&gt;The instance is not modified, a new instance is created.&lt;/p&gt;<a name="line.602"></a>
-<span class="sourceLineNo">603</span>     * @param center rotation center<a name="line.603"></a>
-<span class="sourceLineNo">604</span>     * @param rotation vectorial rotation operator<a name="line.604"></a>
-<span class="sourceLineNo">605</span>     * @return a new instance representing the rotated region<a name="line.605"></a>
-<span class="sourceLineNo">606</span>     */<a name="line.606"></a>
-<span class="sourceLineNo">607</span>    public PolyhedronsSet rotate(final Vector3D center, final Rotation rotation) {<a name="line.607"></a>
-<span class="sourceLineNo">608</span>        return (PolyhedronsSet) applyTransform(new RotationTransform(center, rotation));<a name="line.608"></a>
-<span class="sourceLineNo">609</span>    }<a name="line.609"></a>
-<span class="sourceLineNo">610</span><a name="line.610"></a>
-<span class="sourceLineNo">611</span>    /** 3D rotation as a Transform. */<a name="line.611"></a>
-<span class="sourceLineNo">612</span>    private static class RotationTransform implements Transform&lt;Euclidean3D, Euclidean2D&gt; {<a name="line.612"></a>
-<span class="sourceLineNo">613</span><a name="line.613"></a>
-<span class="sourceLineNo">614</span>        /** Center point of the rotation. */<a name="line.614"></a>
-<span class="sourceLineNo">615</span>        private Vector3D   center;<a name="line.615"></a>
-<span class="sourceLineNo">616</span><a name="line.616"></a>
-<span class="sourceLineNo">617</span>        /** Vectorial rotation. */<a name="line.617"></a>
-<span class="sourceLineNo">618</span>        private Rotation   rotation;<a name="line.618"></a>
-<span class="sourceLineNo">619</span><a name="line.619"></a>
-<span class="sourceLineNo">620</span>        /** Cached original hyperplane. */<a name="line.620"></a>
-<span class="sourceLineNo">621</span>        private Plane cachedOriginal;<a name="line.621"></a>
-<span class="sourceLineNo">622</span><a name="line.622"></a>
-<span class="sourceLineNo">623</span>        /** Cached 2D transform valid inside the cached original hyperplane. */<a name="line.623"></a>
-<span class="sourceLineNo">624</span>        private Transform&lt;Euclidean2D, Euclidean1D&gt;  cachedTransform;<a name="line.624"></a>
-<span class="sourceLineNo">625</span><a name="line.625"></a>
-<span class="sourceLineNo">626</span>        /** Build a rotation transform.<a name="line.626"></a>
-<span class="sourceLineNo">627</span>         * @param center center point of the rotation<a name="line.627"></a>
-<span class="sourceLineNo">628</span>         * @param rotation vectorial rotation<a name="line.628"></a>
-<span class="sourceLineNo">629</span>         */<a name="line.629"></a>
-<span class="sourceLineNo">630</span>        public RotationTransform(final Vector3D center, final Rotation rotation) {<a name="line.630"></a>
-<span class="sourceLineNo">631</span>            this.center   = center;<a name="line.631"></a>
-<span class="sourceLineNo">632</span>            this.rotation = rotation;<a name="line.632"></a>
-<span class="sourceLineNo">633</span>        }<a name="line.633"></a>
-<span class="sourceLineNo">634</span><a name="line.634"></a>
-<span class="sourceLineNo">635</span>        /** {@inheritDoc} */<a name="line.635"></a>
-<span class="sourceLineNo">636</span>        public Vector3D apply(final Point&lt;Euclidean3D&gt; point) {<a name="line.636"></a>
-<span class="sourceLineNo">637</span>            final Vector3D delta = ((Vector3D) point).subtract(center);<a name="line.637"></a>
-<span class="sourceLineNo">638</span>            return new Vector3D(1.0, center, 1.0, rotation.applyTo(delta));<a name="line.638"></a>
-<span class="sourceLineNo">639</span>        }<a name="line.639"></a>
-<span class="sourceLineNo">640</span><a name="line.640"></a>
-<span class="sourceLineNo">641</span>        /** {@inheritDoc} */<a name="line.641"></a>
-<span class="sourceLineNo">642</span>        public Plane apply(final Hyperplane&lt;Euclidean3D&gt; hyperplane) {<a name="line.642"></a>
-<span class="sourceLineNo">643</span>            return ((Plane) hyperplane).rotate(center, rotation);<a name="line.643"></a>
-<span class="sourceLineNo">644</span>        }<a name="line.644"></a>
-<span class="sourceLineNo">645</span><a name="line.645"></a>
-<span class="sourceLineNo">646</span>        /** {@inheritDoc} */<a name="line.646"></a>
-<span class="sourceLineNo">647</span>        public SubHyperplane&lt;Euclidean2D&gt; apply(final SubHyperplane&lt;Euclidean2D&gt; sub,<a name="line.647"></a>
-<span class="sourceLineNo">648</span>                                                final Hyperplane&lt;Euclidean3D&gt; original,<a name="line.648"></a>
-<span class="sourceLineNo">649</span>                                                final Hyperplane&lt;Euclidean3D&gt; transformed) {<a name="line.649"></a>
-<span class="sourceLineNo">650</span>            if (original != cachedOriginal) {<a name="line.650"></a>
-<span class="sourceLineNo">651</span>                // we have changed hyperplane, reset the in-hyperplane transform<a name="line.651"></a>
-<span class="sourceLineNo">652</span><a name="line.652"></a>
-<span class="sourceLineNo">653</span>                final Plane    oPlane = (Plane) original;<a name="line.653"></a>
-<span class="sourceLineNo">654</span>                final Plane    tPlane = (Plane) transformed;<a name="line.654"></a>
-<span class="sourceLineNo">655</span>                final Vector3D p00    = oPlane.getOrigin();<a name="line.655"></a>
-<span class="sourceLineNo">656</span>                final Vector3D p10    = oPlane.toSpace((Point&lt;Euclidean2D&gt;) new Vector2D(1.0, 0.0));<a name="line.656"></a>
-<span class="sourceLineNo">657</span>                final Vector3D p01    = oPlane.toSpace((Point&lt;Euclidean2D&gt;) new Vector2D(0.0, 1.0));<a name="line.657"></a>
-<span class="sourceLineNo">658</span>                final Vector2D tP00   = tPlane.toSubSpace((Point&lt;Euclidean3D&gt;) apply(p00));<a name="line.658"></a>
-<span class="sourceLineNo">659</span>                final Vector2D tP10   = tPlane.toSubSpace((Point&lt;Euclidean3D&gt;) apply(p10));<a name="line.659"></a>
-<span class="sourceLineNo">660</span>                final Vector2D tP01   = tPlane.toSubSpace((Point&lt;Euclidean3D&gt;) apply(p01));<a name="line.660"></a>
-<span class="sourceLineNo">661</span>                final AffineTransform at =<a name="line.661"></a>
-<span class="sourceLineNo">662</span>                    new AffineTransform(tP10.getX() - tP00.getX(), tP10.getY() - tP00.getY(),<a name="line.662"></a>
-<span class="sourceLineNo">663</span>                                        tP01.getX() - tP00.getX(), tP01.getY() - tP00.getY(),<a name="line.663"></a>
-<span class="sourceLineNo">664</span>                                        tP00.getX(), tP00.getY());<a name="line.664"></a>
-<span class="sourceLineNo">665</span><a name="line.665"></a>
-<span class="sourceLineNo">666</span>                cachedOriginal  = (Plane) original;<a name="line.666"></a>
-<span class="sourceLineNo">667</span>                cachedTransform = org.apache.commons.math3.geometry.euclidean.twod.Line.getTransform(at);<a name="line.667"></a>
-<span class="sourceLineNo">668</span><a name="line.668"></a>
-<span class="sourceLineNo">669</span>            }<a name="line.669"></a>
-<span class="sourceLineNo">670</span>            return ((SubLine) sub).applyTransform(cachedTransform);<a name="line.670"></a>
-<span class="sourceLineNo">671</span>        }<a name="line.671"></a>
-<span class="sourceLineNo">672</span><a name="line.672"></a>
-<span class="sourceLineNo">673</span>    }<a name="line.673"></a>
-<span class="sourceLineNo">674</span><a name="line.674"></a>
-<span class="sourceLineNo">675</span>    /** Translate the region by the specified amount.<a name="line.675"></a>
-<span class="sourceLineNo">676</span>     * &lt;p&gt;The instance is not modified, a new instance is created.&lt;/p&gt;<a name="line.676"></a>
-<span class="sourceLineNo">677</span>     * @param translation translation to apply<a name="line.677"></a>
-<span class="sourceLineNo">678</span>     * @return a new instance representing the translated region<a name="line.678"></a>
-<span class="sourceLineNo">679</span>     */<a name="line.679"></a>
-<span class="sourceLineNo">680</span>    public PolyhedronsSet translate(final Vector3D translation) {<a name="line.680"></a>
-<span class="sourceLineNo">681</span>        return (PolyhedronsSet) applyTransform(new TranslationTransform(translation));<a name="line.681"></a>
-<span class="sourceLineNo">682</span>    }<a name="line.682"></a>
-<span class="sourceLineNo">683</span><a name="line.683"></a>
-<span class="sourceLineNo">684</span>    /** 3D translation as a transform. */<a name="line.684"></a>
-<span class="sourceLineNo">685</span>    private static class TranslationTransform implements Transform&lt;Euclidean3D, Euclidean2D&gt; {<a name="line.685"></a>
-<span class="sourceLineNo">686</span><a name="line.686"></a>
-<span class="sourceLineNo">687</span>        /** Translation vector. */<a name="line.687"></a>
-<span class="sourceLineNo">688</span>        private Vector3D   translation;<a name="line.688"></a>
-<span class="sourceLineNo">689</span><a name="line.689"></a>
-<span class="sourceLineNo">690</span>        /** Cached original hyperplane. */<a name="line.690"></a>
-<span class="sourceLineNo">691</span>        private Plane cachedOriginal;<a name="line.691"></a>
-<span class="sourceLineNo">692</span><a name="line.692"></a>
-<span class="sourceLineNo">693</span>        /** Cached 2D transform valid inside the cached original hyperplane. */<a name="line.693"></a>
-<span class="sourceLineNo">694</span>        private Transform&lt;Euclidean2D, Euclidean1D&gt;  cachedTransform;<a name="line.694"></a>
-<span class="sourceLineNo">695</span><a name="line.695"></a>
-<span class="sourceLineNo">696</span>        /** Build a translation transform.<a name="line.696"></a>
-<span class="sourceLineNo">697</span>         * @param translation translation vector<a name="line.697"></a>
-<span class="sourceLineNo">698</span>         */<a name="line.698"></a>
-<span class="sourceLineNo">699</span>        public TranslationTransform(final Vector3D translation) {<a name="line.699"></a>
-<span class="sourceLineNo">700</span>            this.translation = translation;<a name="line.700"></a>
-<span class="sourceLineNo">701</span>        }<a name="line.701"></a>
-<span class="sourceLineNo">702</span><a name="line.702"></a>
-<span class="sourceLineNo">703</span>        /** {@inheritDoc} */<a name="line.703"></a>
-<span class="sourceLineNo">704</span>        public Vector3D apply(final Point&lt;Euclidean3D&gt; point) {<a name="line.704"></a>
-<span class="sourceLineNo">705</span>            return new Vector3D(1.0, (Vector3D) point, 1.0, translation);<a name="line.705"></a>
-<span class="sourceLineNo">706</span>        }<a name="line.706"></a>
-<span class="sourceLineNo">707</span><a name="line.707"></a>
-<span class="sourceLineNo">708</span>        /** {@inheritDoc} */<a name="line.708"></a>
-<span class="sourceLineNo">709</span>        public Plane apply(final Hyperplane&lt;Euclidean3D&gt; hyperplane) {<a name="line.709"></a>
-<span class="sourceLineNo">710</span>            return ((Plane) hyperplane).translate(translation);<a name="line.710"></a>
-<span class="sourceLineNo">711</span>        }<a name="line.711"></a>
-<span class="sourceLineNo">712</span><a name="line.712"></a>
-<span class="sourceLineNo">713</span>        /** {@inheritDoc} */<a name="line.713"></a>
-<span class="sourceLineNo">714</span>        public SubHyperplane&lt;Euclidean2D&gt; apply(final SubHyperplane&lt;Euclidean2D&gt; sub,<a name="line.714"></a>
-<span class="sourceLineNo">715</span>                                                final Hyperplane&lt;Euclidean3D&gt; original,<a name="line.715"></a>
-<span class="sourceLineNo">716</span>                                                final Hyperplane&lt;Euclidean3D&gt; transformed) {<a name="line.716"></a>
-<span class="sourceLineNo">717</span>            if (original != cachedOriginal) {<a name="line.717"></a>
-<span class="sourceLineNo">718</span>                // we have changed hyperplane, reset the in-hyperplane transform<a name="line.718"></a>
-<span class="sourceLineNo">719</span><a name="line.719"></a>
-<span class="sourceLineNo">720</span>                final Plane   oPlane = (Plane) original;<a name="line.720"></a>
-<span class="sourceLineNo">721</span>                final Plane   tPlane = (Plane) transformed;<a name="line.721"></a>
-<span class="sourceLineNo">722</span>                final Vector2D shift  = tPlane.toSubSpace((Point&lt;Euclidean3D&gt;) apply(oPlane.getOrigin()));<a name="line.722"></a>
-<span class="sourceLineNo">723</span>                final AffineTransform at =<a name="line.723"></a>
-<span class="sourceLineNo">724</span>                    AffineTransform.getTranslateInstance(shift.getX(), shift.getY());<a name="line.724"></a>
-<span class="sourceLineNo">725</span><a name="line.725"></a>
-<span class="sourceLineNo">726</span>                cachedOriginal  = (Plane) original;<a name="line.726"></a>
-<span class="sourceLineNo">727</span>                cachedTransform =<a name="line.727"></a>
-<span class="sourceLineNo">728</span>                        org.apache.commons.math3.geometry.euclidean.twod.Line.getTransform(at);<a name="line.728"></a>
-<span class="sourceLineNo">729</span><a name="line.729"></a>
-<span class="sourceLineNo">730</span>            }<a name="line.730"></a>
-<span class="sourceLineNo">731</span><a name="line.731"></a>
-<span class="sourceLineNo">732</span>            return ((SubLine) sub).applyTransform(cachedTransform);<a name="line.732"></a>
-<span class="sourceLineNo">733</span><a name="line.733"></a>
-<span class="sourceLineNo">734</span>        }<a name="line.734"></a>
-<span class="sourceLineNo">735</span><a name="line.735"></a>
-<span class="sourceLineNo">736</span>    }<a name="line.736"></a>
-<span class="sourceLineNo">737</span><a name="line.737"></a>
-<span class="sourceLineNo">738</span>}<a name="line.738"></a>
+<span class="sourceLineNo">019</span>import java.util.ArrayList;<a name="line.19"></a>
+<span class="sourceLineNo">020</span>import java.util.Arrays;<a name="line.20"></a>
+<span class="sourceLineNo">021</span>import java.util.Collection;<a name="line.21"></a>
+<span class="sourceLineNo">022</span>import java.util.List;<a name="line.22"></a>
+<span class="sourceLineNo">023</span><a name="line.23"></a>
+<span class="sourceLineNo">024</span>import org.apache.commons.math3.exception.MathIllegalArgumentException;<a name="line.24"></a>
+<span class="sourceLineNo">025</span>import org.apache.commons.math3.exception.NumberIsTooSmallException;<a name="line.25"></a>
+<span class="sourceLineNo">026</span>import org.apache.commons.math3.exception.util.LocalizedFormats;<a name="line.26"></a>
+<span class="sourceLineNo">027</span>import org.apache.commons.math3.geometry.Point;<a name="line.27"></a>
+<span class="sourceLineNo">028</span>import org.apache.commons.math3.geometry.euclidean.oned.Euclidean1D;<a name="line.28"></a>
+<span class="sourceLineNo">029</span>import org.apache.commons.math3.geometry.euclidean.twod.Euclidean2D;<a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.commons.math3.geometry.euclidean.twod.PolygonsSet;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.commons.math3.geometry.euclidean.twod.SubLine;<a name="line.31"></a>
+<span class="sourceLineNo">032</span>import org.apache.commons.math3.geometry.euclidean.twod.Vector2D;<a name="line.32"></a>
+<span class="sourceLineNo">033</span>import org.apache.commons.math3.geometry.partitioning.AbstractRegion;<a name="line.33"></a>
+<span class="sourceLineNo">034</span>import org.apache.commons.math3.geometry.partitioning.BSPTree;<a name="line.34"></a>
+<span class="sourceLineNo">035</span>import org.apache.commons.math3.geometry.partitioning.BSPTreeVisitor;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>import org.apache.commons.math3.geometry.partitioning.BoundaryAttribute;<a name="line.36"></a>
+<span class="sourceLineNo">037</span>import org.apache.commons.math3.geometry.partitioning.Hyperplane;<a name="line.37"></a>
+<span class="sourceLineNo">038</span>import org.apache.commons.math3.geometry.partitioning.Region;<a name="line.38"></a>
+<span class="sourceLineNo">039</span>import org.apache.commons.math3.geometry.partitioning.RegionFactory;<a name="line.39"></a>
+<span class="sourceLineNo">040</span>import org.apache.commons.math3.geometry.partitioning.SubHyperplane;<a name="line.40"></a>
+<span class="sourceLineNo">041</span>import org.apache.commons.math3.geometry.partitioning.Transform;<a name="line.41"></a>
+<span class="sourceLineNo">042</span>import org.apache.commons.math3.util.FastMath;<a name="line.42"></a>
+<span class="sourceLineNo">043</span><a name="line.43"></a>
+<span class="sourceLineNo">044</span>/** This class represents a 3D region: a set of polyhedrons.<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * @since 3.0<a name="line.45"></a>
+<span class="sourceLineNo">046</span> */<a name="line.46"></a>
+<span class="sourceLineNo">047</span>public class PolyhedronsSet extends AbstractRegion&lt;Euclidean3D, Euclidean2D&gt; {<a name="line.47"></a>
+<span class="sourceLineNo">048</span><a name="line.48"></a>
+<span class="sourceLineNo">049</span>    /** Default value for tolerance. */<a name="line.49"></a>
+<span class="sourceLineNo">050</span>    private static final double DEFAULT_TOLERANCE = 1.0e-10;<a name="line.50"></a>
+<span class="sourceLineNo">051</span><a name="line.51"></a>
+<span class="sourceLineNo">052</span>    /** Build a polyhedrons set representing the whole real line.<a name="line.52"></a>
+<span class="sourceLineNo">053</span>     * @param tolerance tolerance below which points are considered identical<a name="line.53"></a>
+<span class="sourceLineNo">054</span>     * @since 3.3<a name="line.54"></a>
+<span class="sourceLineNo">055</span>     */<a name="line.55"></a>
+<span class="sourceLineNo">056</span>    public PolyhedronsSet(final double tolerance) {<a name="line.56"></a>
+<span class="sourceLineNo">057</span>        super(tolerance);<a name="line.57"></a>
+<span class="sourceLineNo">058</span>    }<a name="line.58"></a>
+<span class="sourceLineNo">059</span><a name="line.59"></a>
+<span class="sourceLineNo">060</span>    /** Build a polyhedrons set from a BSP tree.<a name="line.60"></a>
+<span class="sourceLineNo">061</span>     * &lt;p&gt;The leaf nodes of the BSP tree &lt;em&gt;must&lt;/em&gt; have a<a name="line.61"></a>
+<span class="sourceLineNo">062</span>     * {@code Boolean} attribute representing the inside status of<a name="line.62"></a>
+<span class="sourceLineNo">063</span>     * the corresponding cell (true for inside cells, false for outside<a name="line.63"></a>
+<span class="sourceLineNo">064</span>     * cells). In order to avoid building too many small objects, it is<a name="line.64"></a>
+<span class="sourceLineNo">065</span>     * recommended to use the predefined constants<a name="line.65"></a>
+<span class="sourceLineNo">066</span>     * {@code Boolean.TRUE} and {@code Boolean.FALSE}&lt;/p&gt;<a name="line.66"></a>
+<span class="sourceLineNo">067</span>     * &lt;p&gt;<a name="line.67"></a>
+<span class="sourceLineNo">068</span>     * This constructor is aimed at expert use, as building the tree may<a name="line.68"></a>
+<span class="sourceLineNo">069</span>     * be a difficult task. It is not intended for general use and for<a name="line.69"></a>
+<span class="sourceLineNo">070</span>     * performances reasons does not check thoroughly its input, as this would<a name="line.70"></a>
+<span class="sourceLineNo">071</span>     * require walking the full tree each time. Failing to provide a tree with<a name="line.71"></a>
+<span class="sourceLineNo">072</span>     * the proper attributes, &lt;em&gt;will&lt;/em&gt; therefore generate problems like<a name="line.72"></a>
+<span class="sourceLineNo">073</span>     * {@link NullPointerException} or {@link ClassCastException} only later on.<a name="line.73"></a>
+<span class="sourceLineNo">074</span>     * This limitation is known and explains why this constructor is for expert<a name="line.74"></a>
+<span class="sourceLineNo">075</span>     * use only. The caller does have the responsibility to provided correct arguments.<a name="line.75"></a>
+<span class="sourceLineNo">076</span>     * &lt;/p&gt;<a name="line.76"></a>
+<span class="sourceLineNo">077</span>     * @param tree inside/outside BSP tree representing the region<a name="line.77"></a>
+<span class="sourceLineNo">078</span>     * @param tolerance tolerance below which points are considered identical<a name="line.78"></a>
+<span class="sourceLineNo">079</span>     * @since 3.3<a name="line.79"></a>
+<span class="sourceLineNo">080</span>     */<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    public PolyhedronsSet(final BSPTree&lt;Euclidean3D&gt; tree, final double tolerance) {<a name="line.81"></a>
+<span class="sourceLineNo">082</span>        super(tree, tolerance);<a name="line.82"></a>
+<span class="sourceLineNo">083</span>    }<a name="line.83"></a>
+<span class="sourceLineNo">084</span><a name="line.84"></a>
+<span class="sourceLineNo">085</span>    /** Build a polyhedrons set from a Boundary REPresentation (B-rep) specified by sub-hyperplanes.<a name="line.85"></a>
+<span class="sourceLineNo">086</span>     * &lt;p&gt;The boundary is provided as a collection of {@link<a name="line.86"></a>
+<span class="sourceLineNo">087</span>     * SubHyperplane sub-hyperplanes}. Each sub-hyperplane has the<a name="line.87"></a>
+<span class="sourceLineNo">088</span>     * interior part of the region on its minus side and the exterior on<a name="line.88"></a>
+<span class="sourceLineNo">089</span>     * its plus side.&lt;/p&gt;<a name="line.89"></a>
+<span class="sourceLineNo">090</span>     * &lt;p&gt;The boundary elements can be in any order, and can form<a name="line.90"></a>
+<span class="sourceLineNo">091</span>     * several non-connected sets (like for example polyhedrons with holes<a name="line.91"></a>
+<span class="sourceLineNo">092</span>     * or a set of disjoint polyhedrons considered as a whole). In<a name="line.92"></a>
+<span class="sourceLineNo">093</span>     * fact, the elements do not even need to be connected together<a name="line.93"></a>
+<span class="sourceLineNo">094</span>     * (their topological connections are not used here). However, if the<a name="line.94"></a>
+<span class="sourceLineNo">095</span>     * boundary does not really separate an inside open from an outside<a name="line.95"></a>
+<span class="sourceLineNo">096</span>     * open (open having here its topological meaning), then subsequent<a name="line.96"></a>
+<span class="sourceLineNo">097</span>     * calls to the {@link Region#checkPoint(Point) checkPoint} method will<a name="line.97"></a>
+<span class="sourceLineNo">098</span>     * not be meaningful anymore.&lt;/p&gt;<a name="line.98"></a>
+<span class="sourceLineNo">099</span>     * &lt;p&gt;If the boundary is empty, the region will represent the whole<a name="line.99"></a>
+<span class="sourceLineNo">100</span>     * space.&lt;/p&gt;<a name="line.100"></a>
+<span class="sourceLineNo">101</span>     * @param boundary collection of boundary elements, as a<a name="line.101"></a>
+<span class="sourceLineNo">102</span>     * collection of {@link SubHyperplane SubHyperplane} objects<a name="line.102"></a>
+<span class="sourceLineNo">103</span>     * @param tolerance tolerance below which points are considered identical<a name="line.103"></a>
+<span class="sourceLineNo">104</span>     * @since 3.3<a name="line.104"></a>
+<span class="sourceLineNo">105</span>     */<a name="line.105"></a>
+<span class="sourceLineNo">106</span>    public PolyhedronsSet(final Collection&lt;SubHyperplane&lt;Euclidean3D&gt;&gt; boundary,<a name="line.106"></a>
+<span class="sourceLineNo">107</span>                          final double tolerance) {<a name="line.107"></a>
+<span class="sourceLineNo">108</span>        super(boundary, tolerance);<a name="line.108"></a>
+<span class="sourceLineNo">109</span>    }<a name="line.109"></a>
+<span class="sourceLineNo">110</span><a name="line.110"></a>
+<span class="sourceLineNo">111</span>    /** Build a polyhedrons set from a Boundary REPresentation (B-rep) specified by connected vertices.<a name="line.111"></a>
+<span class="sourceLineNo">112</span>     * &lt;p&gt;<a name="line.112"></a>
+<span class="sourceLineNo">113</span>     * The boundary is provided as a list of vertices and a list of facets.<a name="line.113"></a>
+<span class="sourceLineNo">114</span>     * Each facet is specified as an integer array containing the arrays vertices<a name="line.114"></a>
+<span class="sourceLineNo">115</span>     * indices in the vertices list. Each facet normal is oriented by right hand<a name="line.115"></a>
+<span class="sourceLineNo">116</span>     * rule to the facet vertices list.<a name="line.116"></a>
+<span class="sourceLineNo">117</span>     * &lt;/p&gt;<a name="line.117"></a>
+<span class="sourceLineNo">118</span>     * &lt;p&gt;<a name="line.118"></a>
+<span class="sourceLineNo">119</span>     * Some basic sanity checks are performed but not everything is thoroughly<a name="line.119"></a>
+<span class="sourceLineNo">120</span>     * assessed, so it remains under caller responsibility to ensure the vertices<a name="line.120"></a>
+<span class="sourceLineNo">121</span>     * and facets are consistent and properly define a polyhedrons set.<a name="line.121"></a>
+<span class="sourceLineNo">122</span>     * &lt;/p&gt;<a name="line.122"></a>
+<span class="sourceLineNo">123</span>     * @param vertices list of polyhedrons set vertices<a name="line.123"></a>
+<span class="sourceLineNo">124</span>     * @param facets list of facets, as vertices indices in the vertices list<a name="line.124"></a>
+<span class="sourceLineNo">125</span>     * @param tolerance tolerance below which points are considered identical<a name="line.125"></a>
+<span class="sourceLineNo">126</span>     * @exception MathIllegalArgumentException if some basic sanity checks fail<a name="line.126"></a>

[... 617 lines stripped ...]


Mime
View raw message