584 search results - page 2 / 117 » On the Number of Halving Planes |
CPC
2011
13 years 2 months ago
2011
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a ...
IPL
2002
13 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
JCT
2006
13 years 7 months ago
2006
One of Erdos' favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when t...
ISMB
2007
13 years 9 months ago
2007
Autopolyploidization and allopolyploidization events multiply the number of chromosomes and genomic content. Genome rearrangement phylogenetics requires that all genomes analyzed ...