Hyeon-Suk Na

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011)

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: The Aligned k-Center Problem. Int. J. Comput. Geometry Appl. 21(2): 157-178 (2011)

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin: Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010)

Peter Brass, Hyeon-Suk Na, Chan-Su Shin: Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geometry Appl. 20(3): 327-339 (2010)

Peter Brass, Hyeon-Suk Na: Finding the maximum bounded intersection of k out of n halfplanes. Inf. Process. Lett. 110(3): 113-115 (2010)

Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang: Querying Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 39(5): 1888-1918 (2010)

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010)

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009)

Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin: On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. 42(3): 207-213 (2009)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009)

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Computing k-Centers On a Line. CoRR abs/0902.3282 (2009)

Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang: Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput. 38(3): 802-824 (2008)

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin: Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CATS 2007: 7-14

Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang: Querying approximate shortest paths in anisotropic regions. Symposium on Computational Geometry 2007: 84-91

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74

Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang: Approximate shortest paths in anisotropic regions. SODA 2007: 766-774

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CoRR abs/cs/0703037 (2007)

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006)

Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na: A note on maximally repeated sub-patterns of a point set. Discrete Mathematics 306(16): 1965-1968 (2006)

Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na: Geometric permutations of disjoint unit spheres. Comput. Geom. 30(3): 253-270 (2005)

Mordecai J. Golin, Hyeon-Suk Na: Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: The number of lines tangent to arbitrary convex polyhedra in 3D. Symposium on Computational Geometry 2004: 46-55

Mordecai J. Golin, Hyeon-Suk Na: On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Comput. Geom. 25(3): 197-231 (2003)

Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean: The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003)

Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na: Disjoint Unit Spheres admit at Most Two Line Transversals. ESA 2003: 127-135

Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong: Voronoi diagrams on the spher. Comput. Geom. 23(2): 183-194 (2002)

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117

Mordecai J. Golin, Hyeon-Suk Na: The probabilistic complexity of the Voronoi diagram of points on a polyhedron. Symposium on Computational Geometry 2002: 209-216

Mordecai J. Golin, Hyeon-Suk Na: Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference 2001: 143-152

Mordecai J. Golin, Hyeon-Suk Na: On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG 2000