Published in: Dagstuhl Reports, Volume 13, Issue 8 (2024)
Susanne Crewell, Anne Driemel, Jeff M. Phillips, and Dwaipayan Chatterjee. Computational Geometry of Earth System Analysis (Dagstuhl Seminar 23342). In Dagstuhl Reports, Volume 13, Issue 8, pp. 91-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{crewell_et_al:DagRep.13.8.91, author = {Crewell, Susanne and Driemel, Anne and Phillips, Jeff M. and Chatterjee, Dwaipayan}, title = {{Computational Geometry of Earth System Analysis (Dagstuhl Seminar 23342)}}, pages = {91--105}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {8}, editor = {Crewell, Susanne and Driemel, Anne and Phillips, Jeff M. and Chatterjee, Dwaipayan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.8.91}, URN = {urn:nbn:de:0030-drops-198147}, doi = {10.4230/DagRep.13.8.91}, annote = {Keywords: Data reduction, Event detection, Feature tracking, Geometric algorithms, Interpolation methods, Sensor placement} }
Published in: Dagstuhl Reports, Volume 13, Issue 5 (2023)
Siu-Wing Cheng, Maarten Löffler, Jeff M. Phillips, and Aleksandr Popov. Computational Geometry (Dagstuhl Seminar 23221). In Dagstuhl Reports, Volume 13, Issue 5, pp. 165-181, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{cheng_et_al:DagRep.13.5.165, author = {Cheng, Siu-Wing and L\"{o}ffler, Maarten and Phillips, Jeff M. and Popov, Aleksandr}, title = {{Computational Geometry (Dagstuhl Seminar 23221)}}, pages = {165--181}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {5}, editor = {Cheng, Siu-Wing and L\"{o}ffler, Maarten and Phillips, Jeff M. and Popov, Aleksandr}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.5.165}, URN = {urn:nbn:de:0030-drops-193692}, doi = {10.4230/DagRep.13.5.165}, annote = {Keywords: Algorithms, Combinatorics, Geometric Computing, Reconfiguration, Uncertainty} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Michael Matheny and Jeff M. Phillips. Approximate Maximum Halfspace Discrepancy. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{matheny_et_al:LIPIcs.ISAAC.2021.4, author = {Matheny, Michael and Phillips, Jeff M.}, title = {{Approximate Maximum Halfspace Discrepancy}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.4}, URN = {urn:nbn:de:0030-drops-154377}, doi = {10.4230/LIPIcs.ISAAC.2021.4}, annote = {Keywords: range spaces, halfspaces, scan statistics, fine-grained complexity} }
Published in: Dagstuhl Reports, Volume 11, Issue 4 (2021)
Siu-Wing Cheng, Anne Driemel, and Jeff M. Phillips. Computational Geometry (Dagstuhl Seminar 21181). In Dagstuhl Reports, Volume 11, Issue 4, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{cheng_et_al:DagRep.11.4.1, author = {Cheng, Siu-Wing and Driemel, Anne and Phillips, Jeff M.}, title = {{Computational Geometry (Dagstuhl Seminar 21181)}}, pages = {1--19}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {4}, editor = {Cheng, Siu-Wing and Driemel, Anne and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.4.1}, URN = {urn:nbn:de:0030-drops-147963}, doi = {10.4230/DagRep.11.4.1}, annote = {Keywords: algorithms, computational geometry, Computational topology, data structures, Discrete geometry} }
Published in: LIPIcs, Volume 208, 11th International Conference on Geographic Information Science (GIScience 2021) - Part II
Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G.T. Meijer, Maria Saumell, Rodrigo I. Silveira, and Frank Staals. Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{acharyya_et_al:LIPIcs.GIScience.2021.II.10, author = {Acharyya, Ankush and Jallu, Ramesh K. and L\"{o}ffler, Maarten and Meijer, Gert G.T. and Saumell, Maria and Silveira, Rodrigo I. and Staals, Frank}, title = {{Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds}}, booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-208-2}, ISSN = {1868-8969}, year = {2021}, volume = {208}, editor = {Janowicz, Krzysztof and Verstegen, Judith A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.10}, URN = {urn:nbn:de:0030-drops-147697}, doi = {10.4230/LIPIcs.GIScience.2021.II.10}, annote = {Keywords: Digital elevation model, Triangulated irregular network, Viewshed complexity} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Jasper C.H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, and Wai Ming Tai. Finding an Approximate Mode of a Kernel Density Estimate. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 61:1-61:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lee_et_al:LIPIcs.ESA.2021.61, author = {Lee, Jasper C.H. and Li, Jerry and Musco, Christopher and Phillips, Jeff M. and Tai, Wai Ming}, title = {{Finding an Approximate Mode of a Kernel Density Estimate}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {61:1--61:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.61}, URN = {urn:nbn:de:0030-drops-146428}, doi = {10.4230/LIPIcs.ESA.2021.61}, annote = {Keywords: Kernel density estimation, Dimensionality reduction, Coresets, Means-shift} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Jeff M. Phillips and Wai Ming Tai. The GaussianSketch for Almost Relative Error Kernel Distance. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{phillips_et_al:LIPIcs.APPROX/RANDOM.2020.12, author = {Phillips, Jeff M. and Tai, Wai Ming}, title = {{The GaussianSketch for Almost Relative Error Kernel Distance}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.12}, URN = {urn:nbn:de:0030-drops-126150}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.12}, annote = {Keywords: Kernel Distance, Kernel Density Estimation, Sketching} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Jeff M. Phillips and Pingfan Tang. Sketched MinDist. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 63:1-63:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{phillips_et_al:LIPIcs.SoCG.2020.63, author = {Phillips, Jeff M. and Tang, Pingfan}, title = {{Sketched MinDist}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {63:1--63:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.63}, URN = {urn:nbn:de:0030-drops-122218}, doi = {10.4230/LIPIcs.SoCG.2020.63}, annote = {Keywords: curve similarity, sensitivity sampling, sketching} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Peyman Afshani and Jeff M. Phillips. Independent Range Sampling, Revisited Again. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2019.4, author = {Afshani, Peyman and Phillips, Jeff M.}, title = {{Independent Range Sampling, Revisited Again}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.4}, URN = {urn:nbn:de:0030-drops-104088}, doi = {10.4230/LIPIcs.SoCG.2019.4}, annote = {Keywords: Range Searching, Data Structures, Sampling} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Anne Driemel, Jeff M. Phillips, and Ioannis Psarros. The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{driemel_et_al:LIPIcs.SoCG.2019.28, author = {Driemel, Anne and Phillips, Jeff M. and Psarros, Ioannis}, title = {{The VC Dimension of Metric Balls Under Fr\'{e}chet and Hausdorff Distances}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.28}, URN = {urn:nbn:de:0030-drops-104329}, doi = {10.4230/LIPIcs.SoCG.2019.28}, annote = {Keywords: VC dimension, Fr\'{e}chet distance, Hausdorff distance} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Michael Matheny and Jeff M. Phillips. Computing Approximate Statistical Discrepancy. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{matheny_et_al:LIPIcs.ISAAC.2018.32, author = {Matheny, Michael and Phillips, Jeff M.}, title = {{Computing Approximate Statistical Discrepancy}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.32}, URN = {urn:nbn:de:0030-drops-99800}, doi = {10.4230/LIPIcs.ISAAC.2018.32}, annote = {Keywords: Scan Statistics, Discrepancy, Rectangles} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Michael Matheny and Jeff M. Phillips. Practical Low-Dimensional Halfspace Range Space Sampling. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{matheny_et_al:LIPIcs.ESA.2018.62, author = {Matheny, Michael and Phillips, Jeff M.}, title = {{Practical Low-Dimensional Halfspace Range Space Sampling}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {62:1--62: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.62}, URN = {urn:nbn:de:0030-drops-95250}, doi = {10.4230/LIPIcs.ESA.2018.62}, annote = {Keywords: Partitions, Range Spaces, Sampling, Halfspaces} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Kevin Buchin, Jeff M. Phillips, and Pingfan Tang. Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2018.16, author = {Buchin, Kevin and Phillips, Jeff M. and Tang, Pingfan}, title = {{Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {16:1--16:14}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.16}, URN = {urn:nbn:de:0030-drops-87292}, doi = {10.4230/LIPIcs.SoCG.2018.16}, annote = {Keywords: Uncertain Data, Robust Estimators, Geometric Median, Tukey Median} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Jeff M. Phillips and Wai Ming Tai. Near-Optimal Coresets of Kernel Density Estimates. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 66:1-66:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{phillips_et_al:LIPIcs.SoCG.2018.66, author = {Phillips, Jeff M. and Tai, Wai Ming}, title = {{Near-Optimal Coresets of Kernel Density Estimates}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {66:1--66:13}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.66}, URN = {urn:nbn:de:0030-drops-87797}, doi = {10.4230/LIPIcs.SoCG.2018.66}, annote = {Keywords: Coresets, Kernel Density Estimate, Discrepancy} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Lingxiao Huang, Jian Li, Jeff M. Phillips, and Haitao Wang. epsilon-Kernel Coresets for Stochastic Points. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 50:1-50:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{huang_et_al:LIPIcs.ESA.2016.50, author = {Huang, Lingxiao and Li, Jian and Phillips, Jeff M. and Wang, Haitao}, title = {{epsilon-Kernel Coresets for Stochastic Points}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {50:1--50:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.50}, URN = {urn:nbn:de:0030-drops-63921}, doi = {10.4230/LIPIcs.ESA.2016.50}, annote = {Keywords: e-kernel, coreset, stochastic point, shape fitting} }
Feedback for Dagstuhl Publishing