" The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to
geometers and combinatorialists. The special spirit of the book is very much alive even in …

The paradigm of coresets has recently emerged as a powerful tool for efficiently
approximating various extent measures of a point set P. Using this paradigm, one quickly …

Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers)
and their corresponding proportions (or abundances) from an observed hyperspectral …

We present a general technique for approximating various descriptors of the extent of a set P
of n points in R d when the dimension d is an arbitrary fixed constant. For a given extent …

Approximation of convex sets by polytopes | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Journal of …

This paper studies the polynomial basis that generates the smallest n-simplex enclosing a
given n th-degree polynomial curve in R n. Although the Bernstein and B-Spline polynomial …

Hyperspectral unmixing (HU) is a crucial signal processing procedure to identify the
underlying materials (or endmembers) and their corresponding proportions (or abundances) …

Fused filament fabrication is the method of choice for printing 3D models at low cost and is
the de facto standard for hobbyists, makers, and schools. Unfortunately, filament printers …

The notion of ε-kernel was introduced by Agarwal et al. to set up a unified framework for
computing various extent measures of a point set p approximately. Roughly speaking, a …

The problem of finding ad-simplex of maximum volume in an arbitrary d-dimensional V-
polytope, for arbitrary d, was shown by Gritzmann et al.[GKL] in 1995 to be NP-hard. They …