Geometric applications of posets

DOI10.1016/S0925-7721(98)00031-5zbMath0913.68200MaRDI QIDQ1276942

Michael Segal, Klara Kedem

Publication date: 2 February 1999

Published in: Computational Geometry (Search for Journal in Brave)

Mathematics Subject Classification ID

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
• Offset-polygon annulus placement problems
• Iterated nearest neighbors and finding minimal polytopes
• Computing the smallest \(k\)-enclosing circle and related problems
• Time bounds for selection
• Efficient randomized algorithms for some geometric optimization problems
• 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
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

This page was built for publication: Geometric applications of posets