The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Otfried Cheong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott
    Throwing Stones Inside Simple Polygons . [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:185-193 [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. Otfried Cheong, René van Oostrum
    The visibility region of points in a simple polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  5. 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]
  6. 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]
  7. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
    Computing Farthest Neighbors on a Convex Polytope. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:159-169 [Conf]
  8. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:41-48 [Conf]
  9. 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]
  10. 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]
  11. Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum
    Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:227-236 [Conf]
  12. Otfried Cheong, Xavier Goaoc, Andreas Holmsen
    Hadwiger and Helly-type theorems for disjoint unit spheres in R3. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:10-15 [Conf]
  13. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The one-round Voronoi game. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:97-101 [Conf]
  14. 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]
  15. 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]
  16. Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa
    Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:314-325 [Conf]
  17. Hee-Kap Ahn, Otfried Cheong
    Stacking and Bundling Two Convex Polygons. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:882-891 [Conf]
  18. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
    Casting with Skewed Ejection Direction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:139-148 [Conf]
  19. 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]
  20. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
    Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:50-59 [Conf]
  21. Otfried Cheong, Alon Efrat, Sariel Har-Peled
    On finding a guard that sees most and a shop that sells most. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1098-1107 [Conf]
  22. 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]
  23. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
    On simplifying dot maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:43-62 [Journal]
  24. 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]
  25. 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]
  26. 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]
  27. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  28. 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]
  29. 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]
  30. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:4, pp:591-606 [Journal]
  31. Helmut Alt, Otfried Cheong, Antoine Vigneron
    The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:439-453 [Journal]
  32. Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum
    Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:3, pp:401-415 [Journal]
  33. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The One-Round Voronoi Game. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:125-138 [Journal]
  34. 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]
  35. Otfried Cheong, René van Oostrum
    Reaching a Polygon with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:197-214 [Journal]
  36. Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
  37. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons under Translations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:613-628 [Journal]
  38. 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]
  39. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
    Computing farthest neighbors on a convex polytope. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:47-58 [Journal]
  40. Otfried Cheong
    The Harmony of Spheres. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:7- [Conf]
  41. 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]
  42. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
    I/O-Efficient Flow Modeling on Fat Terrains. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:239-250 [Conf]
  43. 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]
  44. Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean
    Hadwiger and Helly-type theorems for disjoint unit spheres [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  45. Otfried Cheong, Mira Lee
    The Hadwiger Number of Jordan Regions is Unbounded [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  46. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  47. 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]
  48. Otfried Cheong, Herman J. Haverkort, Mira Lee
    Computing a Minimum-Dilation Spanning Tree is NP-hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  49. 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]
  50. Otfried Cheong, Alon Efrat, Sariel Har-Peled
    Finding a Guard that Sees Most and a Shop that Sells Most. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:545-563 [Journal]
  51. Otfried Cheong, Mira Lee
    The Hadwiger Number of Jordan Regions Is Unbounded. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:497-501 [Journal]

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


  53. Computing a Minimum-Dilation Spanning Tree is NP-hard. [Citation Graph (, )][DBLP]


  54. On the perimeter of fat objects. [Citation Graph (, )][DBLP]


  55. Measuring the Similarity of Geometric Graphs. [Citation Graph (, )][DBLP]


  56. Line Transversals and Pinning Numbers. [Citation Graph (, )][DBLP]


  57. Computation of Non-dominated Points Using Compact Voronoi Diagrams. [Citation Graph (, )][DBLP]


  58. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  59. Computing a minimum-dilation spanning tree is NP-hard. [Citation Graph (, )][DBLP]


  60. The complexity of flow on fat terrains and its i/o-efficient computation. [Citation Graph (, )][DBLP]


  61. A note on the perimeter of fat objects. [Citation Graph (, )][DBLP]


  62. Reverse nearest neighbor queries in fixed dimension [Citation Graph (, )][DBLP]


  63. Lower Bounds for Pinning Lines by Balls [Citation Graph (, )][DBLP]


  64. On Finding Non-dominated Points using Compact Voronoi Diagrams [Citation Graph (, )][DBLP]


  65. Set Systems and Families of Permutations with Small Traces [Citation Graph (, )][DBLP]


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


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


  68. Guest Editors' Foreword. [Citation Graph (, )][DBLP]


  69. Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. [Citation Graph (, )][DBLP]


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


Search in 0.004secs, Finished in 0.006secs
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