Otfried Cheong

Discret. Comput. Geom., September, 2024

Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

How Can Biclique Covers Help in Matching Problems (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Geometric Matching and Bottleneck Problems.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Covering families of triangles.

[BibT_eX]

[DOI]

Period. Math. Hung., September, 2023

Geometric Assignment and Geometric Bottleneck.

[BibT_eX]

[DOI]

CoRR, 2023

Weakly and Strongly Fan-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

The inverse Kakeya problem.

[BibT_eX]

[DOI]

Sergio Cabello

Michael Gene Dobbins

Period. Math. Hung., 2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

The Thickness of Fan-Planar Graphs is At Most Three.

[BibT_eX]

[DOI]

Maximilian Pfister

Lena Schlipf

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Fitting a graph to one-dimensional data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Smallest universal covers for families of triangles.

[BibT_eX]

[DOI]

Ji-won Park

Comput. Geom., 2021

Computation of spatial skyline points.

[BibT_eX]

[DOI]

Comput. Geom., 2021

2020

Fitting a Graph to One-Dimensional Data.

[BibT_eX]

Taegyoung Lee

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Covering many points with a small-area box.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

The minimum convex container of two convex polytopes under translations.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Packing 2D Disks into a 3D Container.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

The Reverse Kakeya Problem.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Finding Largest Common Point Sets.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Computational Geometry (Dagstuhl Seminar 17171).

[BibT_eX]

[DOI]

Anne Driemel

Jeff Erickson

Dagstuhl Reports, 2017

Shortcuts for the Circle.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Placing your Coins on a Shelf.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

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

[BibT_eX]

[DOI]

Yoshio Okamoto

NII Shonan Meet. Rep., 2016

Geometric permutations of non-overlapping unit balls revisited.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Finding largest rectangles in convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Computational Geometry (Dagstuhl Seminar 15111).

[BibT_eX]

[DOI]

Jeff Erickson

Monique Teillaud

Dagstuhl Reports, 2015

2014

Finding Largest Rectangles in Convex Polygons.

[BibT_eX]

[DOI]

Sergio Cabello

Lena Schlipf

CoRR, 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Minimum Convex Container of Two Convex Polytopes under Translations.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Single-Source Dilation-Bounded Minimum Spanning Trees.

[BibT_eX]

[DOI]

Changryeol Lee

Int. J. Comput. Geom. Appl., 2013

Set systems and families of permutations with small traces.

[BibT_eX]

[DOI]

Cyril Nicaud

Eur. J. Comb., 2013

Computational Geometry (Dagstuhl Seminar 13101).

[BibT_eX]

[DOI]

Kurt Mehlhorn

Monique Teillaud

Dagstuhl Reports, 2013

On the Number of Edges of Fan-Crossing Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Fast Algorithm for Data Collection along a Fixed Track.

[BibT_eX]

[DOI]

Radwa El Shawi

Joachim Gudmundsson

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Yoshio Okamoto

Int. J. Comput. Geom. Appl., 2012

Reachability by paths of bounded curvature in a convex polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Aligning Two Convex Figures to Minimize Area or Perimeter.

[BibT_eX]

[DOI]

Algorithmica, 2012

A Generalization of the Convex Kakeya Problem.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

The Cost of Bounded Curvature.

[BibT_eX]

[DOI]

Hyo-Sil Kim

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Reverse Nearest Neighbor Queries in Fixed Dimension.

[BibT_eX]

[DOI]

Antoine Vigneron

Juyoung Yon

Int. J. Comput. Geom. Appl., 2011

Lines Pinning Lines.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

A note on the perimeter of fat objects.

[BibT_eX]

[DOI]

Prosenjit Bose

Vida Dujmovic

Comput. Geom., 2011

2010

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

[BibT_eX]

[DOI]

Comput. Geom., 2010

Computation of Non-dominated Points Using Compact Voronoi Diagrams.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

On the perimeter of fat objects.

[BibT_eX]

[DOI]

Prosenjit Bose

Vida Dujmovic

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Lower Bounds for Pinning Lines by Balls (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Nina Amenta

Discret. Comput. Geom., 2009

On Finding Non-dominated Points using Compact Voronoi Diagrams

[BibT_eX]

[DOI]

Binay K. Bhattacharya

CoRR, 2009

Lower Bounds for Pinning Lines by Balls

[BibT_eX]

[DOI]

CoRR, 2009

Measuring the Similarity of Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Line Transversals and Pinning Numbers.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Sparse geometric graphs with small dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Computational geometry: algorithms and applications, 3rd Edition.

[BibT_eX]

[DOI]

Springer, ISBN: 9783540779735, 2008

2007

Parabola Separation Queries and their Application to Stone Throwing.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

The Hadwiger Number of Jordan Regions Is Unbounded.

[BibT_eX]

[DOI]

Mira Lee

Discret. Comput. Geom., 2007

Hadwiger and Helly-type theorems for disjoint unit spheres

[BibT_eX]

[DOI]

CoRR, 2007

I/O-Efficient Flow Modeling on Fat Terrains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Farthest-Polygon Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Aperture-angle and Hausdorff-approximation of convex figures.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

The Harmony of Spheres.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Computing a Minimum-Dilation Spanning Tree is NP-hard.

[BibT_eX]

[DOI]

Herman J. Haverkort

Mira Lee

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Constructing Optimal Highways.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

Area-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Throwing Stones Inside Simple Polygons .

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

The Voronoi Diagram of Curved Objects.

[BibT_eX]

[DOI]

Helmut Alt

Antoine Vigneron

Discret. Comput. Geom., 2005

Geometric permutations of disjoint unit spheres.

[BibT_eX]

[DOI]

Hyeon-Suk Na

Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Sparse Geometric Graphs with Small Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Stacking and Bundling Two Convex Polygons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Hadwiger and Helly-type theorems for disjoint unit spheres in R<sup>3</sup>.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Maximizing the overlap of two planar convex sets under rigid motions.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Randomization and derandomization.

[BibT_eX]

[DOI]

Ketan Mulmuley

Edgar Ramos

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

Competitive facility location: the Voronoi game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

On simplifying dot maps.

[BibT_eX]

[DOI]

Comput. Geom., 2004

On finding a guard that sees most and a shop that sells most.

[BibT_eX]

[DOI]

Alon Efrat

Sariel Har-Peled

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Building bridges between convex region.

[BibT_eX]

[DOI]

Chan-Su Shin

Comput. Geom., 2003

Disjoint Unit Spheres admit at Most Two Line Transversals.

[BibT_eX]

[DOI]

Hyeon-Suk Na

Proceedings of the Algorithms, 2003

2002

Voronoi diagrams on the spher.

[BibT_eX]

[DOI]

Hyeon-Suk Na

Chung-Nim Lee

Comput. Geom., 2002

Casting a Polyhedron with Directional Uncertainty.

[BibT_eX]

[DOI]

René van Oostrum

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

The one-round Voronoi game.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Reaching a Polygon with Directional Uncertainty.

[BibT_eX]

[DOI]

René van Oostrum

Int. J. Comput. Geom. Appl., 2001

Computing Farthest Neighbors on a Convex Polytope.

[BibT_eX]

[DOI]

Chan-Su Shin

Antoine Vigneron

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Competitive Facility Location along a Highway.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

The reflex-free hull.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

Reachability by paths of bounded curvature in convex polygons.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Spanning Trees Crossing Few Barriers.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

The visibility region of points in a simple polygon.

[BibT_eX]

[DOI]

René van Oostrum

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Casting with skewed ejection direction revisited.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Casting with Skewed Ejection Direction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

Computing a Single Cell in the Overlay of Two Simple Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

Separating an Object from its Cast.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Range Searching in Low-Density Environments.

[BibT_eX]

[DOI]

Jules Vleugels

Inf. Process. Lett., 1996

The Overlay of Lower Envelopes and Its Applications.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

Point Location in Zones of K-flats in Arrangements.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Separating and Shattering Long Line Segments.

[BibT_eX]

[DOI]

Alon Efrat

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Computing the Maximum Overlap of Two Convex Polygons Under Translations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Cuttings and applications.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1995

Bounds on the Size of Merging Networks.

[BibT_eX]

[DOI]

Martin Aigner

Discret. Appl. Math., 1995

The Extensible Drawing Editor Ipe.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Immobilizing Polygons against a Wall.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The Voronoi Diagram of Curved Objects.

[BibT_eX]

[DOI]

Helmut Alt

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The Overlay of Lower Envelopes in Three Dimensions and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

On lazy randomized incremental construction.

[BibT_eX]

[DOI]

Katrin Dobrindt

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Computing Many Faces in Arrangements of Lines and Segments.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Motion Planning for Vacuum Cleaner Robots.

[BibT_eX]

Chantal Wentink

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

On Ray Shooting in Convex Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

A deterministic algorithm for the three-dimensional diameter problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Piecewise linear paths among convex obstacles.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Reaching a Goal with Directional Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Computing Convolutions on Mesh-Like Structures.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992

Dynamic maintenance of convex polytopes and related structures.

[BibT_eX]

[DOI]

PhD thesis, 1992

Parallel Computation of Distance Transforms - Erratum.

[BibT_eX]

Algorithmica, 1992

Ray Shooting in Convex Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Linear Optimization Queries.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Computing and Verifying Depth Orders.

[BibT_eX]

[DOI]

Mark H. Overmars

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Discret. Comput. Geom., 1991

Parallel Computation of Disease Transforms.

[BibT_eX]

[DOI]

Algorithmica, 1991

Dynamic Maintenance of Geometric Structures Made Easy

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams.

[BibT_eX]

[DOI]

Franz Aurenhammer

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Approximation of Convex Figures by Pairs of Rectangles.

[BibT_eX]

[DOI]

Proceedings of the STACS 90, 1990

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract).

[BibT_eX]

[DOI]