Computing rectangle enclosures

DOI10.1016/0925-7721(93)90012-UMaRDI QIDQ2365809zbMATH OpenFDO

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

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)

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

Cites work

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

Cited in

(11)

• scientific article; zbMATH DE number 2105040 (Why is no real title available?)
• Finding pairwise intersections of rectangles in a query rectangle
• Towards using computational methods for real-time negotiations in electronic commerce
• Dynamic rectangular intersection with priorities
• Fast algorithms for direct enclosures and direct dominances
• Some Results for Elementary Operations
• Finding pairwise intersections of rectangles in a query rectangle
• A new algorithm for rectangle enclosure reporting
• Deterministic rectangle enclosure and offline dominance reporting on the RAM
• Partial enclosure range searching
• 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)