Author of the publication

An efficient algorithm for identifying objects using robot probes.

, and . The Visual Computer, 10 (8): 452-458 (1994)

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.

Univ. -Prof. Dr. David Remy University of Stuttgart

Periodic Trajectories of Passive One-Legged Hopper, and . Dataset, (2024)Related to: M. Raff, N. Rosa and C. D. Remy, "Connecting Gaits in Energetically Conservative Legged Systems," in IEEE Robotics and Automation Letters, vol. 7, no. 3, pp. 8407-8414, July 2022,. doi: 10.1109/LRA.2022.3186500.
 

Other publications of authors with the same name

Computing the Similarity of two Melodies., , , , , , , and . CCCG, page 81-84. (2003)Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences., , and . Graphs and Combinatorics, 31 (5): 1637-1648 (2015)Establishing strong connectivity using optimal radius half-disk antennas., , , , , , and . Comput. Geom., 46 (3): 328-339 (2013)The Aquarium Keeper's Problem., , , , , , , and . SODA, page 459-464. ACM/SIAM, (1991)Small weak epsilon-nets., , , , , , and . Comput. Geom., 42 (5): 455-462 (2009)Properties of the voronoi diagram cluster buster., , and . CASCON, page 1148-1163. IBM, (1993)Tight Bounds for Visibility Matching of f-Equal Width Objects.. JCDCG, volume 2866 of Lecture Notes in Computer Science, page 246-250. Springer, (2002)An Optimal Algorithm to Compute the Inverse Beacon Attraction Region., , , and . Symposium on Computational Geometry, volume 99 of LIPIcs, page 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)State Complexity of Neighbourhoods and Approximate Pattern Matching., , and . DLT, volume 9168 of Lecture Notes in Computer Science, page 389-400. Springer, (2015)Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 363-374. Springer, (2009)