On approximation of planar one-dimensional continua
From MaRDI portal
Recommendations
Cited in
(14)- On piecewise linear approximation of planar Jordan curves
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
- Numerical curve length calculation using polynomial interpolation
- On one-dimensional continua uniformly approximating planar sets
- Monotonic sampling of a continuous closed curve with respect to its Gauss digitization: application to length estimation
- Dynamic minimum length polygon
- Non-local estimators: a new class of multigrid convergent length estimators
- On finding a shortest isothetic path and its monotonicity inside a digital object
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Curvature estimation along noisy digital contours by approximate global optimization
- Digital curve length calculation by using B-spline
This page was built for publication: On approximation of planar one-dimensional continua
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225237)
