Abstract

ABSTRACTNon-convex hull concepts are used to describe shapes or images in data processing. The most widely used non-convex hull methods were introduced to visualize two- or three-dimensional data obtained via 3D scans or GPS signals. Data hulls have also been used as feasibility models in automotive control systems. For these higher-dimensional problems the computational complexity bears an important factor for data processing software. Commonly used methods, such as the convex hull, involve triangulations, which are numerically intractable in practice for dimensions above 10. Simple, spatial models can be computed and evaluated fast, using and floating point operations, respectively, but they perform poorly as feasibility classifiers if the data is close to infeasible regions. This article introduces a class of conic hulls that can be calculated for any input dimension with sub-quadratic, and evaluated with sub-linear, CPU complexity, respectively. These hulls are designed to include screening information of the measurement procedures embedded in the data generating processes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.