3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES

DOI10.1142/S0218195999000170zbMath0949.68151MaRDI QIDQ4949990

Eyal Assa, Matthew J. Katz

Publication date: 5 December 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

\(p\)-piercing problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A simple linear algorithm for computing rectilinear 3-centers ⋮ ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS

Cites Work

• Intersection properties of boxes in \(R^ n\).
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• On the Complexity of Some Common Geometric Location Problems
• Generalized Selection and Ranking: Sorted Matrices
• Finding kth paths and p-centers by generating and searching good data structures

This page was built for publication: 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES