The quickhull algorithm for convex hulls
Reads0
Chats0
TLDR
This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm, and provides empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory.Abstract:
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory. computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floating-point arithmetic, this assumption can lead to serous errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of “thick” facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions.read more
Citations
More filters
Journal ArticleDOI
SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
Pauli Virtanen,Ralf Gommers,Travis E. Oliphant,Matt Haberland,Matt Haberland,Tyler Reddy,David Cournapeau,Evgeni Burovski,Pearu Peterson,Warren Weckesser,Jonathan Bright,Stefan van der Walt,Matthew Brett,Joshua Wilson,K. Jarrod Millman,Nikolay Mayorov,Andrew Nelson,Eric Jones,Robert Kern,Eric B. Larson,CJ Carey,Ilhan Polat,Yu Feng,Eric Moore,Jake Vanderplas,Denis Laxalde,Josef Perktold,Robert Cimrman,Ian Henriksen,Ian Henriksen,E. A. Quintero,Charles R. Harris,Anne M. Archibald,Antônio H. Ribeiro,Fabian Pedregosa,Paul van Mulbregt,SciPy . Contributors +36 more
TL;DR: SciPy as discussed by the authors is an open source scientific computing library for the Python programming language, which includes functionality spanning clustering, Fourier transforms, integration, interpolation, file I/O, linear algebra, image processing, orthogonal distance regression, minimization algorithms, signal processing, sparse matrix handling, computational geometry, and statistics.
Journal ArticleDOI
SciPy 1.0: fundamental algorithms for scientific computing in Python.
Pauli Virtanen,Ralf Gommers,Travis E. Oliphant,Matt Haberland,Matt Haberland,Tyler Reddy,David Cournapeau,Evgeni Burovski,Pearu Peterson,Warren Weckesser,Jonathan Bright,Stefan van der Walt,Matthew Brett,Joshua Wilson,K. Jarrod Millman,Nikolay Mayorov,Andrew Nelson,Eric Jones,Robert Kern,Eric B. Larson,CJ Carey,Ilhan Polat,Yu Feng,Eric Moore,Jake Vanderplas,Denis Laxalde,Josef Perktold,Robert Cimrman,Ian Henriksen,Ian Henriksen,E. A. Quintero,Charles R. Harris,Anne M. Archibald,Antônio H. Ribeiro,Fabian Pedregosa,Paul van Mulbregt,SciPy . Contributors +36 more
TL;DR: SciPy as discussed by the authors is an open-source scientific computing library for the Python programming language, which has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year.
Journal ArticleDOI
New multidimensional functional diversity indices for a multifaceted framework in functional ecology.
TL;DR: This study suggests that decomposition of functional diversity into its three primary components provides a meaningful framework for its quantification and for the classification of existing functional diversity indices.
Proceedings ArticleDOI
OBBTree: a hierarchical structure for rapid interference detection
TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.
Journal ArticleDOI
What's In A Name? Malay Seals As Onomastic Sources
TL;DR: This article serves both as a tutorial introduction to ROC graphs and as a practical guide for using them in research.
References
More filters
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Journal ArticleDOI
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Book ChapterDOI
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
TL;DR: Triangle as discussed by the authors is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunayer refinement algorithm for quality mesh generation, and it is shown that the problem of triangulating a planar straight line graph (PSLG) without introducing new small angles is impossible for some PSLGs.
Proceedings ArticleDOI
Applications of random sampling in computational geometry, II
TL;DR: Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.