Achieves O(m) preprocessing time and O(log e(G)) sorting time for sorting under partial information using a new unified bound heaps data structure.
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.Algorithmica, 61(3):674–693, November 2011
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
Achieves O(m) preprocessing time and O(log e(G)) sorting time for sorting under partial information using a new unified bound heaps data structure.