Two approaches to building time-windowed geometric data structures

DOI10.4230/LIPICS.SOCG.2016.28zbMATH Open1387.68080MaRDI QIDQ3132862FDOQ3132862

Authors: Timothy M. Chan, Simon Pratt 

Publication date: 30 January 2018

Recommendations

• Two approaches to building time-windowed geometric data structures
• Window queries for problems on intersecting objects and maximal points
• Dynamic geometric data structures via shallow cuttings
• scientific article; zbMATH DE number 1617248
• A dynamic fixed windowing problem

zbMATH Keywords

range searchingtime windowgeometric data structuresdynamic convex hull

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (5)

• Two approaches to building time-windowed geometric data structures
• Window queries for intersecting objects, maximal points and approximations using coresets
• Window queries for problems on intersecting objects and maximal points
• Time windowed data structures for graphs
• The Most Likely Object to be Seen Through a Window

This page was built for publication: Two approaches to building time-windowed geometric data structures

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