Maximal Balls of Linearly Separable Sets

DOI10.1142/S0218195994000033MaRDI QIDQ4292526zbMATH OpenOpenAlexFDO

Authors Vijay Srinivasan, Lee R. Nackman

Publication date 8 June 1994

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195994000033

zbMATH Keywords

computational geometrytriangulationsimplicial decompositionbisectorsseparable setsmaximal spheresmaximal balls

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Maximal and minimal balls
• Bisectors of linearly separable sets
• Margin maximization in spherical separation
• Computing circular separability
• Algorithms for weak and wide separation of sets

Cited in

(3)

• Maximum scattered linear sets and complete caps in Galois spaces
• Point placement algorithms for Delaunay triangulation of polygonal domains
• Maximal and minimal balls

This page was built for publication: Maximal Balls of Linearly Separable Sets

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