Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Ching-Hsiang Hsu, Yi-Jen Chiang, and Chee Yap. Rods and Rings: Soft Subdivision Planner for R^3 x S^2. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 43:1-43:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hsu_et_al:LIPIcs.SoCG.2019.43, author = {Hsu, Ching-Hsiang and Chiang, Yi-Jen and Yap, Chee}, title = {{Rods and Rings: Soft Subdivision Planner for R^3 x S^2}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {43:1--43:17}, 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.43}, URN = {urn:nbn:de:0030-drops-104477}, doi = {10.4230/LIPIcs.SoCG.2019.43}, annote = {Keywords: Algorithmic Motion Planning, Subdivision Methods, Resolution-Exact Algorithms, Soft Predicates, Spatial Rod Robots, Spatial Ring Robots} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Chloe Ching-Yun Hsu and Chris Umans. On Multidimensional and Monotone k-SUM. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hsu_et_al:LIPIcs.MFCS.2017.50, author = {Hsu, Chloe Ching-Yun and Umans, Chris}, title = {{On Multidimensional and Monotone k-SUM}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.50}, URN = {urn:nbn:de:0030-drops-80618}, doi = {10.4230/LIPIcs.MFCS.2017.50}, annote = {Keywords: 3SUM, kSUM, monotone 3SUM, strong 3SUM conjecture} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Ching-Hsiang Hsu, John Paul Ryan, and Chee Yap. Path Planning for Simple Robots using Soft Subdivision Search. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 68:1-68:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hsu_et_al:LIPIcs.SoCG.2016.68, author = {Hsu, Ching-Hsiang and Ryan, John Paul and Yap, Chee}, title = {{Path Planning for Simple Robots using Soft Subdivision Search}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {68:1--68:5}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.68}, URN = {urn:nbn:de:0030-drops-59607}, doi = {10.4230/LIPIcs.SoCG.2016.68}, annote = {Keywords: Robot Path Planning, Soft Predicates, Resolution-Exact Algorithm, Subdivision Search} }
Feedback for Dagstuhl Publishing