7 research outputs found
Fast exact and approximate geodesics on meshes
The computation of geodesic paths and distances on triangle meshes is a common operation in many computer graphics applications. We present several practical algorithms for computing such geodesics from a source point to one or all other points efficiently. First, we describe an implementation of the exact "single source, all destination" algorithm presented by Mitchell, Mount, and Papadimitriou (MMP). We show that the algorithm runs much faster in practice than suggested by worst case analysis. Next, we extend the algorithm with a merging operation to obtain computationally efficient and accurate approximations with bounded error. Finally, to compute the shortest path between two given points, we use a lower-bound property of our approximate geodesic algorithm to efficiently prune the frontier of the MMP algorithm. thereby obtaining an exact solution even more quickly.Engineering and Applied Science
Arc-length compression
We introduce a novel method for lossy compression of the two-dimensional curves based on the arc-length parameterization. Weshowthattheproposedmethodhasa numberofadvantages:itisprogressive,convergesuniformly, andrequiresthenumberofthebitsproportionaltothetotalarc-length ofthecurve. Themethodisappliedto thecompressionofthe handwritten lettersandscanlinesofthenaturalimages
Recommended from our members
Arc-Length Compression
We introduce a novel method for lossy compression of the two-dimensional curves based on the arc-length parameterization. We show that the proposed method has a number of advantages: it is progressive, converges uniformly, and requires the number of the bits proportional to the total arc-length of the curve. The method is applied to the compression of the handwritten letters and scanlines of the natural images.Engineering and Applied Science