default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOtfried 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
2020 – today
- 2024
[j81]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen
:
Some New Results on Geometric Transversals. Discret. Comput. Geom. 72(2): 674-703 (2024)- [c72]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Matching and Bottleneck Problems. SoCG 2024: 31:1-31:15 - [c71]Otfried Cheong:
How Can Biclique Covers Help in Matching Problems (Invited Talk). GD 2024: 1:1-1:1 - [c70]Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon:
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) 2024: 303-317 - 2023
- [j80]Otfried Cheong, Olivier Devillers, Marc Glisse, Ji-won Park:
Covering families of triangles. Period. Math. Hung. 87(1): 86-109 (2023) - [c69]Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. GD (1) 2023: 53-68 - [i31]Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. CoRR abs/2308.08966 (2023) - [i30]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Assignment and Geometric Bottleneck. CoRR abs/2310.02637 (2023) - 2022
- [j79]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022) - [j78]Sergio Cabello, Otfried Cheong, Michael Gene Dobbins:
The inverse Kakeya problem. Period. Math. Hung. 84(1): 70-75 (2022) - [c68]Otfried Cheong, Maximilian Pfister, Lena Schlipf:
The Thickness of Fan-Planar Graphs is At Most Three. GD 2022: 247-260 - [i29]Otfried Cheong, Maximilian Pfister, Lena Schlipf:
The thickness of fan-planar graphs is at most three. CoRR abs/2208.12324 (2022) - 2021
- [j77]Ji-won Park, Otfried Cheong:
Smallest universal covers for families of triangles. Comput. Geom. 92: 101686 (2021) - [j76]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021) - [j75]Siu-Wing Cheng, Otfried Cheong, Taegyoung Lee, Zhengtong Ren:
Fitting a graph to one-dimensional data. Theor. Comput. Sci. 867: 40-49 (2021) - [i28]Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Seiferth:
Packing 2D disks into a 3D container. CoRR abs/2110.12711 (2021) - 2020
- [c67]Siu-Wing Cheng, Otfried Cheong, Taegyoung Lee:
Fitting a Graph to One-Dimensional Data. CCCG 2020: 134-140
2010 – 2019
- 2019
- [j74]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) - [j73]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the circle. Comput. Geom. 79: 37-54 (2019) - [j72]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [c66]Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf:
Packing 2D Disks into a 3D Container. WALCOM 2019: 369-380 - 2018
- [j71]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - [c65]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. SoCG 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. Discret. Comput. Geom. 57(1): 104-124 (2017) - [j69]Juyoung Yon, Siu-Wing Cheng, Otfried Cheong, Antoine Vigneron:
Finding Largest Common Point Sets. Int. J. Comput. Geom. 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. SoCG 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. SoCG 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. SoCG 2014: 436 - [i18]Sergio Cabello, Otfried Cheong, Lena Schlipf:
Finding Largest Rectangles in Convex Polygons. CoRR abs/1405.1223 (2014) - 2013
- [j63]Hyo-Sil Kim, Otfried Cheong:
The cost of bounded curvature. Comput. Geom. 46(6): 648-672 (2013) - [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. Geom. 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. Geom. Appl. 22(1): 1-2 (2012) - [c56]Hyo-Sil Kim, Otfried Cheong:
The Cost of Bounded Curvature. COCOON 2012: 252-263 - [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. Discret. Comput. Geom. 45(2): 230-260 (2011) - [j54]Otfried Cheong, Antoine Vigneron, Juyoung Yon:
Reverse Nearest Neighbor Queries in Fixed Dimension. Int. J. Comput. Geom. Appl. 21(2): 179-188 (2011) - [i13]Hyo-Sil Kim, Otfried Cheong:
The Cost of Bounded Curvature. CoRR abs/1106.6214 (2011) - 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]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
On the perimeter of fat objects. CCCG 2010: 163-166 - [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. Discret. Comput. Geom. 41(3): 363-364 (2009) - [j51]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Lower Bounds for Pinning Lines by Balls (Extended Abstract). Electron. Notes Discret. Math. 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]Otfried Cheong:
Line Transversals and Pinning Numbers. WALCOM 2009: 44-46 - [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 F. 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 F. Holmsen, Sylvain Petitjean:
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. Discret. Comput. Geom. 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. Discret. Comput. Geom. 40(3): 414-429 (2008) - [j45]Nina Amenta, Otfried Cheong:
Guest Editors' Foreword. Int. J. Comput. Geom. 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. Discret. Comput. Geom. 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. Discret. Comput. Geom. 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. Geom. 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]Otfried Cheong:
The Harmony of Spheres. CCCG 2007: 7 - [c47]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-angle and Hausdorff-approximation of convex figures. SCG 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 F. 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. Discret. Comput. Geom. 34(3): 439-453 (2005) - [c43]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Hadwiger and Helly-type theorems for disjoint unit spheres in R3. SCG 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. SCG 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]Hee-Kap Ahn, Otfried Cheong:
Stacking and Bundling Two Convex Polygons. ISAAC 2005: 882-891 - 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. Discret. Comput. Geom. 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. Discret. Comput. Geom. 32(3): 401-415 (2004) - [j31]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. Int. J. Comput. Geom. 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. Discret. Comput. Geom. 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. Comput. Aided Des. 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. SCG 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. Geom. Appl. 11(2): 197-214 (2001) - [c34]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. CCCG 2001: 9-12 - [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. SCG 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]Otfried Cheong, René van Oostrum:
The visibility region of points in a simple polygon. CCCG 1999 - [c27]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. SCG 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. SCG 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]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. 27(3): 654-667 (1998) - [c25]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with Skewed Ejection Direction. ISAAC 1998: 139-148 - 1997
- [j18]Otfried Schwarzkopf, Micha Sharir:
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. Discret. Comput. Geom. 18(3): 269-288 (1997) - [j17]Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf:
Computing a Single Cell in the Overlay of Two Simple Polygons. Inf. Process. Lett. 63(4): 215-219 (1997) - [j16]Alon Efrat, Otfried Schwarzkopf:
Separating and Shattering Long Line Segments. Inf. Process. Lett. 64(6): 309-314 (1997) - [c24]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230 - 1996
- [j15]Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink:
Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996) - [j14]Jirí Matousek, Otfried Schwarzkopf:
A Deterministic Algorithm for the Three-dimensional Diameter Problem. Comput. Geom. 6: 253-262 (1996) - [j13]Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir:
The Overlay of Lower Envelopes and Its Applications. Discret. Comput. Geom. 15(1): 1-13 (1996) - [j12]Otfried Schwarzkopf, Jules Vleugels:
Range Searching in Low-Density Environments. Inf. Process. Lett. 60(3): 121-127 (1996) - [c23]Otfried Schwarzkopf, Micha Sharir:
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. SCG 1996: 20-29 - [c22]Alon Efrat, Otfried Schwarzkopf:
Separating and Shattering Long Line Segments. ISAAC 1996: 36-44 - [c21]Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135 - 1995
- [j11]Martin Aigner, Otfried Schwarzkopf:
Bounds on the Size of Merging Networks. Discret. Appl. Math. 61(3): 187-194 (1995) - [j10]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. 14(1): 9-29 (1995) - [j9]Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On Lazy Randomized Incremental Construction. Discret. Comput. Geom. 14(3): 261-286 (1995) - [j8]Mark de Berg, Otfried Schwarzkopf:
Cuttings and applications. Int. J. Comput. Geom. Appl. 5(4): 343-355 (1995) - [j7]Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud:
Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995) - [c20]Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink:
Immobilizing Polygons against a Wall. SCG 1995: 29-38 - [c19]Helmut Alt, Otfried Schwarzkopf:
The Voronoi Diagram of Curved Objects. SCG 1995: 89-97 - [c18]Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir:
The Overlay of Lower Envelopes in Three Dimensions and Its Applications. SCG 1995: 182-189 - [c17]Otfried Schwarzkopf:
The Extensible Drawing Editor Ipe. SCG 1995: C10-C11 - 1994
- [j6]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994) - [c16]Chantal Wentink, Otfried Schwarzkopf:
Motion Planning for Vacuum Cleaner Robots. CCCG 1994: 51-56 - [c15]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SCG 1994: 67-75 - [c14]Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments. SCG 1994: 76-84 - [c13]Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On lazy randomized incremental construction. STOC 1994: 105-114 - 1993
- [j5]Jirí Matousek, Otfried Schwarzkopf:
On Ray Shooting in Convex Polytopes. Discret. Comput. Geom. 10: 215-232 (1993) - [c12]Otfried Schwarzkopf:
Computing Convolutions on Mesh-Like Structures. IPPS 1993: 695-699 - [c11]Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir:
Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10 - [c10]Jirí Matousek, Otfried Schwarzkopf:
A deterministic algorithm for the three-dimensional diameter problem. STOC 1993: 478-484 - [c9]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise linear paths among convex obstacles. STOC 1993: 505-514 - 1992
- [b1]Otfried Schwarzkopf:
Dynamic maintenance of convex polytopes and related structures. Free University of Berlin, Dahlem, Germany, 1992, pp. 1-84 - [j4]Otfried Schwarzkopf:
Parallel Computation of Distance Transforms - Erratum. Algorithmica 7(2&3): 337 (1992) - [j3]Franz Aurenhammer, Otfried Schwarzkopf:
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Int. J. Comput. Geom. Appl. 2(4): 363-381 (1992) - [c8]Jirí Matousek, Otfried Schwarzkopf:
Linear Optimization Queries. SCG 1992: 16-25 - [c7]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SCG 1992: 138-145 - [c6]Otfried Schwarzkopf:
Ray Shooting in Convex Polytopes. SCG 1992: 286-295 - 1991
- [j2]Otfried Schwarzkopf:
Parallel Computation of Disease Transforms. Algorithmica 6(5): 685-697 (1991) - [j1]Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discret. Comput. Geom. 6: 407-422 (1991) - [c5]Franz Aurenhammer, Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. SCG 1991: 142-151 - [c4]Otfried Schwarzkopf:
Dynamic Maintenance of Geometric Structures Made Easy. FOCS 1991: 197-206 - 1990
- [c3]Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. SCG 1990: 203-210 - [c2]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of Convex Figures by Pairs of Rectangles. STACS 1990: 240-249
1980 – 1989
- 1989
- [c1]Otfried Schwarzkopf:
Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract). STACS 1989: 193-204
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
