Chan-Su Shin

Algorithmica, 2016

Covering Points with Convex Sets of Minimum Size.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.

[BibT_eX]

[DOI]

Antoine Vigneron

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons.

[BibT_eX]

[DOI]

Antoine Vigneron

CoRR, 2015

Minimum Rectilinear Polygons for Given Angle Sequences.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Minimum Convex Container of Two Convex Polytopes under Translations.

[BibT_eX]

[DOI]

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

Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.

[BibT_eX]

[DOI]

Peter Brass

Hyeon-Suk Na

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

A note on minimum-sum coverage by aligned disks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Realistic roofs over a rectilinear polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Range-Aggregate Queries for Geometric Extent Problems.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

The Onion Diagram: a Voronoi-like Tessellation of a Planar Line Space and its Applications.

[BibT_eX]

[DOI]

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

A Note on Minimum-Cost Coverage by Aligned Disks

[BibT_eX]

[DOI]

CoRR, 2012

Area Bounds of Rectilinear Polygons Realized by Angle Sequences.

[BibT_eX]

[DOI]

Yoshio Okamoto

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

The Aligned k-Center Problem.

[BibT_eX]

[DOI]

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

Covering and Piercing Disks with Two Centers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Generating Realistic Roofs over a Rectilinear Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Guarding a Polygon from Two Nearly-Opposite Directions.

[BibT_eX]

[DOI]

Peter Brass

Hyeon-Suk Na

Int. J. Comput. Geom. Appl., 2010

The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Untangling a Planar Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Computing k-Centers On a Line

[BibT_eX]

[DOI]

CoRR, 2009

Escaping offline searchers and isoperimetric theorems.

[BibT_eX]

[DOI]

Comput. Geom., 2009

On the minimum total length of interval systems expressing all intervals, and range-restricted queries.

[BibT_eX]

[DOI]

Comput. Geom., 2009

2008

Constructing the City Voronoi Diagram Faster.

[BibT_eX]

[DOI]

Robert Görke

Alexander Wolff

Int. J. Comput. Geom. Appl., 2008

Maximum overlap and minimum convex hull of two convex polyhedra under translations.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Peter Brass

Comput. Geom., 2008

Covering a Simple Polygon by Monotone Directions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Moving Vertices to Make Drawings Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 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

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

[BibT_eX]

[DOI]

Comput. Geom., 2006

2005

Adaptive Zooming in Point Set Labeling.

[BibT_eX]

[DOI]

Sheung-Hung Poon

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 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

Labeling Points with Weights.

[BibT_eX]

[DOI]

Algorithmica, 2004

Farthest-Point Queries with Geometric and Combinatorial Constraints.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Guarding Art Galleries by Guarding Witnesses.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 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]

Hee-Kap Ahn

Otfried Cheong

Comput. Geom., 2003

2002

Facility Location and the Geometric Minimum-Diameter Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Computing the Optimal Bridge between Two Polygons.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2001

Labeling a Rectilinear Map with Sliding Labels.

[BibT_eX]

[DOI]

Tae-Cheon Yang

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

Labeling Points with Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Computing Farthest Neighbors on a Convex Polytope.

[BibT_eX]

[DOI]

Otfried Cheong

Antoine Vigneron

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

2000

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes.

[BibT_eX]

[DOI]

Jae-Ha Lee

J. Parallel Distributed Comput., 2000

Placing two disks in a convex polygon.

[BibT_eX]

[DOI]

Tae-Cheon Yang

Inf. Process. Lett., 2000

Area-efficient algorithms for straight-line tree drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Efficient Algorithms for Two-Center Problems for a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998

The Widest <i>k</i>-Dense Corridor Problems.

[BibT_eX]

[DOI]

Sung Yong Shin

Inf. Process. Lett., 1998

Algorithms for Drawing Binary Trees in the Plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.

[BibT_eX]

[DOI]

Joonsoo Choi

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

Two-Center Problems for a Convex Polygon (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

New Competitive Strategies for Searching in Unknown Star-Shaped Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Directed Hamiltonian Packing in <i>d</i>-Dimensional Meshes and Its Application (Extended Abstract).

[BibT_eX]

[DOI]

Jae-Ha Lee

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

Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract).

[BibT_eX]

[DOI]