pdf-format: |
|
@InProceedings{rutschmann_et_al:LIPIcs.SoCG.2022.59, author = {Rutschmann, Daniel and Wettstein, Manuel}, title = {{Chains, Koch Chains, and Point Sets with Many Triangulations}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {59:1--59:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16067}, URN = {urn:nbn:de:0030-drops-160678}, doi = {10.4230/LIPIcs.SoCG.2022.59}, annote = {Keywords: Planar Point Set, Chain, Koch Chain, Triangulation, Maximum Number of Triangulations, Lower Bound} }
Keywords: | Planar Point Set, Chain, Koch Chain, Triangulation, Maximum Number of Triangulations, Lower Bound | |
Seminar: | 38th International Symposium on Computational Geometry (SoCG 2022) | |
Issue date: | 2022 | |
Date of publication: | 01.06.2022 |