{"paper":{"title":"Efficient Range Reporting of Convex Hull","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli, Nadeem Moidu","submitted_at":"2013-07-22T07:49:57Z","abstract_excerpt":"We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the minimum convex polygon formed by $S$. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in $P$ that also fall with in an orthogonal range$[x_{lt},x_{rt}]\\times{}[y_b, y_t]$. We propose a $O(n \\log^{2} n) $ space data structure that can support reporting points on a convex hull inside a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5612","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}