Geometric applications of posets

DOI10.1016/S0925-7721(98)00031-5MaRDI QIDQ1276942zbMATH OpenFDO

Authors 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)

Recommendations

• Geometric applications of posets
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
• Computing farthest neighbors on a convex polytope.
• Farthest neighbors and center points in the presence of rectangular obstacles

Cites work

• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• A simple algorithm for enumerating longest distances in the plane
• Algorithms for proximity problems in higher dimensions
• Computing the smallest \(k\)-enclosing circle and related problems
• Decomposable searching problems
• ENUMERATING INTERDISTANCES IN SPACE
• Efficient randomized algorithms for some geometric optimization problems
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
• Fractional cascading. I: A data structuring technique
• Generalized Selection and Ranking: Sorted Matrices
• Iterated nearest neighbors and finding minimal polytopes
• Offset-polygon annulus placement problems
• On geometric optimization with few violated constraints
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• The power of geometric duality revisited
• Time bounds for selection

Cited in

(1)

• Geometric applications of posets

This page was built for publication: Geometric applications of posets

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