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

DOI10.1016/j.dam.2021.03.009OpenAlexW3153912351WikidataQ114191493 ScholiaQ114191493MaRDI QIDQ2235286

Anil Maheshwari, Farah Chanchary, Michiel H. M. 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal partition trees
• Well-separated pair decomposition in linear time?
• New results and new trends in computer science. Graz, Austria, June 20- 21, 1991. Proceedings
• Line transversals of balls and smallest enclosing cylinders in three dimensions
• Efficient randomized algorithms for some geometric optimization problems
• Querying relational event graphs using colored range searching data structures
• Rank and select revisited and extended
• Window queries for problems on intersecting objects and maximal points
• Approximating extent measures of points
• Time Windowed Data Structures for Graphs
• Priority Search Trees
• Computing the width of a set
• Range-clustering queries
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Finding All Maximal Subsequences with Hereditary Properties
• The skip quadtree
• Fully Dynamic Orthogonal Range Reporting on RAM
• Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

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