Browse "School of Computing(전산학부)" by Subject LINEAR-TIME
Showing results 1 to 4 of 4
| AN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY KIM, SH; PARK, JH; CHOI, SH; Shin, Sung-Yong; Chwa, Kyung Yong, INFORMATION PROCESSING LETTERS, v.53, no.6, pp.359 - 365, 1995-03 |
| Point location in zones of k-flats in arrangements deBerg, M; vanKreveld, M; Cheong, Otfried; Snoeyink, J, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.3, pp.131 - 143, 1996-06 |
| 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 |
| The "Art of Trellis Decoding" Is Fixed-Parameter Tractable Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,767 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989