Direct dominance of points

DOI10.1080/00207168608803518MaRDI QIDQ3802650zbMATH OpenOpenAlexFDO

Authors 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

computational geometrydirect dominancesdistribution of points in \({\mathbb{R}}^ n\)dominance pairsgeometrical algorithmstransitive relations of geometrical objectsVLSI

Mathematics Subject Classification ID

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

Recommendations

• Computing dominances in E^ n
• scientific article; zbMATH DE number 905031
• A general approach to dominance in the plane
• Fast algorithms for direct enclosures and direct dominances
• scientific article; zbMATH DE number 1057777

Cites work

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

Cited in

(9)

• The expected size of some graphs in computational geometry
• Computing dominances in E^ n
• scientific article; zbMATH DE number 3848202 (Why is no real title available?)
• Fast algorithms for direct enclosures and direct dominances
• A general approach to dominance in the plane
• Maximal empty boxes amidst random points
• An efficient algorithm for computing the maximum empty rectangle in three dimensions
• Dominance in the presence of obstacles
• Some problems in distributed computational geometry

This page was built for publication: Direct dominance of points

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