A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
DOI10.1016/j.amc.2020.125889OpenAlexW3120694851MaRDI QIDQ2242054
Nguyen Thi Le, Phong Thi Thu Huyen, Phan Thanh An
Publication date: 9 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125889
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (1)
Uses Software
Cites Work
- Reconstructing orthogonal polyhedra from putative vertex sets
- On the definition and computation of rectilinear convex hulls
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- On the X-Y convex hull of a set of X-Y polygons
- Some performance tests of convex hull algorithms
- Scanline algorithms on a grid
- A fast convex hull algorithm
- A Krasnosel'skij theorem for staircase paths in orthogonal polygons
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- QuickhullDisk: a faster convex hull algorithm for disks
- Maximum rectilinear convex subsets
- An efficient algorithm for determining the convex hull of a finite planar set
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Preprocessing Steiner problems from VLSI layout
- Metric spaces, convexity and nonpositive curvature
This page was built for publication: A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
