Eunhui Park

According to our database, Eunhui Park authored at least 7 papers between 2008 and 2015.

Collaborative distances:

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

2015

Approximate Geometric MST Range Queries.

Sunil Arya, David M. Mount, Eunhui Park

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

2013

Dynamic Data Structures for Geometric Search and Retrieval.

Eunhui Park

PhD thesis, 2013

Output-sensitive well-separated pair decompositions for dynamic point sets.

Eunhui Park, David M. Mount

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

A Self-adjusting Data Structure for Multidimensional Point Sets.

Eunhui Park, David M. Mount

Proceedings of the Algorithms - ESA 2012, 2012

2010

A dynamic data structure for approximate range searching.

David M. Mount, Eunhui Park

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Maintaining Nets and Net Trees under Incremental Motion.

Minkyoung Cho, David M. Mount, Eunhui Park

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph.

Eunhui Park, Kunsoo Park

Fundam. Informaticae, 2008