( en | de | ru )

 

Disambiguation of "Kirkpatrick, David G."

Author of the publication

copydeleteadd this publication to your clipboard
Implicitly Searching Convolutions and Computing Depth of Collision.

, , , and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 165-180. Springer, (1990)

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

Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time., and . CCCG, page 163-168. University of Waterloo, (1993)Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain., , and . CCCG, page 217-222. Carleton University Press, (1996)A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane, , and . FOCS, page 573-582. IEEE Computer Society, (1993)A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane., , and . Discret. Comput. Geom., 15 (1): 73-105 (1996)Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract)., and . WADS, volume 382 of Lecture Notes in Computer Science, page 325-334. Springer, (1989)Bounded-Velocity Approximation of Mobile Euclidean 2-Centres., and . Int. J. Comput. Geom. Appl., 18 (3): 161-183 (2008)The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location., and . Int. J. Comput. Geom. Appl., 16 (4): 345-372 (2006)On k-Guarding Polygons., , and . CCCG, Carleton University, Ottawa, Canada, (2013)Output-size sensitive algorithms for finding maximal vectors., and . SCG, page 89-96. ACM, (1985)Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons., and . SCG, page 179-188. ACM, (2002)