Cutting dense point sets in half
From MaRDI portal
Publication:1355189
DOI10.1007/PL00009291zbMath0870.68153OpenAlexW2050230854WikidataQ54309228 ScholiaQ54309228MaRDI QIDQ1355189
Pavel Valtr, Herbert Edelsbrunner, Ermo Welzl
Publication date: 19 May 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009291
Related Items
Approximate center points in dense point sets ⋮ A survey of mass partitions ⋮ An effective solution to convex 1-body \(N\)-representability ⋮ Dense point sets with many halving lines ⋮ Polynomial-reproducing spline spaces from fine zonotopal tilings ⋮ CENTROID TRIANGULATIONS FROM k-SETS ⋮ Faster balanced clusterings in high dimension ⋮ Separation by convex pseudo-circles ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ Bivariate B-splines from convex configurations ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations. ⋮ On the number of corner cuts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Halfspace range search: An algorithmic application of k-sets
- On the intersection of edges of a geometric graph by straight lines
- Points and triangles in the plane and halving planes in space
- An upper bound on the number of planar \(K\)-sets
- Convex independent sets and 7-holes in restricted planar point sets
- The colored Tverberg's problem and complexes of injective functions
- Improved bounds for intersecting triangles and halving planes
- Counting triangle crossings and halving planes
- On the number of line separations of a finite set in the plane
- On the number of halving planes
- Geometric methods in the study of irregularities of distribution
- The maximum size of a convex polygon in a restricted set of points in the plane
- The Intrinsic Spread of a Configuration in R d
- On k-Hulls and Related Problems
- Constructing Belts in Two-Dimensional Arrangements with Applications
