Browse "School of Computing(전산학부)" by Author Matousek, Jiri
Showing results 5 to 8 of 8
| Piecewise Linear Paths Among Convex Obstacles Berg, Mark de; Matousek, Jiri; Cheong, Otfried, 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp.505 - 514, 1993-05-16 |
| Reachability by paths of bounded curvature in a convex polygon Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32, 2012-01 |
| Reachability by paths of bounded curvature in convex polygons Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, ACM Symposium on Computational Geometry (SoCG) 2000, pp.251 - 259, 2000-06-14 |
| Separating an Object from its Cast Ahn, Hee-Kap; Berg, Mark de; Bose, Prosenjit; Cheng, Siu-Wing; Halperin, Dan; Matousek, Jiri; Cheong, Otfried, 13th Annu. ACM Symposium on Computational Geometry (SoCG 1997), pp.221 - 230, 1997-06-04 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,769 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989