Hee-Kap Ahn

According to our database1, Hee-Kap Ahn authored at least 87 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
Discrete & Computational Geometry, 2020

2019
Computing the center region and its variants.
Theor. Comput. Sci., 2019

Minimum-width annulus with outliers: Circular, square, and rectangular cases.
Inf. Process. Lett., 2019

Computing a geodesic two-center of points in a simple polygon.
Comput. Geom., 2019

Finding pairwise intersections of rectangles in a query rectangle.
Comput. Geom., 2019

Assigning weights to minimize the covering radius in the plane.
Comput. Geom., 2019

On Romeo and Juliet problems: Minimizing distance-to-sight.
Comput. Geom., 2019

Faster algorithms for growing prioritized disks and rectangles.
Comput. Geom., 2019

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

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms.
Algorithmica, 2019

Maximizing Dominance in the Plane and Its Applications.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Maximum-Area Rectangles in a Simple Polygon.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Geometric matching algorithms for two realistic terrains.
Theor. Comput. Sci., 2018

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon.
CoRR, 2018

The geodesic 2-center problem in a simple polygon.
Comput. Geom., 2018

Minimum-Width Square Annulus Intersecting Polygons.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances.
Proceedings of the Research in Attacks, Intrusions, and Defenses, 2018

Point Location in Dynamic Planar Subdivisions.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Approximate Range Queries for Clustering.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Polygon Queries for Convex Hulls of Points.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Product Quantized Translation for Fast Nearest Neighbor Search.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Realistic roofs without local minimum edges over a rectilinear polygon.
Theor. Comput. Sci., 2017

Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16).
NII Shonan Meet. Rep., 2017

Top-k Manhattan spatial skyline queries.
Inf. Process. Lett., 2017

Bundling Two Simple Polygons to Minimize Their Convex Hull.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Time-Space Trade-Off for Triangulations of Points in the Plane.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry, 2016

Bundling three convex polygons to minimize area or perimeter.
Comput. Geom., 2016

Guest Editor's Foreword.
Algorithmica, 2016

Constrained Geodesic Centers of a Simple Polygon.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A Middle Curve Based on Discrete Fréchet Distance.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Group nearest-neighbor queries in the L1 plane.
Theor. Comput. Sci., 2015

An improved data stream algorithm for clustering.
Comput. Geom., 2015

The 2-Center Problem in a Simple Polygon.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
MSSQ: Manhattan Spatial Skyline Queries.
Inf. Syst., 2014

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2014

Computing k Centers over Streaming Data for Small k.
Int. J. Comput. Geometry Appl., 2014

Overlap of convex polytopes under rigid motion.
Comput. Geom., 2014

A Generalization of the Convex Kakeya Problem.
Algorithmica, 2014

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

2013
Covering and piercing disks with two centers.
Comput. Geom., 2013

Maximum overlap of convex polytopes under translation.
Comput. Geom., 2013

Realistic roofs over a rectilinear polygon.
Comput. Geom., 2013

Group Nearest Neighbor Queries in the L 1 Plane.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Computing the Discrete FRéChet Distance with Imprecise Input.
Int. J. Comput. Geometry 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

Computing k-center over Streaming Data for Small k.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Rectilinear Covering for Imprecise Input Points - (Extended Abstract).
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

A fast nearest neighbor search algorithm by nonlinear embedding.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011
Covering a Point Set by Two Disjoint Rectangles.
Int. J. Comput. Geometry Appl., 2011

Adaptive Algorithms for Planar Convex Hull Problems.
IEICE Transactions, 2011

Spatial skyline queries: exact and approximation algorithms.
GeoInformatica, 2011

Empty pseudo-triangles in point sets.
Discret. Appl. Math., 2011

Covering points by disjoint boxes with outliers.
Comput. Geom., 2011

Convergent Bounds on the Euclidean Distance.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Generating Realistic Roofs over a Rectilinear Polygon.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Dilation-Optimal Edge Deletion in Polygonal Cycles.
Int. J. Comput. Geometry Appl., 2010

Covering a simple polygon by monotone directions.
Comput. Geom., 2010

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

Computing minimum-area rectilinear convex hull and L-shape.
Comput. Geom., 2009

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

Casting an Object with a Core.
Algorithmica, 2009

Spatial Skyline Queries: An Efficient Geometric Algorithm.
Proceedings of the Advances in Spatial and Temporal Databases, 2009

Square and Rectangle Covering with Outliers.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

Optimal Empty Pseudo-Triangles in a Point Set.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Aperture-Angle and Hausdorff-Approximation of Convex Figures.
Discrete & Computational Geometry, 2008

Maximum overlap and minimum convex hull of two convex polyhedra under translations.
Comput. Geom., 2008

Covering a Point Set by Two Disjoint Rectangles.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

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

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

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

Casting with Skewed Ejection Direction.
Algorithmica, 2006

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

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

The reflex-free hull.
Int. J. Comput. Geometry Appl., 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
Building bridges between convex region.
Comput. Geom., 2003

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

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

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

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

Flipping your Lid.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

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


  Loading...