Dominance for enclosure problems

DOI10.1007/S10878-025-01373-5MaRDI QIDQ6893262zbMATH OpenFDO

Authors Waseem Akram, Sanjeev Saxena

Publication date 26 November 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01373-5

zbMATH Keywords

algorithmsdata structuresdominancegeometric intersection

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• Algorithms for three-dimensional dominance searching in linear space.
• An improved algorithm for static 3D dominance reporting in the pointer machine
• Dominance for enclosure problems
• Dominance made simple
• Dynamic C-oriented polygonal intersection searching
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Filtering Search: A New Approach to Query-Answering
• scientific article; zbMATH DE number 3948634 (Why is no real title available?)
• Linear space data structures for two types of range search
• On Dominance Reporting in 3D
• On some union and intersection problems for polygons with fixed orientations
• On the equivalence of some rectangle problems
• Optimal computation of finitely oriented convex hulls
• Point enclosure problem for homothetic polygons
• Polygonal intersection searching
• The intersection searching problem for c-oriented polygons

This page was built for publication: Dominance for enclosure problems

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