From post

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.

, , , , , , и . GIScience (II), том 208 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Maximum-area triangle in a convex polygon, revisited., , , , и . Inf. Process. Lett., (2020)Folding polyominoes with holes into a cube, , , , , , , , , и 1 other автор(ы). Computational Geometry, (2021)Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352)., , , и . Dagstuhl Reports, 9 (8): 84-112 (2019)Lombardi Drawings of Knots and Links, , , , , и . Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), том 10692 из Lecture Notes in Computer Science, стр. 113--126. Springer, (сентября 2017)Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane., , , и . Discret. Comput. Geom., 64 (3): 575-607 (2020)A fully polynomial time approximation scheme for the smallest diameter of imprecise points., , и . Theor. Comput. Sci., (2020)Minimum color spanning circle of imprecise points., , , , и . CoRR, (2022)The Complexity of Data-Driven Norm Synthesis and Revision., , , , , и . CoRR, (2021)Removing Popular Faces in Curve Arrangements., , , , , , и . CoRR, (2022)A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition).. SoCG, том 129 из LIPIcs, стр. 65:1-65:2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)