Hee-Kap Ahn

According to our database, Hee-Kap Ahn authored at least 123 papers between 1997 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Largest unit rectangles inscribed in a convex polygon.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Comput. Geom., 2025

Farthest-Point Voronoi Diagrams in the Hilbert Metric.

Minju Song, Mook Kwon Jung, Hee-Kap Ahn

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes.

Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn

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

Monotone Partitions of Simple Polygons.

Jaegun Lee, Hyojeong An, Hwi Kim, Hee-Kap Ahn

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Guarding Terrains with Guards on a Line.

Byeonguk Kang, Hwi Kim, Hee-Kap Ahn

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Covering Weighted Points Using Unit Squares.

Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

Minimum Partition of Polygons Under Width and Cut Constraints.

Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

Stacking Monotone Polytopes.

Hee-Kap Ahn, Seung Joon Lee, Sang Duk Yoon

Symmetry, September, 2024

Maximum Coverage by k Lines.

Chaeyoon Chung, Antoine Vigneron, Hee-Kap Ahn

Symmetry, February, 2024

Uniformly monotone partitioning of polygons.

Hwi Kim, Jaegun Lee, Hee-Kap Ahn

Theor. Comput. Sci., 2024

A linear-time algorithm for the center problem in weighted cycle graphs.

Taekang Eom, Hee-Kap Ahn

Inf. Process. Lett., 2024

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

Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Guarding Points on a Terrain by Watchtowers.

Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023

Rectangular partitions of a rectilinear polygon.

Hwi Kim, Jaegun Lee, Hee-Kap Ahn

Comput. Geom., 2023

Efficient k-Center Algorithms for Planar Points in Convex Position.

Jongmin Choi, Jaegun Lee, Hee-Kap Ahn

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Universal convex covering problems under affine dihedral group actions.

Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

Parallel Line Centers with Guaranteed Separation.

Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Universal convex covering problems under translation and discrete rotations.

Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama

CoRR, 2022

CGTA Awards.

Hee-Kap Ahn, Tamara Mtsentlintze, Jörg-Rüdiger Sack

Comput. Geom., 2022

Inscribing or Circumscribing a Histogon to a Convex Polygon.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles.

Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Uniformly Monotone Partitioning of Polygons Revisited.

Hwi Kim, Jaegun Lee, Hee-Kap Ahn

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Approximating Convex Polygons by Histogons.

Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Largest triangles in a polygon.

Seungjun Lee, Taekang Eom, Hee-Kap Ahn

Comput. Geom., 2021

Maximum-area and maximum-perimeter rectangles in polygons.

Yujin Choi, Seungjun Lee, Hee-Kap Ahn

Comput. Geom., 2021

Efficient planar two-center algorithms.

Jongmin Choi, Hee-Kap Ahn

Comput. Geom., 2021

Maximizing Dominance in the Plane and its Applications.

Jongmin Choi, Sergio Cabello, Hee-Kap Ahn

Algorithmica, 2021

Intersecting Disks Using Two Congruent Disks.

Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Covering Convex Polygons by Two Congruent Disks.

Jongmin Choi, Dahye Jeong, Hee-Kap Ahn

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Largest Similar Copies of Convex Polygons in Polygonal Domains.

Taekang Eom, Seungjun Lee, Hee-Kap Ahn

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles.

Mincheol Kim, Hee-Kap Ahn

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Rearranging a Sequence of Points onto a Line.

Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Largest similar copies of convex polygons amidst polygonal obstacles.

Taekang Eom, Seungjun Lee, Hee-Kap Ahn

CoRR, 2020

Efficient Planar Two-Center Algorithms.

Jong Min Choi, Hee-Kap Ahn

CoRR, 2020

Middle curves based on discrete Fréchet distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Comput. Geom., 2020

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon.

Eunjin Oh, Luis Barba, Hee-Kap Ahn

Algorithmica, 2020

Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain.

Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

The minimum convex container of two convex polytopes under translations.

Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin

Comput. Geom., 2019

Maximizing Dominance in the Plane and Its Applications.

Jong Min Choi, Sergio Cabello, Hee-Kap Ahn

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Maximum-Area Rectangles in a Simple Polygon.

Yujin Choi, Seungjun Lee, Hee-Kap Ahn

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

The geodesic 2-center problem in a simple polygon.

Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

Comput. Geom., 2018

Minimum-Width Square Annulus Intersecting Polygons.

Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.

Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Romeo and Juliet Problems: Minimizing Distance-to-Sight.

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances.

Jeong-Han Yun, Yoonho Hwang, Woomyo Lee, Hee-Kap Ahn, Sin-Kyu Kim

Proceedings of the Research in Attacks, Intrusions, and Defenses, 2018

Point Location in Dynamic Planar Subdivisions.

Eunjin Oh, Hee-Kap Ahn

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

Approximate Range Queries for Clustering.

Eunjin Oh, Hee-Kap Ahn

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

Polygon Queries for Convex Hulls of Points.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Product Quantized Translation for Fast Nearest Neighbor Search.

Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Realistic roofs without local minimum edges over a rectilinear polygon.

Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette

Theor. Comput. Sci., 2017

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

Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy

NII Shonan Meet. Rep., 2017

Bundling Two Simple Polygons to Minimize Their Convex Hull.

Jong Min Choi, Dongwoo Park, Hee-Kap Ahn

Proceedings of the WALCOM: Algorithms and Computation, 2017

Computing the Center Region and Its Variants.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the WALCOM: Algorithms and Computation, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.

Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron

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

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.

Eunjin Oh, Hee-Kap Ahn

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

Finding Pairwise Intersections of Rectangles in a Query Rectangle.

Eunjin Oh, Hee-Kap Ahn

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

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Time-Space Trade-Off for Triangulations of Points in the Plane.

Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Guest Editor's Foreword.

Hee-Kap Ahn, Chan-Su Shin

Algorithmica, 2016

Constrained Geodesic Centers of a Simple Polygon.

Eunjin Oh, Wanbin Son, Hee-Kap Ahn

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Computing a Geodesic Two-Center of Points in a Simple Polygon.

Eunjin Oh, Sang Won Bae, Hee-Kap Ahn

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Middle Curve Based on Discrete Fréchet Distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Assigning Weights to Minimize the Covering Radius in the Plane.

Eunjin Oh, Hee-Kap Ahn

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.

Eunjin Oh, Luis Barba, Hee-Kap Ahn

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

2015

Group nearest-neighbor queries in the _L₁ plane.

Wanbin Son, Sang Won Bae, Hee-Kap Ahn

Theor. Comput. Sci., 2015

Geometric Matching Algorithms for Two Realistic Terrains.

Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

The 2-Center Problem in a Simple Polygon.

Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Guest Editors' Foreword.

Hee-Kap Ahn, Antoine Vigneron

Int. J. Comput. Geom. Appl., 2014

Computing <i>k</i> Centers over Streaming Data for Small <i>k</i>.

Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son

Int. J. Comput. Geom. Appl., 2014

Top-k Manhattan Spatial Skyline Queries.

Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

An Improved Data Stream Algorithm for Clustering.

Sang-Sub Kim, Hee-Kap Ahn

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Minimum Convex Container of Two Convex Polytopes under Translations.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin

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

2013

Realistic roofs over a rectilinear polygon.

Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron

Comput. Geom., 2013

Bundling Three Convex Polygons to Minimize Area or Perimeter.

Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Group Nearest Neighbor Queries in the <i>L</i> ₁ Plane.

Hee-Kap Ahn, Sang Won Bae, Wanbin Son

Proceedings of the Theory and Applications of Models of Computation, 2013

2012

Reachability by paths of bounded curvature in a convex polygon.

Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron

Comput. Geom., 2012

Aligning Two Convex Figures to Minimize Area or Perimeter.

Hee-Kap Ahn, Otfried Cheong

Algorithmica, 2012

A Generalization of the Convex Kakeya Problem.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Computing k-center over Streaming Data for Small k.

Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son

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

Rectilinear Covering for Imprecise Input Points - (Extended Abstract).

Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa

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

Overlap of Convex Polytopes under Rigid Motion.

Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

A fast nearest neighbor search algorithm by nonlinear embedding.

Yoonho Hwang, Bohyung Han, Hee-Kap Ahn

Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011

Covering a Point Set by Two Disjoint Rectangles.

Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn

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

Spatial skyline queries: exact and approximation algorithms.

Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn, Seung-won Hwang

GeoInformatica, 2011

Empty pseudo-triangles in point sets.

Hee-Kap Ahn, Sang Won Bae, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann

Discret. Appl. Math., 2011

Covering points by disjoint boxes with outliers.

Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son

Comput. Geom., 2011

MSSQ: Manhattan Spatial Skyline Queries.

Wanbin Son, Seung-won Hwang, Hee-Kap Ahn

Proceedings of the Advances in Spatial and Temporal Databases, 2011

Convergent Bounds on the Euclidean Distance.

Yoonho Hwang, Hee-Kap Ahn

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

Covering and Piercing Disks with Two Centers.

Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron

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

Generating Realistic Roofs over a Rectilinear Polygon.

Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron

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

2010

Computing the Discrete Fréchet Distance with Imprecise Input.

Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron

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

Maximum Overlap of Convex Polytopes under Translation.

Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher

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

Adaptive Algorithms for Planar Convex Hull Problems.

Hee-Kap Ahn, Yoshio Okamoto

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

Computing minimum-area rectilinear convex hull and L-shape.

Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa

Comput. Geom., 2009

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

Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin

Comput. Geom., 2009

Spatial Skyline Queries: An Efficient Geometric Algorithm.

Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang

Proceedings of the Advances in Spatial and Temporal Databases, 2009

Square and Rectangle Covering with Outliers.

Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

Optimal Empty Pseudo-Triangles in a Point Set.

Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

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

Hee-Kap Ahn, Peter Brass, Chan-Su Shin

Comput. Geom., 2008

Covering a Simple Polygon by Monotone Directions.

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin

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

Covering a Point Set by Two Disjoint Rectangles.

Hee-Kap Ahn, Sang Won Bae

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

2007

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.

Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa

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

Dilation-Optimal Edge Deletion in Polygonal Cycles.

Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang

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

Aperture-angle and Hausdorff-approximation of convex figures.

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson

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

Constructing Optimal Highways.

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff

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.

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

Comput. Geom., 2006

2005

Stacking and Bundling Two Convex Polygons.

Hee-Kap Ahn, Otfried Cheong

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

Casting an Object with a Core.

Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa

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

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

Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron

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

2004

Competitive facility location: the Voronoi game.

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

Theor. Comput. Sci., 2004

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

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron

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

2003

Building bridges between convex region.

Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin

Comput. Geom., 2003

2002

Casting a Polyhedron with Directional Uncertainty.

Hee-Kap Ahn, Otfried Cheong, René van Oostrum

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

2001

Competitive Facility Location along a Highway.

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

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

The reflex-free hull.

Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink

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

2000

Reachability by paths of bounded curvature in convex polygons.

Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Flipping your Lid.

Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Casting with skewed ejection direction revisited.

Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong

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

1998

Casting with Skewed Ejection Direction.

Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong

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

1997

Separating an Object from its Cast.

Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997