Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarOtfried Cheong
Otfried Schwarzkopf
Person information
- affiliation: KAIST, Daejeon, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j72]Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin:
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77: 40-50 (2019)- 2018
- [j71]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. JoCG 9(1): 312-327 (2018) - [c65]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. Symposium on Computational Geometry 2018: 6:1-6:13 - [i27]Siu-Wing Cheng, Otfried Cheong, Taegyoung Lee:
Fitting a Graph to One-Dimensional Data. CoRR abs/1809.02948 (2018) - 2017
- [j70]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. Discrete & Computational Geometry 57(1): 104-124 (2017) - [j69]Juyoung Yon, Siu-Wing Cheng, Otfried Cheong, Antoine Vigneron:
Finding Largest Common Point Sets. Int. J. Comput. Geometry Appl. 27(3): 177-186 (2017) - [c64]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - [c63]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. ISAAC 2017: 9:1-9:13 - [i26]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - [i25]Otfried Cheong, Anne Driemel, Jeff Erickson:
Computational Geometry (Dagstuhl Seminar 17171). Dagstuhl Reports 7(4): 107-127 (2017) - 2016
- [j68]Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf:
Finding largest rectangles in convex polygons. Comput. Geom. 51: 67-74 (2016) - [j67]Jae-Soon Ha, Otfried Cheong, Xavier Goaoc, Jungwoo Yang:
Geometric permutations of non-overlapping unit balls revisited. Comput. Geom. 53: 36-50 (2016) - [c62]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. Symposium on Computational Geometry 2016: 10:1-10:16 - [c61]Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson:
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. Symposium on Computational Geometry 2016: 63:1-63:15 - [i24]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - [i23]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. CoRR abs/1612.02412 (2016) - [i22]Siu-Wing Cheng, Yoshio Okamoto, Otfried Cheong:
Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j66]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. Algorithmica 73(4): 673-695 (2015) - [i21]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. CoRR abs/1502.01779 (2015) - [i20]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - [i19]Otfried Cheong, Jeff Erickson, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 15111). Dagstuhl Reports 5(3): 41-62 (2015) - 2014
- [j65]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j64]Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson:
A fast algorithm for data collection along a fixed track. Theor. Comput. Sci. 554: 254-262 (2014) - [c60]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG 2014 - [c59]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. Symposium on Computational Geometry 2014: 436 - [i18]Sergio Cabello, Otfried Cheong, Lena Schlipf:
Finding Largest Rectangles in Convex Polygons. CoRR abs/1405.1223 (2014) - 2013
- [j63]
- [j62]Otfried Cheong, Xavier Goaoc, Cyril Nicaud:
Set systems and families of permutations with small traces. Eur. J. Comb. 34(2): 229-239 (2013) - [j61]Otfried Cheong, Changryeol Lee:
Single-Source Dilation-Bounded Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 23(3): 159-170 (2013) - [c58]Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson:
A Fast Algorithm for Data Collection along a Fixed Track. COCOON 2013: 77-88 - [c57]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. ISAAC 2013: 163-173 - [i17]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. CoRR abs/1311.1976 (2013) - [i16]Otfried Cheong, Kurt Mehlhorn, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 13101). Dagstuhl Reports 3(3): 1-23 (2013) - 2012
- [j60]Hee-Kap Ahn, Otfried Cheong:
Aligning Two Convex Figures to Minimize Area or Perimeter. Algorithmica 62(1-2): 464-479 (2012) - [j59]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45(1-2): 21-32 (2012) - [j58]Otfried Cheong, Yoshio Okamoto:
Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 22(1): 1-2 (2012) - [c56]
- [c55]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - [i15]Otfried Cheong, Changryeol Lee:
Single-Source Dilation-Bounded Minimum Spanning Trees. CoRR abs/1206.6943 (2012) - [i14]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012) - 2011
- [j57]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
A note on the perimeter of fat objects. Comput. Geom. 44(1): 1-8 (2011) - [j56]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) - [j55]Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote:
Lines Pinning Lines. Discrete & Computational Geometry 45(2): 230-260 (2011) - [j54]Otfried Cheong, Antoine Vigneron, Juyoung Yon:
Reverse Nearest Neighbor Queries in Fixed Dimension. Int. J. Comput. Geometry Appl. 21(2): 179-188 (2011) - [i13]
- 2010
- [j53]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010) - [c54]
- [c53]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - [e4]Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park:
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6506, Springer 2010, ISBN 978-3-642-17516-9 [contents] - [e3]Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park:
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6507, Springer 2010, ISBN 978-3-642-17513-8 [contents] - [i12]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) - [i11]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by Paths of Bounded Curvature in a Convex Polygon. CoRR abs/1008.4244 (2010)
2000 – 2009
- 2009
- [j52]Nina Amenta, Otfried Cheong:
Guest Editors' Foreword. Discrete & Computational Geometry 41(3): 363-364 (2009) - [j51]Otfried Cheong, Xavier Goaoc, Andreas Holmsen:
Lower Bounds for Pinning Lines by Balls (Extended Abstract). Electronic Notes in Discrete Mathematics 34: 567-571 (2009) - [j50]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) - [c52]
- [c51]Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn:
Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112 - [i10]Otfried Cheong, Antoine Vigneron, Juyoung Yon:
Reverse nearest neighbor queries in fixed dimension. CoRR abs/0905.4441 (2009) - [i9]Otfried Cheong, Xavier Goaoc, Andreas Holmsen:
Lower Bounds for Pinning Lines by Balls. CoRR abs/0906.2924 (2009) - [i8]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - [i7]Otfried Cheong, Xavier Goaoc, Cyril Nicaud:
Set Systems and Families of Permutations with Small Traces. CoRR abs/0912.2979 (2009) - 2008
- [b2]Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars:
Computational geometry: algorithms and applications, 3rd Edition. Springer 2008, ISBN 9783540779735, pp. I-XII, 1-386 - [j49]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j48]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008) - [j47]Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean:
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. Discrete & Computational Geometry 39(1-3): 194-212 (2008) - [j46]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discrete & Computational Geometry 40(3): 414-429 (2008) - [j45]Nina Amenta, Otfried Cheong:
Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 18(6): 507-508 (2008) - 2007
- [j44]Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37(1): 3-15 (2007) - [j43]Otfried Cheong, Mira Lee:
The Hadwiger Number of Jordan Regions Is Unbounded. Discrete & Computational Geometry 37(4): 497-501 (2007) - [j42]Otfried Cheong, Alon Efrat, Sariel Har-Peled:
Finding a Guard that Sees Most and a Shop that Sells Most. Discrete & Computational Geometry 37(4): 545-563 (2007) - [j41]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geometry Appl. 17(4): 349-360 (2007) - [c50]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 - [c49]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24 - [c48]
- [c47]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-angle and Hausdorff-approximation of convex figures. Symposium on Computational Geometry 2007: 37-45 - [c46]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 - [c45]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250 - [i6]Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean:
Hadwiger and Helly-type theorems for disjoint unit spheres. CoRR abs/cs/0702039 (2007) - [i5]Otfried Cheong, Mira Lee:
The Hadwiger Number of Jordan Regions is Unbounded. CoRR abs/cs/0702079 (2007) - [i4]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - [i3]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. CoRR abs/cs/0702090 (2007) - [i2]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007) - [i1]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) - 2006
- [j40]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with Skewed Ejection Direction. Algorithmica 44(4): 325-342 (2006) - [j39]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) - [j38]Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) - [c44]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 - [e2]Nina Amenta, Otfried Cheong:
Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006. ACM 2006, ISBN 1-59593-340-9 [contents] - 2005
- [j37]Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff:
Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) - [j36]Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na:
Geometric permutations of disjoint unit spheres. Comput. Geom. 30(3): 253-270 (2005) - [j35]Helmut Alt, Otfried Cheong, Antoine Vigneron:
The Voronoi Diagram of Curved Objects. Discrete & Computational Geometry 34(3): 439-453 (2005) - [c43]Otfried Cheong, Xavier Goaoc, Andreas Holmsen:
Hadwiger and Helly-type theorems for disjoint unit spheres in R3. Symposium on Computational Geometry 2005: 10-15 - [c42]Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions. Symposium on Computational Geometry 2005: 356-363 - [c41]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - [c40]
- 2004
- [j34]Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin:
On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004) - [j33]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The One-Round Voronoi Game. Discrete & Computational Geometry 31(1): 125-138 (2004) - [j32]Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum:
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discrete & Computational Geometry 32(3): 401-415 (2004) - [j31]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. Int. J. Comput. Geometry Appl. 14(6): 453-474 (2004) - [j30]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3): 457-467 (2004) - [c39]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 - [c38]Otfried Cheong, Alon Efrat, Sariel Har-Peled:
On finding a guard that sees most and a shop that sells most. SODA 2004: 1098-1107 - [r1]Otfried Cheong, Ketan Mulmuley, Edgar Ramos:
Randomization and derandomization. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 895-926 - 2003
- [j29]Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin:
Building bridges between convex region. Comput. Geom. 25(1-2): 161-170 (2003) - [j28]Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
Casting a polyhedron with directional uncertainty. Comput. Geom. 26(2): 129-141 (2003) - [j27]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (2003) - [j26]Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing farthest neighbors on a convex polytope. Theor. Comput. Sci. 296(1): 47-58 (2003) - [c37]Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na:
Disjoint Unit Spheres admit at Most Two Line Transversals. ESA 2003: 127-135 - 2002
- [j25]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Computer-Aided Design 34(8): 547-559 (2002) - [j24]Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong:
Voronoi diagrams on the spher. Comput. Geom. 23(2): 183-194 (2002) - [c36]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The one-round Voronoi game. Symposium on Computational Geometry 2002: 97-101 - [c35]Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
Casting a Polyhedron with Directional Uncertainty. ISAAC 2002: 274-285 - 2001
- [j23]Otfried Cheong, René van Oostrum:
Reaching a Polygon with Directional Uncertainty. Int. J. Comput. Geometry Appl. 11(2): 197-214 (2001) - [c34]
- [c33]Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope. COCOON 2001: 159-169 - [c32]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive Facility Location along a Highway. COCOON 2001: 237-246 - 2000
- [c31]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons. Symposium on Computational Geometry 2000: 251-259 - [c30]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. ESA 2000: 314-325 - [e1]Siu-Wing Cheng, Otfried Cheong, Pankaj K. Agarwal, Steven Fortune:
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000. ACM 2000, ISBN 1-58113-224-7 [contents]
1990 – 1999
- 1999
- [c29]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with skewed ejection direction revisited. CCCG 1999 - [c28]
- [c27]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48 - [c26]Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum:
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. Symposium on Computational Geometry 1999: 227-236 - 1998
- [j22]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2): 77-87 (1998) - [j21]Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. 31(5): 613-628 (1998) - [j20]Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. 27(2): 491-505 (1998) - [j19]