Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Sunil Arya and David M. Mount. Optimal Volume-Sensitive Bounds for Polytope Approximation. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{arya_et_al:LIPIcs.SoCG.2023.9, author = {Arya, Sunil and Mount, David M.}, title = {{Optimal Volume-Sensitive Bounds for Polytope Approximation}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.9}, URN = {urn:nbn:de:0030-drops-178592}, doi = {10.4230/LIPIcs.SoCG.2023.9}, annote = {Keywords: Approximation algorithms, convexity, Macbeath regions} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Sunil Arya, Guilherme D. da Fonseca, and David M. Mount. Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{arya_et_al:LIPIcs.ESA.2018.3, author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.}, title = {{Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.3}, URN = {urn:nbn:de:0030-drops-94664}, doi = {10.4230/LIPIcs.ESA.2018.3}, annote = {Keywords: Minkowski sum, convex intersection, width, approximation} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Sunil Arya, Guilherme D. da Fonseca, and David M. Mount. Near-Optimal epsilon-Kernel Construction and Related Problems. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{arya_et_al:LIPIcs.SoCG.2017.10, author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.}, title = {{Near-Optimal epsilon-Kernel Construction and Related Problems}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.10}, URN = {urn:nbn:de:0030-drops-72257}, doi = {10.4230/LIPIcs.SoCG.2017.10}, annote = {Keywords: Approximation, diameter, kernel, coreset, nearest neighbor, polytope membership, bichromatic closest pair, Macbeath regions} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Sunil Arya, Guilherme D. da Fonseca, and David M. Mount. On the Combinatorial Complexity of Approximating Polytopes. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{arya_et_al:LIPIcs.SoCG.2016.11, author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.}, title = {{On the Combinatorial Complexity of Approximating Polytopes}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.11}, URN = {urn:nbn:de:0030-drops-59034}, doi = {10.4230/LIPIcs.SoCG.2016.11}, annote = {Keywords: Polytope approximation, Convex polytopes, Macbeath regions} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Sunil Arya, David M. Mount, and Eunhui Park. Approximate Geometric MST Range Queries. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 781-795, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{arya_et_al:LIPIcs.SOCG.2015.781, author = {Arya, Sunil and Mount, David M. and Park, Eunhui}, title = {{Approximate Geometric MST Range Queries}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {781--795}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.781}, URN = {urn:nbn:de:0030-drops-51233}, doi = {10.4230/LIPIcs.SOCG.2015.781}, annote = {Keywords: Geometric data structures, Minimum spanning trees, Range searching, Approximation algorithms} }
Feedback for Dagstuhl Publishing