Otfried Cheong

According to our database1, Otfried Cheong authored at least 120 papers between 1989 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Covering many points with a small-area box.
JoCG, 2019

Shortcuts for the circle.
Comput. Geom., 2019

The minimum convex container of two convex polytopes under translations.
Comput. Geom., 2019

Packing 2D Disks into a 3D Container.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018
Placing your coins on a shelf.
JoCG, 2018

Fitting a Graph to One-Dimensional Data.
CoRR, 2018

The Reverse Kakeya Problem.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Finding Largest Common Point Sets.
Int. J. Comput. Geom. Appl., 2017

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.
Discret. Comput. Geom., 2017

Computational Geometry (Dagstuhl Seminar 17171).
Dagstuhl Reports, 2017

2016
Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9).
NII Shonan Meet. Rep., 2016

Geometric permutations of non-overlapping unit balls revisited.
Comput. Geom., 2016

Finding largest rectangles in convex polygons.
Comput. Geom., 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Computational Geometry (Dagstuhl Seminar 15111).
Dagstuhl Reports, 2015

On the Number of Edges of Fan-Crossing Free Graphs.
Algorithmica, 2015

2014
A fast algorithm for data collection along a fixed track.
Theor. Comput. Sci., 2014

Finding Largest Rectangles in Convex Polygons.
CoRR, 2014

A Generalization of the Convex Kakeya Problem.
Algorithmica, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Minimum Convex Container of Two Convex Polytopes under Translations.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Single-Source Dilation-Bounded Minimum Spanning Trees.
Int. J. Comput. Geom. Appl., 2013

Set systems and families of permutations with small traces.
Eur. J. Comb., 2013

Computational Geometry (Dagstuhl Seminar 13101).
Dagstuhl Reports, 2013

The cost of bounded curvature.
Comput. Geom., 2013

2012
Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2012

Reachability by paths of bounded curvature in a convex polygon.
Comput. Geom., 2012

Aligning Two Convex Figures to Minimize Area or Perimeter.
Algorithmica, 2012

2011
Reverse Nearest Neighbor Queries in Fixed Dimension.
Int. J. Comput. Geom. Appl., 2011

Lines Pinning Lines.
Discret. Comput. Geom., 2011

Farthest-polygon Voronoi diagrams.
Comput. Geom., 2011

A note on the perimeter of fat objects.
Comput. Geom., 2011

2010
The complexity of flow on fat terrains and its i/o-efficient computation.
Comput. Geom., 2010

Computation of Non-dominated Points Using Compact Voronoi Diagrams.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

On the perimeter of fat objects.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

Lower Bounds for Pinning Lines by Balls (Extended Abstract).
Electron. Notes Discret. Math., 2009

On Finding Non-dominated Points using Compact Voronoi Diagrams
CoRR, 2009

Lower Bounds for Pinning Lines by Balls
CoRR, 2009

Measuring the Similarity of Geometric Graphs.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Line Transversals and Pinning Numbers.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008
Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2008

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.
Discret. Comput. Geom., 2008

Aperture-Angle and Hausdorff-Approximation of Convex Figures.
Discret. Comput. Geom., 2008

Computing a minimum-dilation spanning tree is NP-hard.
Comput. Geom., 2008

Sparse geometric graphs with small dilation.
Comput. Geom., 2008

Computational geometry: algorithms and applications, 3rd Edition.
Springer, ISBN: 9783540779735, 2008

2007
Parabola Separation Queries and their Application to Stone Throwing.
Int. J. Comput. Geom. Appl., 2007

The Hadwiger Number of Jordan Regions Is Unbounded.
Discret. Comput. Geom., 2007

Finding a Guard that Sees Most and a Shop that Sells Most.
Discret. Comput. Geom., 2007

Hadwiger and Helly-type theorems for disjoint unit spheres
CoRR, 2007

Maximizing the overlap of two planar convex sets under rigid motions.
Comput. Geom., 2007

I/O-Efficient Flow Modeling on Fat Terrains.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

The Harmony of Spheres.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Comput. Geom., 2006

Casting with Skewed Ejection Direction.
Algorithmica, 2006

Throwing Stones Inside Simple Polygons .
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
The Voronoi Diagram of Curved Objects.
Discret. Comput. Geom., 2005

Geometric permutations of disjoint unit spheres.
Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.
Comput. Geom., 2005

Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Stacking and Bundling Two Convex Polygons.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Hadwiger and Helly-type theorems for disjoint unit spheres in R<sup>3</sup>.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Randomization and derandomization.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Competitive facility location: the Voronoi game.
Theor. Comput. Sci., 2004

The reflex-free hull.
Int. J. Comput. Geom. Appl., 2004

The One-Round Voronoi Game.
Discret. Comput. Geom., 2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.
Discret. Comput. Geom., 2004

On simplifying dot maps.
Comput. Geom., 2004

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Computing farthest neighbors on a convex polytope.
Theor. Comput. Sci., 2003

Spanning Trees Crossing Few Barriers.
Discret. Comput. Geom., 2003

Building bridges between convex region.
Comput. Geom., 2003

Casting a polyhedron with directional uncertainty.
Comput. Geom., 2003

Disjoint Unit Spheres admit at Most Two Line Transversals.
Proceedings of the Algorithms, 2003

2002
Voronoi diagrams on the spher.
Comput. Geom., 2002

Separating an object from its cast.
Comput. Aided Des., 2002

2001
Reaching a Polygon with Directional Uncertainty.
Int. J. Comput. Geom. Appl., 2001

Competitive Facility Location along a Highway.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points.
Proceedings of the Algorithms, 2000

Reachability by paths of bounded curvature in convex polygons.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

The visibility region of points in a simple polygon.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Casting with skewed ejection direction revisited.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Computing Many Faces in Arrangements of Lines and Segments.
SIAM J. Comput., 1998

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.
SIAM J. Comput., 1998

Computing the Maximum Overlap of Two Convex Polygons under Translations.
Theory Comput. Syst., 1998

Approximation of convex figures by pairs of rectangles.
Comput. Geom., 1998

1997
Separating and Shattering Long Line Segments.
Inf. Process. Lett., 1997

Computing a Single Cell in the Overlay of Two Simple Polygons.
Inf. Process. Lett., 1997

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces.
Discret. Comput. Geom., 1997

1996
Range Searching in Low-Density Environments.
Inf. Process. Lett., 1996

The Overlay of Lower Envelopes and Its Applications.
Discret. Comput. Geom., 1996

A Deterministic Algorithm for the Three-dimensional Diameter Problem.
Comput. Geom., 1996

Point Location in Zones of K-flats in Arrangements.
Comput. Geom., 1996

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci., 1995

Cuttings and applications.
Int. J. Comput. Geom. Appl., 1995

Piecewise Linear Paths Among Convex Obstacles.
Discret. Comput. Geom., 1995

On Lazy Randomized Incremental Construction.
Discret. Comput. Geom., 1995

Bounds on the Size of Merging Networks.
Discret. Appl. Math., 1995

The Extensible Drawing Editor Ipe.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Immobilizing Polygons against a Wall.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The Voronoi Diagram of Curved Objects.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The Overlay of Lower Envelopes in Three Dimensions and Its Applications.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Computing and Verifying Depth Orders.
SIAM J. Comput., 1994

Motion Planning for Vacuum Cleaner Robots.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
On Ray Shooting in Convex Polytopes.
Discret. Comput. Geom., 1993

Computing Convolutions on Mesh-Like Structures.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992
Dynamic maintenance of convex polytopes and related structures.
PhD thesis, 1992

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams.
Int. J. Comput. Geom. Appl., 1992

Parallel Computation of Distance Transforms - Erratum.
Algorithmica, 1992

Ray Shooting in Convex Polytopes.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Linear Optimization Queries.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Discret. Comput. Geom., 1991

Parallel Computation of Disease Transforms.
Algorithmica, 1991

Dynamic Maintenance of Geometric Structures Made Easy
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract).
Proceedings of the STACS 89, 1989


  Loading...