The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hyeon-Suk Na: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  2. Mordecai J. Golin, Hyeon-Suk Na
    On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:259-267 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  5. Mordecai J. Golin, Hyeon-Suk Na
    The probabilistic complexity of the Voronoi diagram of points on a polyhedron. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:209-216 [Conf]
  6. Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
    Querying approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:84-91 [Conf]
  7. Mordecai J. Golin, Hyeon-Suk Na
    Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:143-152 [Conf]
  8. Mordecai J. Golin, Hyeon-Suk Na
    Generalizing the Kraft-McMillan Inequality to Restricted Languages. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:163-172 [Conf]
  9. Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
    Disjoint Unit Spheres admit at Most Two Line Transversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:127-135 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:152-164 [Journal]
  11. Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
    Geometric permutations of disjoint unit spheres. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:253-270 [Journal]
  12. Mordecai J. Golin, Hyeon-Suk Na
    On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:3, pp:197-231 [Journal]
  13. Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong
    Voronoi diagrams on the spher. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:183-194 [Journal]
  14. Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na
    A note on maximally repeated sub-patterns of a point set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1965-1968 [Journal]
  15. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
    The Expected Number of 3D Visibility Events Is Linear. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1586-1620 [Journal]
  16. Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
    Farthest-Polygon Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:407-418 [Conf]
  17. Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
    Approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:766-774 [Conf]
  18. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  20. Constructing Optimal Highways. [Citation Graph (, )][DBLP]


  21. Covering a Simple Polygon by Monotone Directions. [Citation Graph (, )][DBLP]


  22. Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. [Citation Graph (, )][DBLP]


  23. Escaping offline searchers and isoperimetric theorems. [Citation Graph (, )][DBLP]


  24. On the minimum total length of interval systems expressing all intervals, and range-restricted queries. [Citation Graph (, )][DBLP]


  25. Covering a simple polygon by monotone directions. [Citation Graph (, )][DBLP]


  26. Computing k-Centers On a Line [Citation Graph (, )][DBLP]


  27. Farthest-Polygon Voronoi Diagrams [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002