FINDING POPULAR PLACES

DOI10.1142/S0218195910003189MaRDI QIDQ5305062zbMATH OpenOpenAlexFDO

Authors Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle

Publication date 19 March 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195910003189

zbMATH Keywords

trajectoriesspatio-temporal datamoving point objectsmovement pattern

Mathematics Subject Classification ID

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

Recommendations

• Finding Popular Places
• Identifying and querying regularly visited places
• Popular ranking
• Detecting areas visited regularly
• Learning from Popularity

Cites work

• Better lower bounds on detecting affine and spherical degeneracies
• Default risk in bond and credit derivatives markets.
• Lower bounds for approximate polygon decomposition and minimum gap
• Topologically sweeping an arrangement

Cited in

(10)

• Identifying locations from geospatial trajectories
• Efficient evaluation of monitoring top-\(t\) most influential places
• Detecting regular visit patterns
• Probing a set of trajectories to maximize captured information
• Finding Popular Places
• Detecting areas visited regularly
• Identifying and querying regularly visited places
• Approximate hotspots of orthogonal trajectories
• Detecting Regular Visit Patterns
• On the \(k\)-colored rainbow sets in fixed dimensions

This page was built for publication: FINDING POPULAR PLACES

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