Direct dominance of points

DOI10.1080/00207168608803518zbMath0655.68091OpenAlexW2087470688MaRDI QIDQ3802650

Rolf Klein

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803518

zbMATH Keywords

VLSIcomputational geometrygeometrical algorithmsdirect dominancesdistribution of points in \({\mathbb{R}}^ n\)dominance pairstransitive relations of geometrical objects

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Other problems of combinatorial convexity (52A37) Discrete mathematics in relation to computer science (68R99)

Related Items

The expected size of some graphs in computational geometry, An efficient algorithm for computing the maximum empty rectangle in three dimensions, Some problems in distributed computational geometry, Maximal Empty Boxes Amidst Random Points

Cites Work

• A note on finding convex hulls via maximal vectors
• On the equivalence of some rectangle problems
• An improved algorithm for the rectangle enclosure problem
• On the Average Number of Maxima in a Set of Vectors and Applications