Geometric containment and vector dominance
From MaRDI portal
Publication:1093914
DOI10.1016/0304-3975(87)90074-0zbMath0629.52021OpenAlexW2086154570MaRDI QIDQ1093914
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90074-0
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Discrete mathematics in relation to computer science (68R99)
Cites Work
- On the equivalence of some rectangle problems
- The Ultimate Planar Convex Hull Algorithm?
- An improved algorithm for the rectangle enclosure problem
- On Finding the Maxima of a Set of Vectors
- Convex hulls of finite sets of points in two and three dimensions
- On the Average Number of Maxima in a Set of Vectors and Applications
- An Algorithm for Convex Polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item