Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Ahmed Abdelkader and David M. Mount. Smooth Distance Approximation. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{abdelkader_et_al:LIPIcs.ESA.2023.5, author = {Abdelkader, Ahmed and Mount, David M.}, title = {{Smooth Distance Approximation}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.5}, URN = {urn:nbn:de:0030-drops-186589}, doi = {10.4230/LIPIcs.ESA.2023.5}, annote = {Keywords: Approximation algorithms, convexity, continuity, partition of unity} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Ahmed Abdelkader and David M. Mount. Approximate Nearest-Neighbor Search for Line Segments. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2021.4, author = {Abdelkader, Ahmed and Mount, David M.}, title = {{Approximate Nearest-Neighbor Search for Line Segments}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.4}, URN = {urn:nbn:de:0030-drops-138039}, doi = {10.4230/LIPIcs.SoCG.2021.4}, annote = {Keywords: Approximate nearest-neighbor searching, Approximate Voronoi diagrams, Line segments, Macbeath regions} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Alejandro Flores-Velazco and David M. Mount. Coresets for the Nearest-Neighbor Rule. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 47:1-47:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{floresvelazco_et_al:LIPIcs.ESA.2020.47, author = {Flores-Velazco, Alejandro and Mount, David M.}, title = {{Coresets for the Nearest-Neighbor Rule}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {47:1--47:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.47}, URN = {urn:nbn:de:0030-drops-129138}, doi = {10.4230/LIPIcs.ESA.2020.47}, annote = {Keywords: coresets, nearest-neighbor rule, classification, nearest-neighbor condensation, training-set reduction, approximate nearest-neighbor, approximation algorithms} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi. Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 1:1-1:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2018.1, author = {Abdelkader, Ahmed and Bajaj, Chandrajit L. and Ebeida, Mohamed S. and Mahmoud, Ahmed H. and Mitchell, Scott A. and Owens, John D. and Rushdi, Ahmad A.}, title = {{Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.1}, URN = {urn:nbn:de:0030-drops-87147}, doi = {10.4230/LIPIcs.SoCG.2018.1}, annote = {Keywords: sampling conditions, surface reconstruction, polyhedral meshing, Voronoi} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi. VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 77:1-77:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2018.77, author = {Abdelkader, Ahmed and Bajaj, Chandrajit L. and Ebeida, Mohamed S. and Mahmoud, Ahmed H. and Mitchell, Scott A. and Owens, John D. and Rushdi, Ahmad A.}, title = {{VoroCrust Illustrated: Theory and Challenges}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {77:1--77:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.77}, URN = {urn:nbn:de:0030-drops-87903}, doi = {10.4230/LIPIcs.SoCG.2018.77}, annote = {Keywords: sampling, surface reconstruction, polyhedral meshing, Voronoi} }
Published in: LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Ahmed Abdelkader and David M. Mount. Economical Delone Sets for Approximating Convex Bodies. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 4:1-4:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SWAT.2018.4, author = {Abdelkader, Ahmed and Mount, David M.}, title = {{Economical Delone Sets for Approximating Convex Bodies}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-068-2}, ISSN = {1868-8969}, year = {2018}, volume = {101}, editor = {Eppstein, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.4}, URN = {urn:nbn:de:0030-drops-88300}, doi = {10.4230/LIPIcs.SWAT.2018.4}, annote = {Keywords: Approximate polytope membership, Macbeath regions, Delone sets, Hilbert geometry} }
Published in: LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016)
Ahmed Abdelkader, Aditya Acharya, and Philip Dasler. 2048 Without New Tiles Is Still Hard. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 1:1-1:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{abdelkader_et_al:LIPIcs.FUN.2016.1, author = {Abdelkader, Ahmed and Acharya, Aditya and Dasler, Philip}, title = {{2048 Without New Tiles Is Still Hard}}, booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-005-7}, ISSN = {1868-8969}, year = {2016}, volume = {49}, editor = {Demaine, Erik D. and Grandoni, Fabrizio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.1}, URN = {urn:nbn:de:0030-drops-58858}, doi = {10.4230/LIPIcs.FUN.2016.1}, annote = {Keywords: Complexity of Games, 2048} }
Feedback for Dagstuhl Publishing