Author of the publication

Visibility Testing and Counting.

, and . FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, page 343-351. Springer, (2011)

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

Pseudo-Triangle Visibility Graph: Characterization and Reconstruction., and . CoRR, (2019)Visibility Graphs of Anchor Polygons., and . TTCS, volume 9541 of Lecture Notes in Computer Science, page 72-89. Springer, (2015)Recognizing Visibility Graphs of Triangulated Irregular Networks., , and . Fundam. Informaticae, 179 (4): 345-360 (2021)Kinetic Euclidean minimum spanning tree in the plane., and . J. Discrete Algorithms, (2012)Touring Convex Polygons in Polygonal Domain Fences., , and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 61-75. Springer, (2017)Kinetic Euclidean Minimum Spanning Tree in the Plane., and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 261-274. Springer, (2011)A Combinatorial Approximation Algorithm for Correlation Clustering., and . CoRR, (2023)Visibility Testing and Counting., and . FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, page 343-351. Springer, (2011)Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon., , and . CCCG, page 249-252. Carleton University, Ottawa, Canada, (2007)Touring a Sequence of Line Segments in Polygonal Domain Fences., and . CCCG, Queen's University, Ontario, Canada, (2015)