Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract). - Otfried Schwarzkopf (STACS, 1989)

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. - Pankaj K. Agarwal; Herbert Edelsbrunner; Otfried Schwarzkopf; Emo Welzl (SCG, 1990)

Dynamic Maintenance of Geometric Structures Made Easy - Otfried Schwarzkopf (FOCS, 1991)

Parallel Computation of Disease Transforms. - Otfried Schwarzkopf (Algorithmica, 1991)

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. - Pankaj K. Agarwal; Herbert Edelsbrunner; Otfried Schwarzkopf (Discret. Comput. Geom., 1991)

Linear Optimization Queries. - Jirí Matousek 001; Otfried Schwarzkopf (SCG, 1992)

Ray Shooting in Convex Polytopes. - Otfried Schwarzkopf (SCG, 1992)

Parallel Computation of Distance Transforms - Erratum. - Otfried Schwarzkopf (Algorithmica, 1992)

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. - Franz Aurenhammer; Otfried Schwarzkopf (Int. J. Comput. Geom. Appl., 1992)

Dynamic maintenance of convex polytopes and related structures. - Otfried Schwarzkopf (1992)

Computing Convolutions on Mesh-Like Structures. - Otfried Schwarzkopf (IPPS, 1993)

On Ray Shooting in Convex Polytopes. - Jirí Matousek 001; Otfried Schwarzkopf (Discret. Comput. Geom., 1993)

Motion Planning for Vacuum Cleaner Robots. - Chantal Wentink; Otfried Schwarzkopf (CCCG, 1994)

Computing and Verifying Depth Orders. - Mark de Berg; Mark H. Overmars; Otfried Schwarzkopf (SIAM J. Comput., 1994)

The Overlay of Lower Envelopes in Three Dimensions and Its Applications. - Pankaj K. Agarwal; Otfried Schwarzkopf; Micha Sharir (SCG, 1995)

The Voronoi Diagram of Curved Objects. - Helmut Alt; Otfried Schwarzkopf (SCG, 1995)

Immobilizing Polygons against a Wall. - Mark H. Overmars; Anil S. Rao; Otfried Schwarzkopf; Chantal Wentink (SCG, 1995)

The Extensible Drawing Editor Ipe. - Otfried Schwarzkopf (SCG, 1995)

Bounds on the Size of Merging Networks. - Martin Aigner 001; Otfried Schwarzkopf (Discret. Appl. Math., 1995)

On Lazy Randomized Incremental Construction. - Mark de Berg; Katrin Dobrindt; Otfried Schwarzkopf (Discret. Comput. Geom., 1995)

Piecewise Linear Paths Among Convex Obstacles. - Mark de Berg; Jirí Matousek 001; Otfried Schwarzkopf (Discret. Comput. Geom., 1995)

Cuttings and applications. - Mark de Berg; Otfried Schwarzkopf (Int. J. Comput. Geom. Appl., 1995)

Reaching a Goal with Directional Uncertainty. - Mark de Berg; Leonidas J. Guibas; Dan Halperin; Mark H. Overmars; Otfried Schwarzkopf; Micha Sharir; Monique Teillaud (Theor. Comput. Sci., 1995)

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. - Otfried Schwarzkopf; Micha Sharir (SCG, 1996)

Point Location in Zones of K-flats in Arrangements. - Mark de Berg; Marc J. van Kreveld; Otfried Schwarzkopf; Jack Snoeyink (Comput. Geom., 1996)

A Deterministic Algorithm for the Three-dimensional Diameter Problem. - Jirí Matousek 001; Otfried Schwarzkopf (Comput. Geom., 1996)

The Overlay of Lower Envelopes and Its Applications. - Pankaj K. Agarwal; Otfried Schwarzkopf; Micha Sharir (Discret. Comput. Geom., 1996)

Range Searching in Low-Density Environments. - Otfried Schwarzkopf; Jules Vleugels (Inf. Process. Lett., 1996)

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. - Otfried Schwarzkopf; Micha Sharir (Discret. Comput. Geom., 1997)

Computing a Single Cell in the Overlay of Two Simple Polygons. - Mark de Berg; Olivier Devillers; Katrin Dobrindt; Otfried Schwarzkopf (Inf. Process. Lett., 1997)

Separating and Shattering Long Line Segments. - Alon Efrat; Otfried Schwarzkopf (Inf. Process. Lett., 1997)

Approximation of convex figures by pairs of rectangles. - Otfried Schwarzkopf; Ulrich Fuchs 001; Günter Rote; Emo Welzl (Comput. Geom., 1998)

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., 1998)

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. - Pankaj K. Agarwal; Mark de Berg; Jirí Matousek 001; Otfried Schwarzkopf (SIAM J. Comput., 1998)

Computing Many Faces in Arrangements of Lines and Segments. - Pankaj K. Agarwal; Jirí Matousek 001; Otfried Schwarzkopf (SIAM J. Comput., 1998)

Casting with skewed ejection direction revisited. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong (CCCG, 1999)

The visibility region of points in a simple polygon. - Otfried Cheong; René van Oostrum (CCCG, 1999)

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. - Siu-Wing Cheng; Hazel Everett; Otfried Cheong; René van Oostrum (SCG, 1999)

Reachability by paths of bounded curvature in convex polygons. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (SCG, 2000)

Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. - Jae-Ha Lee; Otfried Cheong; Woo-Cheol Kwon; Sung Yong Shin; Kyung-Yong Chwa (ESA, 2000)

Competitive Facility Location along a Highway. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (COCOON, 2001)

Reaching a Polygon with Directional Uncertainty. - Otfried Cheong; René van Oostrum (Int. J. Comput. Geom. Appl., 2001)

Separating an object from its cast. - Hee-Kap Ahn; Mark de Berg; Prosenjit Bose; Siu-Wing Cheng; Dan Halperin; Jirí Matousek 001; Otfried Schwarzkopf (Comput. Aided Des., 2002)

Voronoi diagrams on the spher. - Hyeon-Suk Na; Chung-Nim Lee; Otfried Cheong (Comput. Geom., 2002)

Disjoint Unit Spheres admit at Most Two Line Transversals. - Otfried Cheong; Xavier Goaoc; Hyeon-Suk Na (ESA, 2003)

Casting a polyhedron with directional uncertainty. - Hee-Kap Ahn; Otfried Cheong; René van Oostrum (Comput. Geom., 2003)

Building bridges between convex region. - Hee-Kap Ahn; Otfried Cheong; Chan-Su Shin (Comput. Geom., 2003)

Spanning Trees Crossing Few Barriers. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Leonidas J. Guibas; Jack Snoeyink; Hisao Tamaki (Discret. Comput. Geom., 2003)

Computing farthest neighbors on a convex polytope. - Otfried Cheong; Chan-Su Shin; Antoine Vigneron (Theor. Comput. Sci., 2003)

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (COCOON, 2004)

On simplifying dot maps. - Mark de Berg; Prosenjit Bose; Otfried Cheong; Pat Morin (Comput. Geom., 2004)

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. - Siu-Wing Cheng; Otfried Cheong; Hazel Everett; René van Oostrum (Discret. Comput. Geom., 2004)

The One-Round Voronoi Game. - Otfried Cheong; Sariel Har-Peled; Nathan Linial; Jirí Matousek 001 (Discret. Comput. Geom., 2004)

The reflex-free hull. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Jack Snoeyink (Int. J. Comput. Geom. Appl., 2004)

Competitive facility location: the Voronoi game. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (Theor. Comput. Sci., 2004)

Randomization and derandomization. - Otfried Cheong; Ketan Mulmuley; Edgar Ramos (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Hadwiger and Helly-type theorems for disjoint unit spheres in R3. - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen (SCG, 2005)

Stacking and Bundling Two Convex Polygons. - Hee-Kap Ahn; Otfried Cheong (ISAAC, 2005)

Sparse Geometric Graphs with Small Dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Antoine Vigneron (ISAAC, 2005)

Optimal spanners for axis-aligned rectangles. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Hazel Everett; Herman J. Haverkort; Naoki Katoh; Alexander Wolff 001 (Comput. Geom., 2005)

Geometric permutations of disjoint unit spheres. - Otfried Cheong; Xavier Goaoc; Hyeon-Suk Na (Comput. Geom., 2005)

The Voronoi Diagram of Curved Objects. - Helmut Alt; Otfried Cheong; Antoine Vigneron (Discret. Comput. Geom., 2005)

Throwing Stones Inside Simple Polygons . - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (AAIM, 2006)

Casting with Skewed Ejection Direction. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong (Algorithmica, 2006)

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2006)

Area-preserving approximations of polygonal paths. - Prosenjit Bose; Sergio Cabello; Otfried Cheong; Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (J. Discrete Algorithms, 2006)

The Harmony of Spheres. - Otfried Cheong (CCCG, 2007)

I/O-Efficient Flow Modeling on Fat Terrains. - Mark de Berg; Otfried Cheong; Herman J. Haverkort; Jung Gun Lim; Laura Toma (WADS, 2007)

Maximizing the overlap of two planar convex sets under rigid motions. - Hee-Kap Ahn; Otfried Cheong; Chong-Dae Park; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2007)

Hadwiger and Helly-type theorems for disjoint unit spheres - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen; Sylvain Petitjean (CoRR, 2007)

Finding a Guard that Sees Most and a Shop that Sells Most. - Otfried Cheong; Alon Efrat; Sariel Har-Peled (Discret. Comput. Geom., 2007)

The Hadwiger Number of Jordan Regions Is Unbounded. - Otfried Cheong; Mira Lee (Discret. Comput. Geom., 2007)

Parabola Separation Queries and their Application to Stone Throwing. - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (Int. J. Comput. Geom. Appl., 2007)

Computational geometry: algorithms and applications, 3rd Edition. - Mark de Berg; Otfried Cheong; Marc J. van Kreveld; Mark H. Overmars (Springer, 2008)

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., 2008)

Computing a minimum-dilation spanning tree is NP-hard. - Otfried Cheong; Herman J. Haverkort; Mira Lee (Comput. Geom., 2008)

Aperture-Angle and Hausdorff-Approximation of Convex Figures. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson (Discret. Comput. Geom., 2008)

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen; Sylvain Petitjean (Discret. Comput. Geom., 2008)

Guest Editors' Foreword. - Nina Amenta; Otfried Cheong (Int. J. Comput. Geom. Appl., 2008)

Line Transversals and Pinning Numbers. - Otfried Cheong (WALCOM, 2009)

Measuring the Similarity of Geometric Graphs. - Otfried Cheong; Joachim Gudmundsson; Hyo-Sil Kim; Daria Schymura; Fabian Stehn (SEA, 2009)

Lower Bounds for Pinning Lines by Balls - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen (CoRR, 2009)

On Finding Non-dominated Points using Compact Voronoi Diagrams - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (CoRR, 2009)

Lower Bounds for Pinning Lines by Balls (Extended Abstract). - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen (Electron. Notes Discret. Math., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

On the perimeter of fat objects. - Prosenjit Bose; Otfried Cheong; Vida Dujmovic (CCCG, 2010)

Computation of Non-dominated Points Using Compact Voronoi Diagrams. - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (WALCOM, 2010)

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., 2010)

A note on the perimeter of fat objects. - Prosenjit Bose; Otfried Cheong; Vida Dujmovic (Comput. Geom., 2011)

Farthest-polygon Voronoi diagrams. - Otfried Cheong; Hazel Everett; Marc Glisse; Joachim Gudmundsson; Samuel Hornus; Sylvain Lazard; Mira Lee; Hyeon-Suk Na (Comput. Geom., 2011)

Lines Pinning Lines. - Boris Aronov; Otfried Cheong; Xavier Goaoc; Günter Rote (Discret. Comput. Geom., 2011)

Reverse Nearest Neighbor Queries in Fixed Dimension. - Otfried Cheong; Antoine Vigneron; Juyoung Yon (Int. J. Comput. Geom. Appl., 2011)

Aligning Two Convex Figures to Minimize Area or Perimeter. - Hee-Kap Ahn; Otfried Cheong (Algorithmica, 2012)

Reachability by paths of bounded curvature in a convex polygon. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (Comput. Geom., 2012)

Guest Editors' Foreword. - Otfried Cheong; Yoshio Okamoto (Int. J. Comput. Geom. Appl., 2012)

The cost of bounded curvature. - Hyo-Sil Kim; Otfried Cheong (Comput. Geom., 2013)

Computational Geometry (Dagstuhl Seminar 13101). - Otfried Cheong; Kurt Mehlhorn; Monique Teillaud (Dagstuhl Reports, 2013)

Set systems and families of permutations with small traces. - Otfried Cheong; Xavier Goaoc; Cyril Nicaud (Eur. J. Comb., 2013)

Single-Source Dilation-Bounded Minimum Spanning Trees. - Otfried Cheong; Changryeol Lee (Int. J. Comput. Geom. Appl., 2013)

Minimum Convex Container of Two Convex Polytopes under Translations. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Dongwoo Park; Chan-Su Shin (CCCG, 2014)

Weight Balancing on Boundaries and Skeletons. - 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; et al. (SoCG, 2014)

A Generalization of the Convex Kakeya Problem. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron (Algorithmica, 2014)

Finding Largest Rectangles in Convex Polygons. - Sergio Cabello; Otfried Cheong; Lena Schlipf (CoRR, 2014)

A fast algorithm for data collection along a fixed track. - Otfried Cheong; Radwa El Shawi; Joachim Gudmundsson (Theor. Comput. Sci., 2014)

On the Number of Edges of Fan-Crossing Free Graphs. - Otfried Cheong; Sariel Har-Peled; Heuna Kim; Hyo-Sil Kim (Algorithmica, 2015)

Computational Geometry (Dagstuhl Seminar 15111). - Otfried Cheong; Jeff Erickson 001; Monique Teillaud (Dagstuhl Reports, 2015)

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. - Juyoung Yon; Sang Won Bae 001; Siu-Wing Cheng; Otfried Cheong; Bryan T. Wilkinson (SoCG, 2016)

Finding largest rectangles in convex polygons. - Sergio Cabello; Otfried Cheong; Christian Knauer; Lena Schlipf (Comput. Geom., 2016)

Geometric permutations of non-overlapping unit balls revisited. - Jae-Soon Ha; Otfried Cheong; Xavier Goaoc; Jungwoo Yang (Comput. Geom., 2016)

Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9). - Siu-Wing Cheng; Yoshio Okamoto; Otfried Cheong (NII Shonan Meet. Rep., 2016)

Computational Geometry (Dagstuhl Seminar 17171). - Otfried Cheong; Anne Driemel; Jeff Erickson 001 (Dagstuhl Reports, 2017)

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. - Boris Aronov; Otfried Cheong; Michael Gene Dobbins; Xavier Goaoc (Discret. Comput. Geom., 2017)

Finding Largest Common Point Sets. - Juyoung Yon; Siu-Wing Cheng; Otfried Cheong; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2017)

The Reverse Kakeya Problem. - Sang Won Bae 001; Sergio Cabello; Otfried Cheong; Yoonsung Choi; Fabian Stehn; Sang Duk Yoon (SoCG, 2018)

Placing your coins on a shelf. - Helmut Alt; Kevin Buchin; Steven Chaplick; Otfried Cheong; Philipp Kindermann; Christian Knauer; Fabian Stehn (J. Comput. Geom., 2018)

Packing 2D Disks into a 3D Container. - Helmut Alt; Otfried Cheong; Ji-won Park; Nadja Scharf (WALCOM, 2019)

The minimum convex container of two convex polytopes under translations. - Hee-Kap Ahn; Judit Abardia; Sang Won Bae 001; Otfried Cheong; Susanna Dann; Dongwoo Park; Chan-Su Shin (Comput. Geom., 2019)

Shortcuts for the circle. - Sang Won Bae 001; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2019)

Covering many points with a small-area box. - Mark de Berg; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer (J. Comput. Geom., 2019)

Fitting a Graph to One-Dimensional Data. - Siu-Wing Cheng; Otfried Cheong; Taegyoung Lee (CCCG, 2020)

Computation of spatial skyline points. - Binay Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (Comput. Geom., 2021)

Smallest universal covers for families of triangles. - Ji-won Park; Otfried Cheong (Comput. Geom., 2021)

Fitting a graph to one-dimensional data. - Siu-Wing Cheng; Otfried Cheong; Taegyoung Lee; Zhengtong Ren (Theor. Comput. Sci., 2021)

The Thickness of Fan-Planar Graphs is At Most Three. - Otfried Cheong; Maximilian Pfister 002; Lena Schlipf (GD, 2022)

Weight balancing on boundaries. - Luis Barba; Otfried Cheong; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot (J. Comput. Geom., 2022)

The inverse Kakeya problem. - Sergio Cabello; Otfried Cheong; Michael Gene Dobbins (Period. Math. Hung., 2022)

Weakly and Strongly Fan-Planar Graphs. - Otfried Cheong; Henry Förster; Julia Katheder; Maximilian Pfister 002; Lena Schlipf (GD (1), 2023)

Geometric Assignment and Geometric Bottleneck. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (CoRR, 2023)

Covering families of triangles. - Otfried Cheong; Olivier Devillers; Marc Glisse; Ji-won Park (Period. Math. Hung., 2023)

Geometric Matching and Bottleneck Problems. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (SoCG, 2024)

How Can Biclique Covers Help in Matching Problems (Invited Talk). - Otfried Cheong (GD, 2024)

Some New Results on Geometric Transversals. - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen (Discret. Comput. Geom., 2024)

Minimum-width double-slabs and widest empty slabs in high dimensions. - Taehoon Ahn 001; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Sang Duk Yoon (Comput. Geom., 2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra. - Boris Aronov; Sang Won Bae 001; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer; Raimund Seidel (CoRR, 2025)