Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10851-013-0444-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094272786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical Description of Digital Circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry, morphology, and computational imaging. 11th international workshop on theoretical foundations of computer vision, Dagstuhl Castle, Germany, April 7--12, 2002. Revised papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational modeling of objects represented in images. Second international symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5--7, 2010. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic interpretation and construction of a digital circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Polygonal Covers of Digital Discs – Some Theories and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for incremental digital display of circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital planarity -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Randomized Algorithm for Detecting Circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary algorithm for digital arc segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear time recognition of digital arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular arc extraction by direct clustering in a 3D Hough parameter space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust fitting of circle arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure for Circularity of Digital Figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-step circle detection algorithm from the intersecting chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding circles by an array of accumulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining digital circularity using integer intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for drawing ellipses or hyperbolae with a digital plotter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Perpendicular Bisector and Circumcenter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure of circularity for parts of digital boundaries and its fast computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of digital circles in linear time / rank
 
Normal rank

Latest revision as of 18:36, 8 July 2024

scientific article
Language Label Description Also known as
English
Fast circular arc segmentation based on approximate circularity and cuboid graph
scientific article

    Statements

    Fast circular arc segmentation based on approximate circularity and cuboid graph (English)
    0 references
    0 references
    0 references
    11 July 2014
    0 references
    arc segmentation
    0 references
    circle detection
    0 references
    digital circularity
    0 references
    digital geometry
    0 references
    Hough transform
    0 references
    0 references
    0 references

    Identifiers