Applications of Chebyshev polynomials to low-dimensional computational geometry

DOI10.4230/LIPICS.SOCG.2017.26MaRDI QIDQ4580100zbMATH OpenFDO

Authors Timothy M. Chan

Publication date 13 August 2018

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2017.26

zbMATH Keywords

approximate nearest neighbor searchcoresetsdiameterpolynomial methodstreaming

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Applications of Chebyshev polynomials to low-dimensional computational geometry
• Chebyshev approximation to data by geometric elements
• scientific article; zbMATH DE number 665688
• Near-optimal -kernel construction and related problems
• Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)

Cited in

(4)

• Chebyshev approximation to data by geometric elements
• Applications of Chebyshev polynomials to low-dimensional computational geometry
• Approximate convex hull of data streams
• Approximate convex intersection detection with applications to width and Minkowski sums

This page was built for publication: Applications of Chebyshev polynomials to low-dimensional computational geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580100)