A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
DOI10.1016/j.tcs.2020.09.043zbMath1464.68414OpenAlexW3092768451MaRDI QIDQ2210520
Mousumi Dutt, Apurba Sarkar, Arindam Biswas, Md A. A. A. Aman
Publication date: 6 November 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.043
convex hullrelative convex hullisothetic coversorthogonal convex hullrelative orthogonal convex hull
Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geodesic methods in quantitative image analysis
- On-line construction of the convex hull of a simple polyline
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- On piecewise linear approximation of planar Jordan curves
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Relative Convex Hull Determination from Convex Hulls in the Plane
- Dynamic Minimum Length Polygon
- Euclidean Shortest Paths
- Relative Convex Hulls in Semi-dynamic Subdivisions
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- A Theory of Nonuniformly Digitized Binary Pictures
- An optimal real-time algorithm for planar convex hulls
- Minimum-Perimeter Polygons of Digitized Silhouettes
This page was built for publication: A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects