Applications of Chebyshev polynomials to low-dimensional computational geometry

DOI10.4230/LIPICS.SOCG.2017.26zbMATH Open1417.68232MaRDI QIDQ4580100FDOQ4580100

Timothy M. Chan

Publication date: 13 August 2018

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 \(\varepsilon\)-kernel construction and related problems
• Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)

zbMATH Keywords

diameterpolynomial methodstreamingcoresetsapproximate nearest neighbor search

Mathematics Subject Classification ID

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

Cited In (2)

• Approximate Convex Hull of Data Streams
• Title not available (Why is that?)

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)