Pankaj Kumar Agarwal, Helmut Alt, and Monique Teillaud. 09111 Abstracts Collection – Computational Geometry. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{agarwal_et_al:DagSemProc.09111.1, author = {Agarwal, Pankaj Kumar and Alt, Helmut and Teillaud, Monique}, title = {{09111 Abstracts Collection – Computational Geometry}}, booktitle = {Computational Geometry}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.1}, URN = {urn:nbn:de:0030-drops-20346}, doi = {10.4230/DagSemProc.09111.1}, annote = {Keywords: } }
Daniel Kane, Gregory Nathan Price, and Erik Demaine. A Pseudopolynomial Algorithm for Alexandrov's Theorem. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kane_et_al:DagSemProc.09111.2, author = {Kane, Daniel and Price, Gregory Nathan and Demaine, Erik}, title = {{A Pseudopolynomial Algorithm for Alexandrov's Theorem}}, booktitle = {Computational Geometry}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.2}, URN = {urn:nbn:de:0030-drops-20328}, doi = {10.4230/DagSemProc.09111.2}, annote = {Keywords: Folding, metrics, pseudopolynomial, algorithms} }
Joachim Giesen and Manjunath Madhusudan. Minimizing Absolute Gaussian Curvature Locally. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{giesen_et_al:DagSemProc.09111.3, author = {Giesen, Joachim and Madhusudan, Manjunath}, title = {{Minimizing Absolute Gaussian Curvature Locally}}, booktitle = {Computational Geometry}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.3}, URN = {urn:nbn:de:0030-drops-20311}, doi = {10.4230/DagSemProc.09111.3}, annote = {Keywords: Absolute Gaussian curvature, surface reconstruction, mesh smoothing} }
Joseph S. Mitchell. Open Problem Session. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{mitchell:DagSemProc.09111.4, author = {Mitchell, Joseph S.}, title = {{Open Problem Session}}, booktitle = {Computational Geometry}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.4}, URN = {urn:nbn:de:0030-drops-20308}, doi = {10.4230/DagSemProc.09111.4}, annote = {Keywords: Open problems, computational geometry} }
Carola Wenk and Atlas F. Cook. Shortest Path Problems on a Polyhedral Surface. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{wenk_et_al:DagSemProc.09111.5, author = {Wenk, Carola and Cook, Atlas F.}, title = {{Shortest Path Problems on a Polyhedral Surface}}, booktitle = {Computational Geometry}, pages = {1--30}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.5}, URN = {urn:nbn:de:0030-drops-20332}, doi = {10.4230/DagSemProc.09111.5}, annote = {Keywords: Shortest paths, edge sequences} }
Günter Rote. Two Applications of Point Matching. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{rote:DagSemProc.09111.6, author = {Rote, G\"{u}nter}, title = {{Two Applications of Point Matching}}, booktitle = {Computational Geometry}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.6}, URN = {urn:nbn:de:0030-drops-20292}, doi = {10.4230/DagSemProc.09111.6}, annote = {Keywords: Bipartite matching, least-squares} }
Feedback for Dagstuhl Publishing