Points and triangles in the plane and halving planes in space

DOI10.1007/BF02574700MaRDI QIDQ1176320zbMATH OpenOpenAlexFDO

Authors Boris Aronov, Bernard Chazelle, Leonidas Guibas, Micha Sharir, Rephael Wenger, Herbert Edelsbrunner

Publication date 25 June 1992

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

Full work available at URL https://eudml.org/doc/131169

zbMATH Keywords

pointstriangleshalving planes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the number of halving planes
• Counting triangle crossings and halving planes
• Halving point sets
• Improved bounds for intersecting triangles and halving planes
• Dense point sets with many halving lines

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• A generalization of Caratheodory's theorem
• Applications of random sampling in computational geometry. II
• On the number of halving planes
• On the number of k-subsets of a set of n points in the plane
• On the number of line separations of a finite set in the plane
• Power Diagrams: Properties, Algorithms and Applications
• Selecting Heavily Covered Points
• The number of small semispaces of a finite set of points in the plane
• The number of triangles covering the center of an \(n\)-set

Cited in

(26)

• The number of extreme triples of a planar point set
• An upper bound on the number of planar K-sets
• Eppstein's bound on intersecting triangles revisited
• Dynamic half-space range reporting and its applications
• Algorithms for ham-sandwich cuts
• scientific article; zbMATH DE number 5122066 (Why is no real title available?)
• Upper bounds for stabbing simplices by a line
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• k-sets in four dimensions
• Crossing-free segments and triangles in point configurations
• On levels in arrangements of surfaces in three dimensions
• Selection lemmas for various geometric objects
• Hitting and Piercing Rectangles Induced by a Point Set
• Cutting dense point sets in half
• Improved bounds for intersecting triangles and halving planes
• Counting triangle crossings and halving planes
• On the expected number of k-sets
• Extremal problems for geometric hypergraphs
• On geometric optimization with few violated constraints
• A survey of mass partitions
• Median hyperplanes in normed spaces -- a survey
• A point in many triangles
• Point Selections and Weak ε-Nets for Convex Hulls
• Berge's theorem, fractional Helly, and art galleries
• \(k\)-sets and random hulls
• Overlap properties of geometric expanders

This page was built for publication: Points and triangles in the plane and halving planes in space

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