Efficient real-time and parallel algorithm for connected orthogonal convex hulls on large point sets

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Numerical Algorithms

• Publication date

  2025-10-25

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1007/s11075-025-02229-z
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A fast and efficient algorithm for determining the connected orthogonal convex hulls

  2022cited by this paper
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set

  2021cited by this paper
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects

  2020cited by this paper
• QuickhullDisk: A faster convex hull algorithm for disks

  2019cited by this paper
• Regular switching components

  2019cited by this paper
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations

  2017cited by this paper
• Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors

  2016cited by this paper
• Quicker than Quickhull

  2015cited by this paper
• On the 𝒪β of a planar point set

  2015cited by this paper
• MSSQ: Manhattan Spatial Skyline Queries

  2011cited by this paper
• A new family of metrics for compact, convex (fuzzy) sets based on a generalized concept of mid and spread

  2009cited by this paper
• Preprocessing Steiner problems from VLSI layout

  2002cited by this paper
• Fundamentals of Restricted-Orientation Convexity

  1996cited by this paper
• Image Processing, Analysis and Machine Vision

  1993cited by this paper
• Computational Geometry

  1985cited by this paper
• On the Definition and Computation of Rectlinear Convex Hulls

  1984cited by this paper

• No citing papers are available for this paper.