HackerPapers

arXiv:0903.1817cs.CG

Reconstructing Curves from Points and Tangents

Leslie Greengard, Chris Stucchio

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show that if curves are separated from each other by a distance D, then the sampling rate need only be O(sqrt(D)) for error-free reconstruction. For the case of point data alone, O(D) sampling is required.

arXiv comments
22 pages, 11 figures
Journal reference
DOI
Subjects
cs.CGComputational Geometry

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Apr 2013 to Apr 2013.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Numba is great for numerical expressions, but I'd be surprised if it works for trickier bits. For example, consider the problem here: http://arxiv.org/abs/0903.1817 Ultimately I needed to run a math formula on some surfels and connect an edge in a graph if the formula came out…

      yummyfajitasView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.