Topological relations between separating circles
From MaRDI portal
(Redirected from Publication:387873)
Recommendations
Cites work
- An elementary algorithm for digital arc segmentation
- An optimal convex hull algorithm in any fixed dimension
- Analytical Description of Digital Circles
- Applications of random sampling in computational geometry. II
- Computing circular separability
- Digital Disks
- Discrete geometry for computer imagery. 15th IAPR international conference, DGCI 2009, Montréal, Canada, September 30 -- October 2, 2009. Proceedings
- Discrete geometry for computer imagery. 16th IAPR international conference, DGCI 2011, Nancy, France, April 6--8, 2011. Proceedings
- Distance between separating circles and points
- Ellipse detection with elemental subsets
- Measure of circularity for parts of digital boundaries and its fast computation
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- On the recognition of digital circles in linear time
- Power Diagrams: Properties, Algorithms and Applications
- The linear time recognition of digital arcs
- Voronoi diagrams and arrangements
Cited in
(7)- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- Distance between separating circles and points
- scientific article; zbMATH DE number 4130724 (Why is no real title available?)
- Separation of continua by circles
- Circular separability of polygons
- Computing circular separability
- scientific article; zbMATH DE number 4062596 (Why is no real title available?)
This page was built for publication: Topological relations between separating circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387873)
