Computing rectangle enclosures

DOI10.1016/0925-7721(93)90012-UzbMath0771.68061MaRDI QIDQ2365809

Athanasios K. Tsakalidis, D. Sofotassios, V. Bistiolas

Publication date: 29 June 1993

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

zbMATH Keywords

Range and Priority search treesrectangle enclosure problemthree layered data structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Some Results for Elementary Operations ⋮ Towards using computational methods for real-time negotiations in electronic commerce

Cites Work

• Unnamed Item
• A log log n data structure for three-sided range queries
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Updating a balanced search tree in 0(1) rotations
• Priority Search Trees
• New Data Structures for Orthogonal Range Queries
• Adding range restriction capability to dynamic data structures
• Fast algorithms for direct enclosures and direct dominances
• An improved algorithm for the rectangle enclosure problem

This page was built for publication: Computing rectangle enclosures