Separation by convex pseudo-circles

DOI10.1007/S00454-020-00190-3zbMath1466.52019OpenAlexW3014153049MaRDI QIDQ2022622

Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner

Publication date: 29 April 2021

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-020-00190-3

zbMATH Keywords

combinatorics\(k\)-setpseudo-circlecentroid triangulation

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Circle packings and discrete conformal geometry (52C26)

Related Items (1)

Algebraic \(k\)-sets and generally neighborly embeddings

Cites Work

• Unnamed Item
• Properties of \(n\)-dimensional triangulations
• On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs
• Cutting dense point sets in half
• Improved bounds for planar \(k\)-sets and related problems
• In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
• Bivariate B-splines from convex pseudo-circle configurations
• Poisson-Delaunay mosaics of order \(k\)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Topological Hypergraphs
• Voronoi Diagrams and Delaunay Triangulations
• Density of range capturing hypergraphs
• A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
• Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
• Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams
• On s -intersecting curves and related problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Separation by Convex Pseudo-Circles
• CENTROID TRIANGULATIONS FROM k-SETS
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Point sets with many \(k\)-sets

This page was built for publication: Separation by convex pseudo-circles