Geometric Applications of Posets
From MaRDI portal
Publication:5096956
DOI10.1007/3-540-63307-3_78zbMath1497.68537OpenAlexW1526162339MaRDI QIDQ5096956
Publication date: 19 August 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63307-3_78
Partial orders, general (06A06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- The power of geometric duality revisited
- Fractional cascading. I: A data structuring technique
- Decomposable searching problems
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest \(k\)-enclosing circle and related problems
- Time bounds for selection
- On geometric optimization with few violated constraints
- Algorithms for proximity problems in higher dimensions
- A simple algorithm for enumerating longest distances in the plane
- Generalized Selection and Ranking: Sorted Matrices
- ENUMERATING INTERDISTANCES IN SPACE
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
- SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
This page was built for publication: Geometric Applications of Posets
