( en | de | ru )

 

Disambiguation of "Kirkpatrick, David G."

Author of the publication

copydeleteadd this publication to your clipboard
Computing Common Tangents Without a Separating Line.

, and . WADS, volume 955 of Lecture Notes in Computer Science, page 183-193. Springer, (1995)

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.

David G Wigg

David G Long

Gail Kirkpatrick

Grant Kirkpatrick

David J G Dwertmann

 

Other publications of authors with the same name

Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation., and . Fundam. Informaticae, 22 (4): 353-370 (1995)Kinetic Collision Detection for Simple Polygons., , and . Int. J. Comput. Geom. Appl., 12 (1-2): 3-27 (2002)Probabilistic Leader Election on Rings of Known Size., , , and . WADS, volume 519 of Lecture Notes in Computer Science, page 481-495. Springer, (1991)Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability., , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 45-56. Springer, (2014)Computing Common Tangents Without a Separating Line., and . WADS, volume 955 of Lecture Notes in Computer Science, page 183-193. Springer, (1995)On the Complexity of General Graph Factor Problems., and . SIAM J. Comput., 12 (3): 601-609 (1983)Alphabetic Minimax Trees., and . SIAM J. Comput., 14 (3): 514-526 (1985)The Ultimate Planar Convex Hull Algorithm?, and . SIAM J. Comput., 15 (1): 287-299 (1986)Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings., , , and . J. Algorithms, 23 (2): 291-328 (1997)Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings., , , and . J. ACM, 41 (2): 277-310 (1994)