|
Java example source code file (InsideFinder.java)
The InsideFinder.java Java example source code/* * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed with * this work for additional information regarding copyright ownership. * The ASF licenses this file to You under the Apache License, Version 2.0 * (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package org.apache.commons.math3.geometry.partitioning; import org.apache.commons.math3.geometry.Space; /** Utility class checking if inside nodes can be found * on the plus and minus sides of an hyperplane. * @param <S> Type of the space. * @since 3.4 */ class InsideFinder<S extends Space> { /** Region on which to operate. */ private final Region<S> region; /** Indicator of inside leaf nodes found on the plus side. */ private boolean plusFound; /** Indicator of inside leaf nodes found on the plus side. */ private boolean minusFound; /** Simple constructor. * @param region region on which to operate */ InsideFinder(final Region<S> region) { this.region = region; plusFound = false; minusFound = false; } /** Search recursively for inside leaf nodes on each side of the given hyperplane. * <p>The algorithm used here is directly derived from the one * described in section III (<i>Binary Partitioning of a BSP * Tree</i>) of the Bruce Naylor, John Amanatides and William * Thibault paper <a * href="http://www.cs.yorku.ca/~amana/research/bsptSetOp.pdf">Merging * BSP Trees Yields Polyhedral Set Operations</a> Proc. Siggraph * '90, Computer Graphics 24(4), August 1990, pp 115-124, published * by the Association for Computing Machinery (ACM)..</p> * @param node current BSP tree node * @param sub sub-hyperplane */ public void recurseSides(final BSPTree<S> node, final SubHyperplane Other Java examples (source code examples)Here is a short list of links related to this Java InsideFinder.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.