Computing rectangle enclosures

DOI10.1016/0925-7721(93)90012-UzbMATH Open0771.68061MaRDI QIDQ2365809FDOQ2365809

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

Publication date: 29 June 1993

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

Recommendations

• The Rectangle Enclosure and Point-Dominance Problems Revisited
• Fast algorithms for direct enclosures and direct dominances
• scientific article; zbMATH DE number 2105040
• A new algorithm for rectangle enclosure reporting
• Dynamic rectangular intersection with priorities

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)

Cites Work

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

Cited In (8)

• Fast algorithms for direct enclosures and direct dominances
• A new algorithm for rectangle enclosure reporting
• Towards using computational methods for real-time negotiations in electronic commerce
• Some Results for Elementary Operations
• Dynamic rectangular intersection with priorities
• Title not available (Why is that?)
• Deterministic rectangle enclosure and offline dominance reporting on the RAM
• Hierarchical representations of collections of small rectangles

This page was built for publication: Computing rectangle enclosures

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