Hyeon-Suk Na

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The probabilistic complexity of the Voronoi diagram of points on a polyhedron Proceedings of the eighteenth annual symposium on Computational geometry	2018-11-23	Paper
The number of lines tangent to arbitrary convex polyhedra in 3D Proceedings of the twentieth annual symposium on Computational geometry	2017-09-29	Paper
Local event boundary detection with unreliable sensors: analysis of the majority vote scheme Theoretical Computer Science	2015-12-08	Paper
Local event boundary detection with unreliable sensors: analysis of the majority vote scheme Algorithmic Aspects in Information and Management	2015-05-20	Paper
Approximate shortest paths in anisotropic regions	2014-12-18	Paper
THE ALIGNED K-CENTER PROBLEM International Journal of Computational Geometry & Applications	2011-05-11	Paper
Farthest-polygon Voronoi diagrams Computational Geometry	2011-03-25	Paper
Querying Approximate Shortest Paths in Anisotropic Regions SIAM Journal on Computing	2010-11-04	Paper
Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes Information Processing Letters	2010-09-02	Paper
GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS International Journal of Computational Geometry & Applications	2010-07-27	Paper
Covering a simple polygon by monotone directions Computational Geometry	2010-03-11	Paper
Algorithms - ESA 2003 Lecture Notes in Computer Science	2010-03-03	Paper
Approximate Shortest Paths in Anisotropic Regions SIAM Journal on Computing	2009-06-22	Paper
CONSTRUCTING OPTIMAL HIGHWAYS International Journal of Foundations of Computer Science	2009-04-14	Paper
Querying approximate shortest paths in anisotropic regions Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07	2009-02-12	Paper
On the minimum total length of interval systems expressing all intervals, and range-restricted queries Computational Geometry	2009-02-12	Paper
Covering a Simple Polygon by Monotone Directions Algorithms and Computation	2009-01-29	Paper
Escaping offline searchers and isoperimetric theorems Computational Geometry	2008-11-19	Paper
Farthest-Polygon Voronoi Diagrams Algorithms – ESA 2007	2008-09-25	Paper
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem Algorithms and Computation	2008-05-27	Paper
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra SIAM Journal on Computing	2008-04-22	Paper
A note on maximally repeated sub-patterns of a point set Discrete Mathematics	2006-09-14	Paper
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets Computational Geometry	2006-04-28	Paper
Computing and Combinatorics Lecture Notes in Computer Science	2005-06-15	Paper
Geometric permutations of disjoint unit spheres Computational Geometry	2005-05-12	Paper
The Expected Number of 3D Visibility Events Is Linear SIAM Journal on Computing	2004-01-08	Paper
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes Computational Geometry	2003-05-27	Paper
Voronoi diagrams on the sphere Computational Geometry	2003-03-10	Paper

Research outcomes over time

This page was built for person: Hyeon-Suk Na