R Implementation of a Polyhedral Approximation to a 3D Set of Points Using the ?-Shape
This work presents the implementation in R of the ?-shape of a finite set of points in the three-dimensional space R3. This geometric structure generalizes the convex hull and allows to recover the shape of non-convex and even non-connected sets in 3D, given a ran- dom sample of points taken into it...
Main Authors: | Thomas Lafarge, Beatriz Pateiro-López, Antonio Possolo, Joy Dunkers |
---|---|
Format: | Article |
Language: | English |
Published: |
Foundation for Open Access Statistics
2014-01-01
|
Series: | Journal of Statistical Software |
Online Access: | http://www.jstatsoft.org/index.php/jss/article/view/2114 |
Similar Items
-
Extended Superspheres for Shape Approximation of Near Polyhedral Nanoparticles and a Measure of the Degree of Polyhedrality
by: Susumu Onaka
Published: (2016-02-01) -
Polyhedral Star-Shaped Distributions
by: Wolf-Dieter Richter, et al.
Published: (2017-01-01) -
Polyhedral approximation in mixed-integer convex optimization
by: Yamangil, Emre, et al.
Published: (2018) -
Polyhedral Surface Approximation of Non-Convex Voxel Sets and Improvements to the Convex Hull Computing Method
by: Schulz, Henrik
Published: (2010) -
Extending Polyhedral Techniques towards Parallel Specifications and Approximations
by: Isoard, Alexandre
Published: (2016)