On the public citation graph
Computing circular separability
0 signed · 86 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01008046openalex-snapshot
Computing largest empty circles with location constraints
inferredcites →https://doi.org/10.1007/bfb0012765openalex-snapshot
Fast detection of polyhedral intersections
inferredcites →https://doi.org/10.1016/0020-0190(85)90107-3openalex-snapshot
Finding extreme points in three dimensions and solving the post-office problem in the plane
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1016/0304-3975(80)90031-6openalex-snapshot
The complexity of linear programming
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1109/tpami.1986.4767821openalex-snapshot
Separating Point Sets by Circles, and the Recognition of Digital Disks
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/323233.323266openalex-snapshot
Voronoi diagrams and arrangements
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/800057.808673openalex-snapshot
Digital disks and a digital compactness measure
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_5openalex-snapshot
The Largest Empty Annulus Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-90606-0_20openalex-snapshot
Integer Linear Programming Models for Variations of the Discrete Semi-obnoxious Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_13openalex-snapshot
Separability of Imprecise Points
inferred← citeshttps://doi.org/10.1007/978-3-319-21407-8_19openalex-snapshot
Smallest Maximum-Weight Circle for Weighted Points in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-26145-4_8openalex-snapshot
Optimal Consensus Set for nD Fixed Width Annulus Fitting
inferred← citeshttps://doi.org/10.1007/978-3-642-04397-0_4openalex-snapshot
On Three Constrained Versions of the Digital Circular Arc Recognition Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_20openalex-snapshot
Analytical Description of Digital Circles
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_29openalex-snapshot
Distance between Separating Circles and Points
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_30openalex-snapshot
Optimal Consensus Set for Annulus Fitting
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_35openalex-snapshot
Kinetic Red-Blue Minimum Separating Circle
inferred← citeshttps://doi.org/10.1007/978-3-642-34732-0_6openalex-snapshot
A Probabilistic Measure of Circularity
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_21openalex-snapshot
O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_22openalex-snapshot
Efficient Robust Digital Annulus Fitting with Bounded Error
inferred← citeshttps://doi.org/10.1007/978-94-007-4174-4_8openalex-snapshot
Separability and Tight Enclosure of Point Sets
inferred← citeshttps://doi.org/10.1007/bf02187916openalex-snapshot
On the complexity of polyhedral separability
inferred← citeshttps://doi.org/10.1007/s004530010078openalex-snapshot
Circular Separability of Polygons
inferred← citeshttps://doi.org/10.1007/s10851-016-0643-yopenalex-snapshot
The Number of Different Digital N-Discs
inferred← citeshttps://doi.org/10.1007/s10898-022-01238-9openalex-snapshot
Separating bichromatic point sets in the plane by restricted orientation convex hulls
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90057-uopenalex-snapshot
Algorithms for weak and wide separation of sets
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90049-1openalex-snapshot
Minimum polygonal separation
inferred← citeshttps://doi.org/10.1016/b978-0-444-70467-2.50008-4openalex-snapshot
Circular Separability of Planar Point Sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.09.009openalex-snapshot
Localized geometric query problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.008openalex-snapshot
Separating bichromatic point sets by L-shapes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.10.001openalex-snapshot
Separability of imprecise points
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.009openalex-snapshot
Minimizing the error of linear separators on linearly inseparable data
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.039openalex-snapshot
Topological relations between separating circles
inferred← citeshttps://doi.org/10.1016/j.dam.2013.06.001openalex-snapshot
Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.012openalex-snapshot
Variations of largest rectangle recognition amidst a bichromatic point set
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.002openalex-snapshot
Identification of points using disks
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.048openalex-snapshot
Locating an obnoxious plane
inferred← citeshttps://doi.org/10.1016/j.gmod.2011.06.005openalex-snapshot
Generalized Perpendicular Bisector and exhaustive discrete circle recognition
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106245openalex-snapshot
Geometric separability using orthogonal objects
inferred← citeshttps://doi.org/10.1016/j.measurement.2013.08.007openalex-snapshot
Framework for characterizing circularity based on a probability distribution
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.06.014openalex-snapshot
Measure of circularity for parts of digital boundaries and its fast computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.036openalex-snapshot
Dynamic minimum bichromatic separating circle
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114778openalex-snapshot
Finding the Largest Separating Rectangle Among Two Point Sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115593openalex-snapshot
On computing the maximum-volume bichromatic separating box
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00230-4openalex-snapshot
Separating objects in the plane by wedges and strips
inferred← citeshttps://doi.org/10.1109/34.387505openalex-snapshot
Digitized circular arcs: characterization and parameter estimation
inferred← citeshttps://doi.org/10.1109/csicc49403.2020.9050086openalex-snapshot
Maximum Separability by L-shapes
inferred← citeshttps://doi.org/10.1109/cvpr.1988.196298openalex-snapshot
Point symmetry of convex digital regions
inferred← citeshttps://doi.org/10.1109/isvd.2006.43openalex-snapshot
k-set polytopes and order-k Delaunay diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2010.14openalex-snapshot
Minimum Separating Circle for Bichromatic Points in the Plane
inferred← citeshttps://doi.org/10.1109/isvd.2011.21openalex-snapshot
Minimizing the Number of Separating Circles for Two Sets of Points in the Plane
inferred← citeshttps://doi.org/10.1109/tpami.1986.4767821openalex-snapshot
Separating Point Sets by Circles, and the Recognition of Digital Disks
inferred← citeshttps://doi.org/10.1109/tpami.2006.127openalex-snapshot
Robust and accurate vectorization of line drawings
inferred← citeshttps://doi.org/10.1142/s0218195900000036openalex-snapshot
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
inferred← citeshttps://doi.org/10.1142/s0218195903001207openalex-snapshot
THE LARGEST EMPTY ANNULUS PROBLEM
inferred← citeshttps://doi.org/10.1142/s0218195906001902openalex-snapshot
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
inferred← citeshttps://doi.org/10.1142/s021819591360008xopenalex-snapshot
FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT
inferred← citeshttps://doi.org/10.1145/1150334.1150338openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.24200/sci.2022.59206.6108openalex-snapshot
Separating Bichromatic Polylines by Fixed-angle Minimal Triangles
inferred← citeshttps://doi.org/10.31127/tuje.1481901openalex-snapshot
Geometric objects covering all red points and minimum blue points
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6266openalex-snapshot
Circle separability queries in logarithmic time
inferred← citeshttps://doi.org/10.48550/arxiv.1706.03268openalex-snapshot
Maximum Area Rectangle Separating Red and Blue Points
inferred← citeshttps://doi.org/10.48550/arxiv.1809.00116openalex-snapshot
On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12227openalex-snapshot
Geometric Separability using Orthogonal Objects
inferred← citeshttps://doi.org/10.48550/arxiv.2012.12846openalex-snapshot
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box
inferred← citeshttps://doi.org/10.5255/ukda-sn-858244openalex-snapshot
Centre for Economic Performance Survey of Self-Employment May 2022
inferred← citeshttps://doi.org/10.5555/982792.982897openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.70675/931d8086z793fz43a9z9751zad9618699668openalex-snapshot
Algorithmes d'extraction de modèles géométriques discrets pour la représentation robuste des formes
inferred← citeshttps://doi.org/10.70675/a1b073f8z2073z466czb726z1462c90756a8openalex-snapshot
Couverture de sommets sous contraintes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.