Practical methods for shape fitting and kinetic data structures using core sets
From MaRDI portal
Publication:5361679
DOI10.1145/997817.997858zbMath1375.68173MaRDI QIDQ5361679
Pankaj K. Agarwal, Hai Yu, Kasturi R. Varadarajan, Raghunath Poreddy
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7fd479e6cfb7d1355e5ea44ef9caaa4ecd4d4ce7
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
An almost space-optimal streaming algorithm for coresets in fixed dimensions, Minimum-volume enclosing ellipsoids and core sets, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Faster core-set constructions and data-stream algorithms in fixed dimensions, Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy, An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions