

Java example source code file (AklToussaintHeuristic.java)
The AklToussaintHeuristic.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/LICENSE2.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.euclidean.twod.hull; import java.util.ArrayList; import java.util.Collection; import java.util.List; import org.apache.commons.math3.geometry.euclidean.twod.Vector2D; /** * A simple heuristic to improve the performance of convex hull algorithms. * <p> * The heuristic is based on the idea of a convex quadrilateral, which is formed by * four points with the lowest and highest x / y coordinates. Any point that lies inside * this quadrilateral can not be part of the convex hull and can thus be safely discarded * before generating the convex hull itself. * <p> * The complexity of the operation is O(n), and may greatly improve the time it takes to * construct the convex hull afterwards, depending on the point distribution. * * @see <a href="http://en.wikipedia.org/wiki/Convex_hull_algorithms#AklToussaint_heuristic"> * AklToussaint heuristic (Wikipedia)</a> * @since 3.3 */ public final class AklToussaintHeuristic { /** Hide utility constructor. */ private AklToussaintHeuristic() { } /** * Returns a point set that is reduced by all points for which it is safe to assume * that they are not part of the convex hull. * * @param points the original point set * @return a reduced point set, useful as input for convex hull algorithms */ public static Collection<Vector2D> reducePoints(final Collection Other Java examples (source code examples)Here is a short list of links related to this Java AklToussaintHeuristic.java source code file: 
Copyright 19982019 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.