Author of the publication

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.

, , , , , , and . GIScience (II), volume 208 of LIPIcs, page 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Median-Type Condition for Graph Tiling., and . Electron. Notes Discret. Math., (2017)On the Number of Higher Order Delaunay Triangulations., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 217-228. Springer, (2010)Making triangulations 4-connected using flips., , , , and . Comput. Geom., 47 (2): 187-197 (2014)Non-crossing matchings of points with geometric objects., , , , , , , , , and 3 other author(s). Comput. Geom., 46 (1): 78-92 (2013)Peeling Potatoes Near-Optimally in Near-Linear Time., , , , and . SoCG, page 224. ACM, (2014)Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs., , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 196-210. Springer, (2019)Colored Ray Configurations., , , , , , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon., and . Discret. Math. Theor. Comput. Sci., 17 (1): 1-12 (2015)On crossing numbers of geometric proximity graphs., , , , , , and . Comput. Geom., 44 (4): 216-233 (2011)Stabbing Circles for Sets of Segments in the Plane., , , , and . Algorithmica, 80 (3): 849-884 (2018)