scientific article; zbMATH DE number 4062596

MaRDI QIDQ3796753zbMATH OpenFDO

Authors Binay Bhattacharya

Publication date 1988

zbMATH Keywords

circular separabilitycomputational geometryplanar point sets

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computing circular separability
• Circular separability of polygons
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• Topological relations between separating circles
• scientific article; zbMATH DE number 139795

Cited in

(17)

• Computing circular separability
• Point sets with many unit circles
• Separability by two lines and by nearly straight polygonal chains
• Open caps and cups in planar point sets
• Virtual points and separating sets in spherical circle planes
• Distance between separating circles and points
• Topological relations between separating circles
• scientific article; zbMATH DE number 139795 (Why is no real title available?)
• scientific article; zbMATH DE number 1537556 (Why is no real title available?)
• Separation by convex pseudo-circles (extended abstract)
• Separability and Tight Enclosure of Point Sets
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• A removal lemma for linear configurations in subsets of the circle
• Separating objects in the plane by wedges and strips
• Circular separability of polygons
• Algorithms for weak and wide separation of sets
• Separation of continua by circles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796753)