Practical methods for shape fitting and kinetic data structures using core sets

DOI10.1145/997817.997858zbMath1375.68173OpenAlexW2076445420MaRDI QIDQ5361679

Raghunath Poreddy, Hai Yu, Pankaj K. Agarwal, Kasturi R. Varadarajan

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

zbMATH Keywords

kinetic data structurescore setsshape fittingextent measures

Mathematics Subject Classification ID

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

Related Items (7)

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions ⋮ An almost space-optimal streaming algorithm for coresets in fixed dimensions ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Unnamed Item ⋮ Minimum-volume enclosing ellipsoids and core sets

This page was built for publication: Practical methods for shape fitting and kinetic data structures using core sets