Sequential dependency computation via geometric data structures

DOI10.1016/J.COMGEO.2013.08.009zbMATH Open1295.65017OpenAlexW2015984909MaRDI QIDQ390107FDOQ390107

Authors: Gruia Calinescu, Howard Karloff 

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.009

Recommendations

• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• Space-efficient algorithms for longest increasing subsequence
• Space-efficient algorithms for longest increasing subsequence
• Processing an Offline Insertion-Query Sequence with Applications
• Processing an offline insertion-query sequence with applications

zbMATH Keywords

dynamic programmingalgorithmrecurrence relationgap dependencygeometric data structure

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical aspects of recurrence relations (65Q30)

Cites Work

• Orthogonal range searching on the RAM, revisited
• Dynamic fractional cascading
• Title not available (Why is that?)
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

This page was built for publication: Sequential dependency computation via geometric data structures

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