Otfried Cheong

Sort by:

Computational geometry: algorithms and applications, 3rd Edition

Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars
1997

Now welcome, the most inspiring book today from a very professional writer in the world, computational geometry algorithms and applications 3rd edition. This is the book that many people in the world… (More)

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Cheong, Emo Welzl
Symposium on Computational Geometry
1990

<italic>We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in</italic> @@@@<supscrpt><italic>d</italic></supscrpt> <italic>in time… (More)

The Voronoi Diagram of Curved Objects

Helmut Alt, Otfried Cheong
Symposium on Computational Geometry
1995

Voronoi diagrams of curved objects can show certain phenomena that are often considered artifacts: The Voronoi diagram is not connected; there are pairs of objects whose bisector is a closed curve or… (More)

The Overlay of Lower Envelopes and Its Applications

Pankaj K. Agarwal, Otfried Cheong, Micha Sharir
Discrete & Computational Geometry
1996

Let F and 9 be two collections of a total of n bivariate algebraic functions of constant maximum degree. The minimization diagrams of F, 9 are the planar maps obtained by the xy-projections of the… (More)

On Ray Shooting in Convex Polytopes

Jirí Matousek, Otfried Cheong
Discrete & Computational Geometry
1993

Competitive facility location: the Voronoi game

Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
Theor. Comput. Sci.
2004

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is… (More)

Finding a Guard that Sees Most and a Shop that Sells Most

Otfried Cheong, Alon Efrat, Sariel Har-Peled
Discrete & Computational Geometry
2004

We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and near-linear time algorithm for finding the… (More)

Hadwiger and Helly-type theorems for disjoint unit spheres in R3

Otfried Cheong, Xavier Goaoc, Andreas Holmsen
Symposium on Computational Geometry
2005

Let S be an ordered set of disjoint unit spheres in R3 We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the entire family has a line… (More)

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams

Franz Aurenhammer, Otfried Cheong
Int. J. Comput. Geometry Appl.
1992

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams

Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Cheong
SIAM J. Comput.
1998

Filter Results:

Publication Year

Publication Type

Co-author

Journals and Conferences