Window queries for intersecting objects, maximal points and approximations using coresets

DOI10.1016/J.DAM.2021.03.009MaRDI QIDQ2235286zbMATH OpenOpenAlexWikidataFDO

Authors Farah Chanchary, Anil Maheshwari, Michiel Smid

Publication date 21 October 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.03.009

zbMATH Keywords

maximal pointwindow querycoresetintersection decision problemmaximal layer

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of data (68Pxx) Computing methodologies and applications (68Uxx)

Recommendations

• Window queries for problems on intersecting objects and maximal points
• Two approaches to building time-windowed geometric data structures
• Two approaches to building time-windowed geometric data structures
• A dynamic fixed windowing problem
• The Most Likely Object to be Seen Through a Window

Cites work

• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Approximating extent measures of points.
• Computational geometry. Algorithms and applications.
• Computing the width of a set
• Efficient randomized algorithms for some geometric optimization problems
• Finding all maximal subsequences with hereditary properties
• Fully Dynamic Orthogonal Range Reporting on RAM
• Geometric approximation algorithms
• Introduction to algorithms.
• Line transversals of balls and smallest enclosing cylinders in three dimensions
• New results and new trends in computer science. Graz, Austria, June 20- 21, 1991. Proceedings
• Optimal partition trees
• Priority Search Trees
• Querying relational event graphs using colored range searching data structures
• Range-clustering queries
• Rank and select revisited and extended
• The skip quadtree
• Time windowed data structures for graphs
• Two approaches to building time-windowed geometric data structures
• Well-separated pair decomposition in linear time?
• Window queries for problems on intersecting objects and maximal points
• Windows into relational events: data structures for contiguous subsequences of edges

Cited in

(1)

• Optimal window queries on line segments using the trapezoidal search DAG

This page was built for publication: Window queries for intersecting objects, maximal points and approximations using coresets

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