The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hee-Kap Ahn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
    Flipping your Lid. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  2. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
    Casting with skewed ejection direction revisited. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
    The reflex-free hull. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:9-12 [Conf]
  4. 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]
  5. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
    Competitive Facility Location along a Highway. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:237-246 [Conf]
  6. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  7. Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
    Reachability by paths of bounded curvature in convex polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:251-259 [Conf]
  8. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
    Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:356-363 [Conf]
  9. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
    Aperture-angle and Hausdorff-approximation of convex figures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:37-45 [Conf]
  10. Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
    Casting an Object with a Core. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:40-49 [Conf]
  11. Hee-Kap Ahn, Otfried Cheong
    Stacking and Bundling Two Convex Polygons. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:882-891 [Conf]
  12. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
    Casting with Skewed Ejection Direction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:139-148 [Conf]
  13. Hee-Kap Ahn, Otfried Cheong, René van Oostrum
    Casting a Polyhedron with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:274-285 [Conf]
  14. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
    Casting with Skewed Ejection Direction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:325-342 [Journal]
  15. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  16. 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]
  17. Hee-Kap Ahn, Otfried Cheong, René van Oostrum
    Casting a polyhedron with directional uncertainty. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:129-141 [Journal]
  18. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin
    Building bridges between convex region. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:161-170 [Journal]
  19. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
    The reflex-free hull. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:6, pp:453-474 [Journal]
  20. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
    Competitive facility location: the Voronoi game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:457-467 [Journal]
  21. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
    Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:3-15 [Journal]
  22. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
    Aperture-Angle and Hausdorff-Approximation of Convex Figures [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  23. 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]

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


  25. Optimal Empty Pseudo-Triangles in a Point Set. [Citation Graph (, )][DBLP]


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


  27. Dilation-Optimal Edge Deletion in Polygonal Cycles. [Citation Graph (, )][DBLP]


  28. Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. [Citation Graph (, )][DBLP]


  29. Covering a Point Set by Two Disjoint Rectangles. [Citation Graph (, )][DBLP]


  30. Spatial Skyline Queries: An Efficient Geometric Algorithm. [Citation Graph (, )][DBLP]


  31. Square and Rectangle Covering with Outliers. [Citation Graph (, )][DBLP]


  32. Adaptive Algorithms for Planar Convex Hull Problems. [Citation Graph (, )][DBLP]


  33. Casting an Object with a Core. [Citation Graph (, )][DBLP]


  34. Maximum overlap and minimum convex hull of two convex polyhedra under translations. [Citation Graph (, )][DBLP]


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


  36. Computing minimum-area rectilinear convex hull and L-shape. [Citation Graph (, )][DBLP]


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


  38. Spatial Skyline Queries: An Efficient Geometric Algorithm [Citation Graph (, )][DBLP]


  39. Covering Points by Disjoint Boxes with Outliers [Citation Graph (, )][DBLP]


  40. Reachability by Paths of Bounded Curvature in a Convex Polygon [Citation Graph (, )][DBLP]


  41. Aperture-Angle and Hausdorff-Approximation of Convex Figures. [Citation Graph (, )][DBLP]


Search in 0.061secs, Finished in 0.064secs
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