Separation problems and circular arc systems

DOI10.1007/3-540-53832-1_47MaRDI QIDQ4028120zbMATH OpenFDO

Authors Paul Fischer, Hans Ulrich Simon

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_47

zbMATH Keywords

circular arc systemcomputational learningintersection graphsnumber of stagesseparating planar subdivisionseparating polygonstransversalvisibility

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Separation of continua by circles
• Circular separability of polygons
• The Kakeya problem for circular arcs
• scientific article; zbMATH DE number 4062596
• scientific article; zbMATH DE number 4130724
• Separation by convex pseudo-circles (extended abstract)
• Separation by convex pseudo-circles
• Separation via polyhedral conic functions
• Computing circular separability
• Rectangular Seifert circles and arcs system

Cited in

(8)

• Computing circular separability
• Minimum polygonal separation
• On the shortest separating cycle
• scientific article; zbMATH DE number 4062596 (Why is no real title available?)
• Circular separability of polygons
• Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
• Separation of continua by circles
• Obstacle numbers of graphs

This page was built for publication: Separation problems and circular arc systems

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