David Eppstein - Publications

Conference submissions

• Instance-optimal computational geometry made easier and sensitive to sortedness.
  D. Eppstein, M. T. Goodrich, A. M. Illickan, and C. A. To.
  arXiv:2508.20489.
  Proc. 37th Canadian Conference on Computational Geometry, 2025, pp. 53–61.
  

  We define a notion of structural entropy of point sets under which a set has low entropy when it can be covered by few disjoint triangles that are either entirely under the hull of the input or presorted, and show that we can find the hull in time sensitive to this entropy. Generalizations of the same technique apply to geometric maxima, lower envelopes, and visibility polygons.

• Visualizing treewidth.
  A. Chiu, T. Depian, D. Eppstein, M. T. Goodrich, and M. Nöllenburg.
  arXiv:2508.19935.
  33rd International Symposium on Graph Drawing and Network Visualization, to appear.
  

• Bicriteria polygon aggregation with arbitrary shapes.
  L. Blank, D. Eppstein, J.-H. Haunert, H. Haverkort, B. Kolbe, P. Mayer, P. Mutzel, A. Naumann, and J. Sauer.
  arXiv:2507.11212.
  

Conferences – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.