Author of the publication

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.

, , , and . SoCG, volume 99 of LIPIcs, page 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

State Complexity of Prefix Distance., , and . CIAA, volume 9223 of Lecture Notes in Computer Science, page 238-249. Springer, (2015)State Complexity of Suffix Distance., , and . DCFS, volume 10316 of Lecture Notes in Computer Science, page 287-298. Springer, (2017)A linear algorithm for eliminating hidden-lines from a polygonal cylinder.. Vis. Comput., 2 (1): 44-53 (1986)Decision trees for geometric models., , , , and . Int. J. Comput. Geom. Appl., 8 (3): 343-364 (1998)Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report).. WADS, volume 382 of Lecture Notes in Computer Science, page 57-66. Springer, (1989)Optimality criteria for controlled discontinous processes., and . Inf. Sci., 17 (1): 75-90 (1979)Algorithms for Computing Geometric Measures of Melodic Similarity., , , , , , , and . Computer Music Journal, 30 (3): 67-76 (2006)Computing Simple Circuits form a Set of Line Segments., , and . Discret. Comput. Geom., (1990)Quasi-Distances and Weighted Finite Automata., , and . The Role of Theory in Computer Science, page 135-152. World Scientific, (2017)The visibility graph of congruent discs is Hamiltonian.. Comput. Geom., 25 (3): 257-265 (2003)