| 2010 |
|---|
| 47 | The complexity of flow on fat terrains and its i/o-efficient computation. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. Comput. Geom. (43): 331-356 (2010). Web SearchBibTeXDownload |
| 46 | Computation of Non-dominated Points Using Compact Voronoi Diagrams. Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink. WALCOM 2010, 82-93. Web SearchBibTeXDownload |
| 2009 |
|---|
| 45 | On Finding Non-dominated Points using Compact Voronoi Diagrams. Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink. CoRR (abs/0909.0814) (2009). Web SearchBibTeXDownload |
| 44 | Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Discrete & Computational Geometry (41): 363-364 (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 43 | Computing a minimum-dilation spanning tree is NP-hard. Otfried Cheong, Herman J. Haverkort, Mira Lee. Comput. Geom. (41): 188-205 (2008). Web SearchBibTeXDownload |
| 42 | Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. Comput. Geom. (40): 207-219 (2008). Web SearchBibTeXDownload |
| 41 | Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Int. J. Comput. Geometry Appl. (18): 273-274 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 40 | Computing a Minimum-Dilation Spanning Tree is NP-hard. Otfried Cheong, Herman J. Haverkort, Mira Lee. CATS 2007, 15-24. Web SearchBibTeXDownload |
| 39 | Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. CoRR (abs/cs/0702080) (2007). Web SearchBibTeXDownload |
| 38 | I/O-Efficient Flow Modeling on Fat Terrains. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. WADS 2007, 239-250. Web SearchBibTeXDownload |
| 2006 |
|---|
| 37 | Casting with Skewed Ejection Direction. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong. Algorithmica (44): 325-342 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 36 | Optimal spanners for axis-aligned rectangles. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff. Comput. Geom. (30): 59-77 (2005). Web SearchBibTeXDownload |
| 35 | Sparse Geometric Graphs with Small Dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron. ISAAC 2005, 50-59. Web SearchBibTeXDownload |
| 2004 |
|---|
| 34 | On simplifying dot maps. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin. Comput. Geom. (27): 43-62 (2004). Web SearchBibTeXDownload |
| 33 | Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum. Discrete & Computational Geometry (32): 401-415 (2004). Web SearchBibTeXDownload |
| 32 | The reflex-free hull. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink. Int. J. Comput. Geometry Appl. (14): 453-474 (2004). Web SearchBibTeXDownload |
| 31 | Competitive facility location: the Voronoi game. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum. Theor. Comput. Sci. (310): 457-467 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 30 | Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Discrete & Computational Geometry (30): 591-606 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 29 | Separating an object from its cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Computer-Aided Design (34): 547-559 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 28 | The reflex-free hull. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink. CCCG 2001, 9-12. Web SearchBibTeXDownload |
| 27 | Competitive Facility Location along a Highway. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum. COCOON 2001, 237-246. Web SearchBibTeXDownload |
| 1999 |
|---|
| 26 | Casting with skewed ejection direction revisited. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong. CCCG 1999. Web SearchBibTeXDownload |
| 25 | Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Symposium on Computational Geometry 1999, 41-48. Web SearchBibTeXDownload |
| 24 | Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum. Symposium on Computational Geometry 1999, 227-236. Web SearchBibTeXDownload |
| 1998 |
|---|
| 23 | Casting with Skewed Ejection Direction. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong. ISAAC 1998, 139-148. Web SearchBibTeXDownload |
| 22 | Computing Many Faces in Arrangements of Lines and Segments. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf. SIAM J. Comput. (27): 491-505 (1998). Web SearchBibTeXDownload |
| 21 | Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. SIAM J. Comput. (27): 654-667 (1998). Web SearchBibTeXDownload |
| 20 | Computing the Maximum Overlap of Two Convex Polygons under Translations. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud. Theory Comput. Syst. (31): 613-628 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 19 | Computing a Single Cell in the Overlay of Two Simple Polygons. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf. Inf. Process. Lett. (63): 215-219 (1997). Web SearchBibTeXDownload |
| 18 | Separating an Object from its Cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1997, 221-230. Web SearchBibTeXDownload |
| 1996 |
|---|
| 17 | Point Location in Zones of K-flats in Arrangements. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink. Comput. Geom. (6): 131-143 (1996). Web SearchBibTeXDownload |
| 16 | The Overlay of Lower Envelopes and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Discrete & Computational Geometry (15): 1-13 (1996). Web SearchBibTeXDownload |
| 15 | Computing the Maximum Overlap of Two Convex Polygons Under Translations. Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud. ISAAC 1996, 126-135. Web SearchBibTeXDownload |
| 1995 |
|---|
| 14 | On Lazy Randomized Incremental Construction. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf. Discrete & Computational Geometry (14): 261-286 (1995). Web SearchBibTeXDownload |
| 13 | Piecewise Linear Paths Among Convex Obstacles. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. Discrete & Computational Geometry (14): 9-29 (1995). Web SearchBibTeXDownload |
| 12 | Cuttings and applications. Mark de Berg, Otfried Schwarzkopf. Int. J. Comput. Geometry Appl. (5): 343-355 (1995). Web SearchBibTeX |
| 11 | The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Symposium on Computational Geometry 1995, 182-189. Web SearchBibTeXDownload |
| 10 | Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. Theor. Comput. Sci. (140): 301-317 (1995). Web SearchBibTeXDownload |
| 1994 |
|---|
| 9 | Computing and Verifying Depth Orders. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf. SIAM J. Comput. (23): 437-446 (1994). Web SearchBibTeXDownload |
| 8 | On lazy randomized incremental construction. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf. STOC 1994, 105-114. Web SearchBibTeXDownload |
| 7 | Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1994, 67-75. Web SearchBibTeXDownload |
| 6 | Computing Many Faces in Arrangements of Lines and Segments. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1994, 76-84. Web SearchBibTeXDownload |
| 1993 |
|---|
| 5 | Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. ISAAC 1993, 1-10. Web SearchBibTeXDownload |
| 4 | Piecewise linear paths among convex obstacles. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. STOC 1993, 505-514. Web SearchBibTeXDownload |
| 1992 |
|---|
| 3 | Computing and Verifying Depth Orders. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf. Symposium on Computational Geometry 1992, 138-145. Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Discrete & Computational Geometry (6): 407-422 (1991). Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 | Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Symposium on Computational Geometry 1990, 203-210. Web SearchBibTeXDownload |
